Register computations on ordinals
From MaRDI portal
Publication:944224
DOI10.1007/s00153-008-0093-3zbMath1145.03022MaRDI QIDQ944224
Publication date: 12 September 2008
Published in: Archive for Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00153-008-0093-3
hypercomputation; constructible universe; infinitary computation; ordinal computability; ordinal register machine
03E45: Inner models, including constructibility, ordinal definability, and core models
03D60: Computability and recursion theory on ordinals, admissible sets, etc.
Related Items
On λ-Definable Functions on Ordinals, Post's problem for ordinal register machines: an explicit approach, The basic theory of infinite time register machines, Minimality considerations for ordinal computers modeling constructibility, A Computational Approach to an Alternative Working Environment for the Constructible Universe, Ordinal Computability
Cites Work