Church–Turing–Deutsch principle
From Wikipedia, the free encyclopedia
In computer science and quantum physics, the Church–Turing–Deutsch principle (CTD principle) is a stronger, physical form of the Church–Turing thesis formulated by David Deutsch in 1985. The principle states that a universal computing device can simulate every physical process. The principle was originally stated by Deutsch with respect to finitary machines and processes. He immediately observed that classical physics, which makes use of the concept of real number cannot be simulated by a Turing machine, which can only represent computable reals. Deutsch proposed that quantum computers may actually obey CTD, assuming that the laws of quantum physics can completely describe every physical process.
[edit] See also
- Quantum complexity theory
- Digital physics
- Holographic principle and Bekenstein bound, which prohibit unlimited precision real numbers in the physical universe
[edit] References
- Deutsch, D. (1985). "Quantum theory, the Church–Turing principle and the universal quantum computer". Proceedings of the Royal Society (London) (400): 97–117. http://physics.princeton.edu/~mcdonald/examples/QM/deutsch_prsl_a400_97_85.pdf.
[edit] Further reading
- Deutsch, D. (1997). "6: Universality and the Limits of Computation". The Fabric of Reality. New York: Allan Lane.
- Christopher G. Timpson Quantum Computers: the Church-Turing Hypothesis Versus the Turing Principle in Christof Teuscher, Douglas Hofstadter (eds.) Alan Turing: life and legacy of a great thinker, Springer, 2004, ISBN 3540200207, pp. 213–240
[edit] External links
- Nielsen, Michael (2004-04-16). "Interesting problems: The Church–Turing–Deutsch Principle". http://michaelnielsen.org/blog/?p=71.
| P ≟ NP | This theoretical computer science-related article is a stub. You can help Wikipedia by expanding it. |
