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 stated by Deutsch in 1985 with respect to finitary machines and processes. He 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.

An earlier version of this thesis for classical computers was stated by Alan Turing's friend and student Robin Gandy in 1980[2][3].

See also

Notes

  1. ↑ Nielsen, Michael. "Interesting problems: The Church–Turing–Deutsch Principle". Retrieved 10 May 2014.
  2. ↑ Gandy, R. (1980). Church’s thesis and principles for mechanisms. Studies in Logic and the Foundations of Mathematics (101), 123-148
  3. ↑ Kaznatcheev, Artem. "Falsifiability and Gandy's variant of the Church-Turing thesis". Retrieved 23 July 2018.

References

  • Deutsch, D. (1985). "Quantum theory, the Church–Turing principle and the universal quantum computer" (PDF). Proceedings of the Royal Society. London. 400: 97&ndash, 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
  • Nielsen, Michael (2004-04-16). "Interesting problems: The Church–Turing–Deutsch Principle".
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.