A.Lewis, Infinite time turing machines

by Joel David Hamkins , Andy Lewis
Venue:Journal of Symbolic Logic
Citations:73 - 5 self

Documents Related by Co-Citation

1150 On computable numbers, with an application to the Entscheidungsproblem – A M Turing - 1936
31 The truth is never simple – J P Burgess - 1986
123 Systems of Logic Based on Ordinals – A M Turing - 1939
63 Computation beyond the Turing limit – H T Siegelmann - 1995
15 Even Turing Machines Can Compute Uncomputable Functions – B. Jack Copeland - 1998
19 The limits of empiricism – B A W Russell - 1936
649 Quantum theory, the Church-Turing principle and the universal quantum computer – David Deutsch - 1985
261 An Unsolvable Problem of Elementary Number Theory – A Church - 1936
28 Beyond The Universal Turing Machine – B. Jack Copeland, Richard Sylvan - 1998
6 Minimality Arguments for Infinite Time Turing Degrees – P. D. Welch
185 Computability and logic – G Boolos, R Jeffrey - 1989
12 Eventually Infinite Time Turing degrees: infinite time decidable reals – P D Welch
191 Admissible Sets and Structures – J Barwise - 1975
40 Notes on Naive Semantics – H Herzberger - 1982
12 Naive semantics and the Liar paradox – H G Herzberger - 1982
7 Recursive Function Theory. Higher Mathematics – H Rogers - 1967
4 Set-Theoretic Absoluteness and The Revision Theory of Truth – Benedikt Löwe, Philip D. Welch - 2000
30 X-Machines and the Halting Problem: Building a super-Turing Machine – Mike Stannett - 1990
453 Computation – Finite and Infinite Machines – M Minsky - 1967