Infinite time Turing machine: Difference between revisions

Jump to navigation Jump to search
Created page with "The infinite time Turing machines are a powerful method of computation introduced by Joel David Hamkins and Andy Lewis.<ref>Infinite Time Turing Machines, Joel David Hamkins and Andy Lewis, 1998</ref> They augment the normal notion of a Turing machine (first introduced by Alan Turing in his seminal paper<ref>Turing, A.M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem". ''Proceedings of the London Mathematical Society''.</ref>), to a hypot..."
(Created page with "The infinite time Turing machines are a powerful method of computation introduced by Joel David Hamkins and Andy Lewis.<ref>Infinite Time Turing Machines, Joel David Hamkins and Andy Lewis, 1998</ref> They augment the normal notion of a Turing machine (first introduced by Alan Turing in his seminal paper<ref>Turing, A.M. (1936). "On Computable Numbers, with an Application to the Entscheidungsproblem". ''Proceedings of the London Mathematical Society''.</ref>), to a hypot...")
(No difference)
Anonymous user
Cookies help us deliver our services. By using our services, you agree to our use of cookies.

Navigation menu