Physical computation: How general are Gandy's principles for mechanisms?

Minds and Machines 17 (2):217-231 (2007)
Abstract
What are the limits of physical computation? In his ‘Church’s Thesis and Principles for Mechanisms’, Turing’s student Robin Gandy proved that any machine satisfying four idealised physical ‘principles’ is equivalent to some Turing machine. Gandy’s four principles in effect define a class of computing machines (‘Gandy machines’). Our question is: What is the relationship of this class to the class of all (ideal) physical computing machines? Gandy himself suggests that the relationship is identity. We do not share this view. We will point to interesting examples of (ideal) physical machines that fall outside the class of Gandy machines and compute functions that are not Turing-machine computable.
Keywords Accelerating Turing machine   Asynchronous computation   Church's thesis   Davies   Determinism   Gandy   Hogarth   Hypercomputation   Physical computation   Pitowsky   Supertask
Categories (categorize this paper)
DOI 10.1007/s11023-007-9058-2
Options
 Save to my reading list
Follow the author(s)
Edit this record
My bibliography
Export citation
Find it on Scholar
Mark as duplicate
Request removal from index
Revision history
Download options
Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 32,564
Through your library
References found in this work BETA
Shadows of the Mind.Roger Penrose - 1994 - Oxford University Press.
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.

View all 22 references / Add more references

Citations of this work BETA
The Physical Church-Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
Concrete Digital Computation: What Does It Take for a Physical System to Compute? [REVIEW]Nir Fresco - 2011 - Journal of Logic, Language and Information 20 (4):513-537.

View all 6 citations / Add more citations

Similar books and articles
The Broad Conception of Computation.Jack Copeland - 1997 - American Behavioral Scientist 40 (6):690-716.
Quantum Speed-Up of Computations.Itamar Pitowsky - 2002 - Proceedings of the Philosophy of Science Association 2002 (3):S168-S177.
Added to PP index
2009-01-28

Total downloads
99 ( #59,474 of 2,235,779 )

Recent downloads (6 months)
7 ( #82,395 of 2,235,779 )

How can I increase my downloads?

Monthly downloads
My notes
Sign in to use this feature