The Complexity of Quickly ORM-Decidable Sets

  • Joel D. Hamkins
  • David Linetsky
  • Russell Miller
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4497)

Abstract

The Ordinal Register Machine (ORM) is one of several different machine models for infinitary computability. We classify, by complexity, the sets that can be decided quickly by ORMs. In particular, we show that the arithmetical sets are exactly those sets that can be decided by ORMs in times uniformly less than \({\ensuremath{\omega^\omega}}\). Further, we show that the hyperarithmetical sets are exactly those sets that can be decided by an ORM in time uniformly less than \(\omega_1^{CK}\).

Keywords

Ordinal ordinal computation infinite time computation computability register machine arithmetical hierarchy hyperarithmetical hierarchy complexity 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ashe, C.J., Knight, J.: Computable Structures and the Hyperarithmetical Hierarchy. In: Studies in Logic and the Foundations of Mathematics, Elsevier, Amsterdam (2000)Google Scholar
  2. Hamkins, J.D., Lewis, A.: Infinite Time Turing Machines. J. Symbolic Logic 65(2), 567–604 (2000)MathSciNetCrossRefMATHGoogle Scholar
  3. Hamkins, J.D., Miller, R.: Post’s Problem for Ordinal Register Machines (to appear in this volume)Google Scholar
  4. Jech, T.: Set Theory. The Third Millenium Edition. In: Springer Monographs in Mathematics, Springer, Heidelberg (2003)Google Scholar
  5. Koepke, P.: Ordinals, Computations, and Models of Set Theory: A Tutorial at Days in Logic, Coimbra, Portugal. Tutorial Material. (accessed January 2006), http://www.mat.uc.pt/~kahle/dl06/koepke.pdf
  6. Koepke, P.: Turing Computations on Ordinals. J. Symbolic Logic 11(3), 377–397 (2005)MathSciNetCrossRefMATHGoogle Scholar
  7. Rogers Jr, H.: Theory of Recursive Functions and Effective Computability. The MIT Press, Cambridge (1967)MATHGoogle Scholar
  8. Sacks, G.E.: Higher Recursion Theory. In: Perspectives in Mathematical Logic, Springer, Heidelberg (1990)Google Scholar
  9. Shoenfield, J.R. (ed.): Recursion Theory. Lecture Notes in Logic. Springer, Heidelberg (1993)MATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • Joel D. Hamkins
    • 1
  • David Linetsky
    • 2
  • Russell Miller
    • 3
  1. 1.The College of Staten Island of CUNY and The CUNY Graduate CenterUSA
  2. 2.The CUNY Graduate Center, 365 Fifth Avenue, New York NY 10016USA
  3. 3.Queens College of CUNY and The CUNY Graduate CenterUSA

Personalised recommendations