Tree Representations via Ordinal Machines

DOI10.3233/COM-2012-002zbMath1270.03061OpenAlexW1487571554MaRDI QIDQ4904458

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

uniformizationtree representationsordinal machinesnondeterministic ordinal computations

Mathematics Subject Classification ID

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

Related Items (3)

Effectivity and reducibility with ordinal Turing machines ⋮ RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY ⋮ Clockability for ordinal Turing machines

This page was built for publication: Tree Representations via Ordinal Machines