Computationalism, The Church–Turing Thesis, and the Church–Turing Fallacy

  title={Computationalism, The Church–Turing Thesis, and the Church–Turing Fallacy},
  author={G. Piccinini},
  • G. Piccinini
  • Published 2005
  • Mathematics, Computer Science
  • Synthese
The Church–Turing Thesis (CTT) is often employed in arguments for computationalism. I scrutinize the most prominent of such arguments in light of recent work on CTT and argue that they are unsound. Although CTT does nothing to support computationalism, it is not irrelevant to it. By eliminating misunderstandings about the relationship between CTT and computationalism, we deepen our appreciation of computationalism as an empirical hypothesis. 
Computational modelling vs. Computational explanation: Is everything a Turing Machine, and does it matter to the philosophy of mind?
It is found that although some varieties of pancomputationalism are more plausible than others, only the strongest variety is relevant to the philosophy of mind, but only the most trivial varieties are true. Expand
Does the Principle of Computational Equivalence Overcome the Objections against Computationalism
Computationalism has been variously defined as the idea that the human mind can be modelled by means of mechanisms broadly equivalent to Turing Machines. Computationalism’s claims have been hotlyExpand
On the Possibilities of Hypercomputing Supertasks
It is concluded that hypercomputing supertasks are impossible in the actual world and thus no reason for rejection or re-interpretation of the Church-Turing thesis in its traditional interpretation. Expand
The Mind as Neural Software? Understanding Functionalism, Computationalism, and Computational Functionalism
Defending or attacking either functionalism or computationalism requires clarity on what they amount to and what evidence counts for or against them. My goal here is not to evaluate theirExpand
Can Machines Think? An Old Question Reformulated
This paper will further propose a modification of the above mentioned explication of the notion of machines by quantifying the length of an algorithm, which appears possible to reconcile the opposing views on the topic. Expand
Computationalism in the Philosophy of Mind
Computationalism has been the mainstream view of cognition for decades. There are periodic reports of its demise, but they are greatly exaggerated. This essay surveys some recent literature onExpand
Can Ai Be Intelligent?
Abstract The aim of this paper is an attempt to give an answer to the question what does it mean that a computational system is intelligent. We base on some theses that though debatable are commonlyExpand
Computational explanation in neuroscience
Some philosophical questions pertaining to computational explanation are raised and some promising answers that are being developed by a number of authors are outlined. Expand
The Mode of Computing
The Mode of Computing provides a novel perspective on the phenomena of computing, interpreting, the representational and non-representational views of cognition, and consciousness. Expand
Here I outline some of the issues and properties of these uncon- ventional substrates that need to be addressed to find “natural” approaches to programming them. Expand


Physical Hypercomputation and the Church–Turing Thesis
It is argued that the existence of the device does not refute the Church–Turing thesis, but nevertheless may be a counterexample to Gandy's thesis. Expand
The Church-Turing Thesis
The Church-Turing thesis, which states that every effective computation can be carried out by a Turing machine, is often misunderstood. Expand
Is the Church-Turing thesis true?
It is argued that mundane procedures can be said to be effective in the same sense in which Turing machine procedures can been said toBe effective, and that mundane Procedures differ from Turing machine Procedures in a fundamental way, viz., the former, but not the latter, generate causal processes. Expand
Mechanistic Theories in Cognitive Science: The Import of Turing’s Thesis
TT enables one to set a necessary condition (hereinafter referred to as Cf) on theories in CS to count as mechanistic, requiring that the laws accounting for the input/output behavior of the subjects in the domain of the theory be expressible in terms of Turing computable functions. Expand
Hypercomputation and the Physical Church‐Turing Thesis
  • Paolo Cotogno
  • Computer Science
  • The British Journal for the Philosophy of Science
  • 2003
A version of the Church‐Turing Thesis states that every effectively realizable physical system can be defined by Turing Machines (‘Thesis P’); in this formulation the Thesis appears an empirical,Expand
Thinking Machines: Some Fundamental Confusions
This paper explores Church's Thesis and related claims made by Turing, and it is argued that Turing's claims are true, and that they support (the truth of)Church's The thesis. Expand
Functionalism, Computationalism, and Mental States
Abstract Some philosophers have conflated functionalism and computationalism. I reconstruct how this came about and uncover two assumptions that made the conflation possible. They are the assumptionsExpand
Alan Turing and the Mathematical Objection
Logico-mathematical reasons, stemming from his own work, helped to convince Alan Turing that it should be possible to reproduce human intelligence, and eventually compete with it, by developing the appropriate kind of digital computer. Expand
Could a machine think?
The authors reject the Turing test as a sufficient condition for conscious intelligence and base their position of the specific behavioral failures of the classical SM machines and on the specific virtues of machines with a more brain-like architecture, which show that certain computational strategies have vast and decisive advantages over others where typical cognitive tasks are concerned. Expand
Turing’s O-machines, Searle, Penrose and the brain
Analogies offered in the literature include hurricanes, the motion of the planets around the sun, and the digestion of pizza. None of these phenomena is itself computational in nature yet,Expand