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.
Contents
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
- ↑ Lua error in package.lua at line 80: module 'strict' not found.
General References
- Lua error in package.lua at line 80: module 'strict' not found.
Further reading
- Lua error in package.lua at line 80: module 'strict' not found.
- 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
- Lua error in package.lua at line 80: module 'strict' not found.
<templatestyles src="Asbox/styles.css"></templatestyles>
