2007
DOI: 10.1086/522851
|View full text |Cite
|
Sign up to set email alerts
|

Computing Mechanisms

Abstract: This paper offers an account of what it is for a physical system to be a computing mechanism-a system that performs computations. A computing mechanism is a mechanism whose function is to generate output strings from input strings and (possibly) internal states, in accordance with a general rule that applies to all relevant strings and depends on the input strings and (possibly) internal states for its application. This account is motivated by reasons endogenous to the philosophy of computing, namely, doing ju… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
88
0
2

Year Published

2011
2011
2020
2020

Publication Types

Select...
5
3
1

Relationship

2
7

Authors

Journals

citations
Cited by 141 publications
(90 citation statements)
references
References 41 publications
0
88
0
2
Order By: Relevance
“…True, general purpose computers are different from most other systems precisely because they can do so many things depending on how they are programmed. But general purpose computers are still mechanisms, and the explanation of their behavior is still mechanistic (Piccinini 2007(Piccinini , 2008). Furthermore, the task analysis of a general purpose computer does place direct constraints on its mechanistic explanation and vice versa; in fact, even the task analysis of a general purpose computer is just an elliptical mechanistic explanation.…”
Section: Task Analysismentioning
confidence: 99%
See 1 more Smart Citation
“…True, general purpose computers are different from most other systems precisely because they can do so many things depending on how they are programmed. But general purpose computers are still mechanisms, and the explanation of their behavior is still mechanistic (Piccinini 2007(Piccinini , 2008). Furthermore, the task analysis of a general purpose computer does place direct constraints on its mechanistic explanation and vice versa; in fact, even the task analysis of a general purpose computer is just an elliptical mechanistic explanation.…”
Section: Task Analysismentioning
confidence: 99%
“…But such an explanation is still mechanistic: it specifies the type of vehicle being processed (digital, analog, or what have you) as well as the structural components that do the processing, their organization, and the functions they compute. So computational explanations are mechanistic too (Piccinini 2007, Piccinini andScarantino 2010).…”
Section: Boxologymentioning
confidence: 99%
“…But this observation only reinforces the conclusion that random processes are not computations, for random processes, unlike computations, cannot go wrong. For more on the possibility of miscomputation as a feature of genuine computation, see Piccinini 2007b. course and wait until the n th value is generated. If this won't happen until a million years from now, that's too bad.…”
Section: Lack Of Confluencementioning
confidence: 99%
“…Separation Logic reasons about machines colloquially called 'computers'. However, the important part of Infer is that it predicts what a complex object we care about will do, not questions of whether physical objects compute (Piccinini 2007) or whether a computation is a miscomputation or dysfunctional (Floridi et al 2015). This distinction gives a sense of the extent to which tools like Infer are pragmatic, engineering projects.…”
Section: Introductionmentioning
confidence: 99%