Ordinal computability. An introduction to infinitary machines
From MaRDI portal
Publication:1738872
DOI10.1515/9783110496154OpenAlexW2975027772MaRDI QIDQ1738872
Publication date: 18 April 2019
Published in: De Gruyter Series in Logic and Its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1515/9783110496154
Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Turing machines and related notions (03D10) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Related Items (11)
Effectivity and reducibility with ordinal Turing machines ⋮ Space-bounded OTMs and REG ∞ ⋮ Decision times of infinite computations ⋮ Symmetry for transfinite computability ⋮ All melodies are lost -- recognizability for weak and strong \(\alpha \)-register machines ⋮ Realisability for infinitary intuitionistic set theory ⋮ Weaker variants of infinite time Turing machines ⋮ Taming Koepke's zoo. II: Register machines ⋮ Characterisations of variant transfinite computational models: Infinite time Turing, ordinal time Turing, and Blum–Shub–Smale machines ⋮ Lower bounds on \(\beta (\alpha)\) ⋮ The lost melody theorem for infinite time Blum-Shub-Smale machines
This page was built for publication: Ordinal computability. An introduction to infinitary machines
