Tree representations via ordinal machines

DOI10.3233/COM-2012-002MaRDI QIDQ4904458zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

nondeterministic ordinal computationsordinal machinestree representationsuniformization

Mathematics Subject Classification ID

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

Recommendations

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

Cited in

(7)

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

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)