Church–Turing–Deutsch principle
In computer science and quantum physics, the Church–Turing–Deutsch principle (CTD principle[1]) is a stronger, physical form of the Church–Turing thesis formulated by David Deutsch in 1985.
Statement
The principle states that a universal computing device can simulate every physical process.
History
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 numbers, cannot be simulated by a Turing machine, which can only represent computable reals.
Deutsch proposed that quantum computers may actually obey the CTD principle, assuming that the laws of quantum physics can completely describe every physical process.
See also
- Quantum complexity theory
- Digital physics
- Holographic principle and Bekenstein bound, which prohibit unlimited precision real numbers in the physical universe
Notes
- ↑ Nielsen, Michael. "Interesting problems: The Church–Turing–Deutsch Principle". Retrieved 10 May 2014.
General References
- Deutsch, D. (1985). "Quantum theory, the Church–Turing principle and the universal quantum computer" (PDF). Proceedings of the Royal Society. London. 400: 97–117. doi:10.1098/rspa.1985.0070.
Further reading
- Deutsch, D. (1997). "6: Universality and the Limits of Computation". The Fabric of Reality. New York: Allan Lane. ISBN 0-14-027541-X.
- 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 3-540-20020-7, pp. 213–240
External links
This article is issued from Wikipedia - version of the 6/29/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.