Advertisement

Is P = PSPACE for Infinite Time Turing Machines?

Conference paper
  • 213 Downloads
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5489)

Introduction

In the existing literature on infinite time Turing machines (ITTM), which were originally defined in [3], issues of time complexity have been widely considered. The question \(\mathbf{P} \stackrel{?}{=} \mathbf{NP}\) for Infinite Time Turing Machines, and several variants on it, are treated in, e.g., [6],[2], and [4].

Besides time complexity, we may also try to look at issues of space complexity in ITTMs. However, because an ITTM contains tapes of length ω, and all nontrivial ITTM computations will use the entire, ω-length tape, simply measuring the space complexity by counting the portion of the tape used by the computation is not an option. In [5], therefore, an alternate notion of space complexity is provided, that is based on looking at the levels of Gödel’s constructible hierarchy where the snapshots of the computation can be found.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Barry Cooper, S.: Computability Theory. Chapman & Hall/CRC (2004)Google Scholar
  2. 2.
    Deolalikar, V., Hamkins, J.D., Schindler, R.-D.: PNP ∩ co-NP for infinite time Turing machines. J. Log. Comput. 15, 577–592 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Hamkins, J.D., Lewis, A.: Infinite time Turing machines. J. Symb. Log. 65, 567–604 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Hamkins, J.D., Welch, P.D.: P fNP f for almost all f. Math. Log. Q. 49(5), 536–540 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Löwe, B.: Space bounds for infinitary computation. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 319–329. Springer, Heidelberg (2006)CrossRefGoogle Scholar
  6. 6.
    Schindler, R.: P ≠ NP for infinite time Turing machines. Monatsh. Math. 139, 335–340 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Winter, J.: Space Complexity in infinite time Turing Machines, ILLC Publications, MoL-2007-14 (2007)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  1. 1.Bovenover 215AmsterdamThe Netherlands

Personalised recommendations