1996
DOI: 10.1007/bf00413693
|View full text |Cite
|
Sign up to set email alerts
|

What is computation?

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
98
0
1

Year Published

2006
2006
2019
2019

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 170 publications
(99 citation statements)
references
References 17 publications
0
98
0
1
Order By: Relevance
“…I maintain that this presupposition is unjustified, for digital computation Manipulation, Physical Symbol Systems), but others need not be (cf. Copeland 1996, Chalmers 1995, Piccinini 2007. This simply reinforces the need to commit to a particular account of computation.…”
Section: Avoiding Ambiguity About Concrete Digital Computationmentioning
confidence: 75%
See 2 more Smart Citations
“…I maintain that this presupposition is unjustified, for digital computation Manipulation, Physical Symbol Systems), but others need not be (cf. Copeland 1996, Chalmers 1995, Piccinini 2007. This simply reinforces the need to commit to a particular account of computation.…”
Section: Avoiding Ambiguity About Concrete Digital Computationmentioning
confidence: 75%
“…91-92;: p. 610) account implies that for a system to perform digital computation it needs to execute an algorithm where its output and final state are a causal outcome of its input and 20 initial state. Copeland's (1996) account introduces further requirements: the existence of the right labelling scheme as well as a formal description of that system, and an "honest" model that binds them together.…”
Section: The Algorithm Execution Accountmentioning
confidence: 99%
See 1 more Smart Citation
“…the reconstruction of Smith's participatory account in Fresco forthcoming as well as the FSM and PSS accounts discussed above), but others need not be (cf. Copeland 1996, Chalmers 1994, the Mechanistic account discussed above). This simply reinforces the need to commit to a particular account of computation.…”
Section: Discussionmentioning
confidence: 95%
“…This is all well and good. Still, as I have argued above, concrete computation (but perhaps not cognitive computation) could be explained without necessarily invoking any representational properties (e.g., by the Mechanistic account above or the Algorithm Execution account in Copeland 1996). If one wishes to commit to a representational account of digital computation, since cognition is representational, one should firstly justify why computation proper is representational.…”
Section: Universal Tmsmentioning
confidence: 99%