Similar Items: Alternating Turing machines for inductive languages
- Ambiguity of {omega}-Languages of Turing Machines
- Reachability for infinite time Turing machines with long tapes
- Turing machines on represented sets, a model of computation for Analysis
- Strong Turing Degrees for Additive BSS RAM's
- A Galois connection between Turing jumps and limits
- Expressivity of AuDaLa: Turing Completeness and Possible Extensions