The Physical Church-Turing Thesis: Modest or Bold?


Authors
Gualtiero Piccinini
University of Missouri, St. Louis
Abstract
This article defends a modest version of the Physical Church-Turing thesis (CT). Following an established recent trend, I distinguish between what I call Mathematical CT—the thesis supported by the original arguments for CT—and Physical CT. I then distinguish between bold formulations of Physical CT, according to which any physical process—anything doable by a physical system—is computable by a Turing machine, and modest formulations, according to which any function that is computable by a physical system is computable by a Turing machine. I argue that Bold Physical CT is not relevant to the epistemological concerns that motivate CT and hence not suitable as a physical analog of Mathematical CT. The correct physical analog of Mathematical CT is Modest Physical CT. I propose to explicate the notion of physical computability in terms of a usability constraint, according to which for a process to count as relevant to Physical CT, it must be usable by a finite observer to obtain the desired values of a function. Finally, I suggest that proposed counterexamples to Physical CT are still far from falsifying it because they have not been shown to satisfy the usability constraint.
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1093/bjps/axr016
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 46,206
Through your library

References found in this work BETA

On the Proper Treatment of Connectionism.Paul Smolensky - 1988 - Behavioral and Brain Sciences 11 (1):1-23.
Physical Symbol Systems.Allen Newell - 1980 - Cognitive Science 4 (2):135-83.
Computing Machinery and Intelligence.Alan M. Turing - 1950 - Mind 59 (October):433-60.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 74 references / Add more references

Citations of this work BETA

What is a Computer? A Survey.William J. Rapaport - 2018 - Minds and Machines 28 (3):385-426.

View all 15 citations / Add more citations

Similar books and articles

SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
Quantum Speed-Up of Computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
The Church-Turing Thesis.B. Jack Copeland - 2008 - In Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy. The Metaphysics Research Lab, Stanford University.
Is the Church-Turing Thesis True?Carol E. Cleland - 1993 - Minds and Machines 3 (3):283-312.
Church's Thesis and the Conceptual Analysis of Computability.Michael Rescorla - 2007 - Notre Dame Journal of Formal Logic 48 (2):253-280.

Analytics

Added to PP index
2010-03-12

Total views
221 ( #33,199 of 2,285,686 )

Recent downloads (6 months)
17 ( #49,770 of 2,285,686 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature