Proceedings of the Philosophy of Science Association 2002 (3):S168-S177 (2002)
1. The Physical Church-Turing Thesis. Physicists often interpret the Church-Turing Thesis as saying something about the scope and limitations of physical computing machines. Although this was not the intention of Church or Turing, the Physical Church Turing thesis is interesting in its own right. Consider, for example, Wolfram’s formulation: One can expect in fact that universal computers are as powerful in their computational capabilities as any physically realizable system can be, that they can simulate any physical system . . . No physically implementable procedure could then shortcut a computationally irreducible process. (Wolfram 1985) Wolfram’s thesis consists of two parts: (a) Any physical system can be simulated (to any degree of approximation) by a universal Turing machine (b) Complexity bounds on Turing machine simulations have physical signiﬁcance. For example, suppose that the computation of the minimum energy of some system of n particles takes at least exponentially (in n) many steps. Then the relaxation time of the actual physical system to its minimum energy state will also take exponential time.
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.
21 Undecidability and Intractability in Theoretical Physics.Stephen Wolfram - 2013 - Emergence: Contemporary Readings in Philosophy and Science.
Forever is a Day: Supertasks in Pitowsky and Malament-Hogarth Spacetimes.John Earman & John D. Norton - 1993 - Philosophy of Science 60 (1):22-42.
The Church-Turing Thesis and Hyper-Computation.O. Shagrir & I. Pitowsky - forthcoming - Minds and Machines.
Laplace's Demon Consults an Oracle: The Computational Complexity of Prediction.I. Pitowsky - 1996 - Studies in History and Philosophy of Science Part B 27 (2):161-180.
Citations of this work BETA
On the Significance of the Gottesman–Knill Theorem.MIchael E. Cuffaro - 2017 - British Journal for the Philosophy of Science 68 (1):91-121.
The Physical Church-Turing Thesis: Modest or Bold?G. Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733-769.
Reconsidering No-Go Theorems From a Practical Perspective.Michael E. Cuffaro - forthcoming - British Journal for the Philosophy of Science:axw038.
Quantum Hypercomputation—Hype or Computation?Amit Hagar & Alex Korolev - 2007 - Philosophy of Science 74 (3):347-363.
Similar books and articles
On the Physical Possibility of Ordinal Computation (Draft).Jeffrey A. Barrett & Wayne Aitken - unknown
Turing-, Human- and Physical Computability: An Unasked Question. [REVIEW]Eli Dresner - 2008 - Minds and Machines 18 (3):349-355.
SAD Computers and Two Versions of the Church–Turing Thesis.Tim Button - 2009 - British Journal for the Philosophy of Science 60 (4):765-792.
The Physical Church–Turing Thesis: Modest or Bold?Gualtiero Piccinini - 2011 - British Journal for the Philosophy of Science 62 (4):733 - 769.
Physical Hypercomputation and the Church–Turing Thesis.Oron Shagrir & Itamar Pitowsky - 2003 - Minds and Machines 13 (1):87-101.
Hypercomputation and the Physical Church-Turing Thesis.Paolo Cotogno - 2003 - British Journal for the Philosophy of Science 54 (2):181-223.
Added to index2009-01-28
Total downloads70 ( #74,540 of 2,164,583 )
Recent downloads (6 months)15 ( #22,012 of 2,164,583 )
How can I increase my downloads?