Minimality considerations for ordinal computers modeling constructibility

DOI10.1016/j.tcs.2007.12.012zbMath1136.03026OpenAlexW2115827943MaRDI QIDQ2482462

Ryan Siders, Peter Koepke

Publication date: 16 April 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.12.012

zbMATH Keywords

ordinal arithmeticset theoryconstructibilityhypercomputationabstract computabilitywell-structured programming

Mathematics Subject Classification ID

Related Items (1)

The basic theory of infinite time register machines

Cites Work

• Register computations on ordinals
• Turing Computations On Ordinals
• Infinite time Turing machines
• Flow diagrams, turing machines and languages with only two formation rules
• Computability of Recursive Functions
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimality considerations for ordinal computers modeling constructibility