Register computations on ordinals

DOI10.1007/S00153-008-0093-3zbMATH Open1145.03022OpenAlexW2001043560MaRDI QIDQ944224

Ryan Siders, Peter Koepke

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

zbMATH Keywords

hypercomputationconstructible universeinfinitary computationordinal computabilityordinal register machine

Mathematics Subject Classification ID

Inner models, including constructibility, ordinal definability, and core models (03E45) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Turing Computations On Ordinals
• Infinite time Turing machines
• Set Theory
• Consistency of the Continuum Hypothesis. (AM-3)

Related Items (13)

On λ-Definable Functions on Ordinals ⋮ Recognizable sets and Woodin cardinals: computation beyond the constructible universe ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ Arithmetization of register machines with counters ⋮ Ordinal Computability ⋮ Minimality considerations for ordinal computers modeling constructibility ⋮ The basic theory of infinite time register machines ⋮ Turing Computations On Ordinals ⋮ A Computational Approach to an Alternative Working Environment for the Constructible Universe ⋮ Taming Koepke's zoo. II: Register machines ⋮ Post's problem for ordinal register machines: an explicit approach ⋮ Title not available (Why is that?) ⋮ Lower bounds on \(\beta (\alpha)\)

This page was built for publication: Register computations on ordinals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q944224)