Tree Representations via Ordinal Machines
From MaRDI portal
Publication:4904458
DOI10.3233/COM-2012-002zbMath1270.03061MaRDI 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
Related Items
RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY, Effectivity and reducibility with ordinal Turing machines, Clockability for ordinal Turing machines