论文信息 - Pf ≠ NPf for almost all f - 字舞流文

Pf ≠ NPf for almost all f

We discuss the question of Ralf-Dieter Schindler whether for infinite time Turing machines P f = NP f can be true for any function f from the reals into !1. We show that “almost everywhere” the answer is negative.

Joel David Hamkins | Philip D. Welch | J. Hamkins | P. Welch

[1] Joel David Hamkins,et al. Infinite Time Turing Machines , 2000 .

[2] Stephen G. Simpson,et al. On Kleene Degrees of Analytic Sets , 1980 .

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

[4] Philip D. Welch,et al. Post's and other problems in higher type supertasks , 2004 .

[5] Jon Barwise,et al. Admissible sets and structures , 1975 .

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

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