Tree Representations via Ordinal Machines
Philipp Schlicht, Benjamin Seyfferth · Computability · 2012
We study sets of reals computable by ordinal Turing machines with a tape of length the ordinals that are steered by a standard Turing program. The machines halt at some ordinal time or diverge. We construct tree representations for ordinal semi-decid