Part of the Lecture Notes in Computer Science book series (LNCS, volume 3526)
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.
KeywordsTuring Machine Time Analogue Computable Presentation Time Context Halt State
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 9.Deolalikar, V., Hamkins, J.D., Schindler, R.D.: P ≠ NP ∩ co − NP for infinite time turing machines (submitted)Google Scholar
© Springer-Verlag Berlin Heidelberg 2005