article
Universal Reversible Turing Machines with a Small Number of Tape Symbols
Research footprint
At a glance
- Citations
- 0
- References
- 0
- Comments
- 0
Paper overview
Abstract
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...
Record transparency
Publication details
- DOI
- 10.5555/2756686.2756689
- OpenAlex
- W3010985612
- Document type
- article
- Language
- EN
- Source
- Fundamenta Informaticae
- Last metadata update
Comments
Log in to join the discussion.