Similar Items: Turing machines on represented sets, a model of computation for Analysis
- Alternating Turing machines for inductive languages
- Ambiguity of {omega}-Languages of Turing Machines
- Reachability for infinite time Turing machines with long tapes
- Random strings and tt-degrees of Turing complete C.E. sets
- Strong Turing Degrees for Additive BSS RAM's
- A Galois connection between Turing jumps and limits