Abstract
Infinite time register machines (ITRMs) are register machines which act on natural numbers and which may run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands, at limits the register contents are defined as lim inf’s of the previous register contents. We prove that a real number is computable by an ITRM iff it is hyperarithmetic.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cutland, N.J.: Computability: An Introduction to Recursive Function Theory. In: Perspectives in Mathematical Logic. Cambridge University Press, Cambridge (1980)
Hamkins, J.D., Lewis, A.: Infinite Time Turing Machines. J. Symbolic Logic 65(2), 567–604 (2000)
Koepke, P.: Turing computations on ordinals. Bulletin of Symbolic Logic 11(3), 377–397 (2005)
Koepke, P.: Computing a Model of Set Theory. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 223–232. Springer, Heidelberg (2005)
Koepke, P., Friedman, S.: An elementary approach to the fine structure of L. Bulletin of Symbolic Logic 3(4), 453–468 (1997)
Koepke, P., Koerwien, M.: Ordinal computations. In: Mathematics of Computation at CiE 2005; Special issue of the journal Mathematical Structures in Computer Science, 17 pages (to appear, 2005)
Koepke, P., Siders, R.: Computing the recursive truth predicate on ordinal register machines. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988. Springer, Heidelberg (2006)
Sacks, G.E.: Higher Recursion Theory. In: Perspectives in Mathematical Logic. Springer, Berlin (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koepke, P. (2006). Infinite Time Register Machines. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds) Logical Approaches to Computational Barriers. CiE 2006. Lecture Notes in Computer Science, vol 3988. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11780342_27
Download citation
DOI: https://doi.org/10.1007/11780342_27
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-35466-6
Online ISBN: 978-3-540-35468-0
eBook Packages: Computer ScienceComputer Science (R0)