A.Lewis, Infinite time turing machines

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

Documents Related by Co-Citation

1161 On computable numbers with an application to the Entscheidungsproblem – A Turing - 1936
656 Quantum theory, the Church-Turing principle and the universal quantum computer – David Deutsch - 1985
31 Beyond The Universal Turing Machine – B. Jack Copeland, Richard Sylvan - 1998
265 An unsolvable problem of elementary number theory – A Church - 1936
31 The truth is never simple – J P Burgess - 1986
125 System of logics 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
62 Quantum Algorithm For Hilberts Tenth Problem – Tien D Kieu - 2003
12 On the computational power and super-Turing capabilities of dynamical systems – Olivier Bournez, Michel Cosnard - 1995
6 Minimality Arguments for Infinite Time Turing Degrees – P. D. Welch
185 Computability and Logic – George Boolos, Richard Jeffrey - 1974
12 Eventually Infinite Time Turing degrees: infinite time decidable reals – P D Welch
193 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