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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Koepke, P. (2006). Infinite time register machines. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3988 LNCS, pp. 257–266). Springer Verlag. https://doi.org/10.1007/11780342_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
