Tree representations via ordinal machines

DOI10.3233/COM-2012-002zbMATH Open1270.03061OpenAlexW1487571554MaRDI QIDQ4904458FDOQ4904458

Authors: Philipp Schlicht, Benjamin Seyfferth 

Publication date: 30 January 2013

Published in: Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/com-2012-002

Recommendations

• Turing Computations On Ordinals
• Ordinal computability
• Ordinals, computations, and models of set theory
• Infinite time Turing machines
• Ordinal computations

zbMATH Keywords

uniformizationtree representationsordinal machinesnondeterministic ordinal computations

Mathematics Subject Classification ID

Computation over the reals, computable analysis (03D78) Turing machines and related notions (03D10)

Cited In (7)

• Clockability for ordinal Turing machines
• The Complexity of Quickly ORM-Decidable Sets
• Beyond representing orthology relations by trees
• New Computational Paradigms
• Effectivity and reducibility with ordinal Turing machines
• Representing models by finite trees
• RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY

This page was built for publication: Tree representations via ordinal machines

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