Similar Items: Random strings and tt-degrees of Turing complete C.E. sets
- Strong Turing Degrees for Additive BSS RAM's
- Reductions to the set of random strings: The resource-bounded case
- Co-c.e. spheres and cells in computable metric spaces
- Expressivity of AuDaLa: Turing Completeness and Possible Extensions
- Power of Randomization in Automata on Infinite Strings
- Turing machines on represented sets, a model of computation for Analysis