Abstract
Infinite time register machines (ITRMs) are register machines which act on natural numbers and which are allowed to run for arbitrarily many ordinal steps. Successor steps are determined by standard register machine commands. At limit times a register content is defined as a \(\liminf\) of previous register contents, if that limit is finite; otherwise the register is reset to 0. (A previous weaker version of infinitary register machines, in [6], would halt without a result in case of such an overflow.) The theory of infinite time register machines has similarities to the infinite time Turing machines (ITTMs) of Hamkins and Lewis. Indeed ITRMs can decide all \(\Pi^1_1\) sets, yet they are strictly weaker than ITTMs.
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 (1980)
Dimitriou, I., Hamkins, J.D., Koepke, P.(eds.): BIWOC – Bonn International Workshop on Ordinal Computability. Bonn Logic Reports (2007)
Hamkins, J.D., Lewis, A.: Infinite Time Turing Machines. J. Symbolic Logic 65(2), 567–604 (2000)
Hamkins, J.D., Linetsky, D., Miller, R.: The complexity of quickly ORM-decidable sets. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497. Springer, Heidelberg (2007)
Hamkins, J.D., Miller, R.: Post’s problem for ordinal register machines. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497, pp. 358–367. Springer, Heidelberg (2007)
Koepke, P.: Infinite time register machines. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 257–266. Springer, Heidelberg (2006)
Koepke, P.: Turing computations on ordinals. B. Symbolic Logic 11, 377–397 (2005)
Koepke, P., Siders, R.: Computing the recursive truth predicate on ordinal register machines. In: Beckmann, A., et al. (eds.) Logical approaches to computational barriers. Computer Science Report Series, vol. 7, pp. 160–169 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Koepke, P., Miller, R. (2008). An Enhanced Theory of Infinite Time Register Machines. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)