Ordinal computations

DOI10.1017/S0960129506005615MaRDI QIDQ3422023zbMATH OpenOpenAlexFDO

Authors Peter Koepke, Martin Koerwien

Publication date 9 February 2007

Published in Mathematical Structures in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/s0960129506005615

zbMATH Keywords

computations on tapes of arbitrary ordinal lengthconstructible universeordinal computability

Mathematics Subject Classification ID

Turing machines and related notions (03D10) Ordinal and cardinal numbers (03E10) Inner models, including constructibility, ordinal definability, and core models (03E45)

Recommendations

• New Computational Paradigms
• Turing Computations On Ordinals
• Ordinals, computations, and models of set theory
• Register computations on ordinals
• Ordinal computability

Cited in

(14)

• Some transfinite generalisations of Gödel's incompleteness theorem
• Computability on the countable ordinals and the Hausdorff-Kuratowski theorem (extended abstract)
• scientific article; zbMATH DE number 5997358 (Why is no real title available?)
• Generalized effective reducibility
• Turing Computations On Ordinals
• Ordinals, computations, and models of set theory
• Ordinal computability
• Tree representations via ordinal machines
• Physical computational complexity and first-order logic
• Local computability for ordinals
• Sums of computable ordinals
• Constructive Theory of Ordinals
• Ordinal arithmetic based on Skolem hulling
• Register computations on ordinals

This page was built for publication: Ordinal computations

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