论文信息 - Infinitary Computability with Infinite Time Turing Machines - 字舞流文

Infinitary Computability with Infinite Time Turing Machines

Recent developments in the theory of infinite time Turing machines include the solution of the infinitary P versus NP problem and the rise of infinitary computable model theory.

Joel David Hamkins | J. Hamkins

[1] Joel David Hamkins,et al. Infinite Time Turing Machines With Only One Tape , 1999, Math. Log. Q..

[2] Ralf Schindler,et al. P≠NP for Infinite Time Turing Machines , 2003 .

[3] Andrew Lewis,et al. Post's problem for supertasks has both positive and negative solutions , 2002, Arch. Math. Log..

[4] John K. Truss,et al. Sets and Proofs , 1999 .

[5] Joel David Hamkins,et al. Infinite Time Turing Machines , 1998, Journal of Symbolic Logic.

[6] Benedikt Löwe,et al. Revision Sequences and Computers with an Infinite Amount of Time , 2001, J. Log. Comput..

[7] Philip D. Welch,et al. The Length of Infinite Time Turing Machine Computations , 2000 .

[8] Joel David Hamkins,et al. P != NP cap co-NP for Infinite Time Turing Machines , 2005, J. Log. Comput..

[9] Pd Welch. Friedman's Trick: Minimality Arguments in the Infinite Time Turing Degrees , 1999 .

[10] Philip D. Welch,et al. Eventually infinite time Turing machine degrees: infinite time decidable reals , 2000, Journal of Symbolic Logic.