Similar Items: Expressivity of AuDaLa: Turing Completeness and Possible Extensions
- Random strings and tt-degrees of Turing complete C.E. sets
- Alternating Turing machines for inductive languages
- Ambiguity of {omega}-Languages of Turing Machines
- Strong Turing Degrees for Additive BSS RAM's
- A Galois connection between Turing jumps and limits
- Reachability for infinite time Turing machines with long tapes