Ordinal computations

DOI10.1017/S0960129506005615zbMath1117.03046OpenAlexW2914609259MaRDI QIDQ3422023

Martin Koerwien, Peter Koepke

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

constructible universeordinal computabilitycomputations on tapes of arbitrary ordinal length

Mathematics Subject Classification ID

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

Related Items (3)

Some Transfinite Generalisations of Gödel’s Incompleteness Theorem ⋮ Discrete Transfinite Computation ⋮ Physical Computational Complexity and First-order Logic

This page was built for publication: Ordinal computations