MoritaKenichi

Universal Reversible Turing Machines with a Small Number of Tape Symbols

2015 · Fundamenta Informaticae

We study the problem of finding small universal reversible Turing machines URTMs with four symbols or less. Here, we present two models of URTMs: a 24-state 4-symbol URTM, and a 32-state 3-symbol U...