Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Proceedings of the 7th Colloquium on Automata, Languages and Programming
A Universal Turing Machine with 3 States and 9 Symbols
DLT '01 Revised Papers from the 5th International Conference on Developments in Language Theory
Computation: finite and infinite machines
Computation: finite and infinite machines
On the time complexity of 2-tag systems and small universal Turing machines
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Logical reversibility of computation
IBM Journal of Research and Development
Reversible computing and cellular automata—A survey
Theoretical Computer Science
Principles of a reversible programming language
Proceedings of the 5th conference on Computing frontiers
Reversible Flowchart Languages and the Structured Reversible Program Theorem
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
The complexity of small universal Turing machines: A survey
Theoretical Computer Science
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)
Electronic Notes in Theoretical Computer Science (ENTCS)
Reversible Computation and Reversible Programming Languages
Electronic Notes in Theoretical Computer Science (ENTCS)
Reversibility and determinism in sequential multiset rewriting
UC'10 Proceedings of the 9th international conference on Unconventional computation
What do reversible programs compute?
FOSSACS'11/ETAPS'11 Proceedings of the 14th international conference on Foundations of software science and computational structures: part of the joint European conferences on theory and practice of software
Theoretical Computer Science
A simple and efficient universal reversible turing machine
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Sequential and maximally parallel multiset rewriting: reversibility and determinism
Natural Computing: an international journal
On reversibility and determinism in p systems
WMC'09 Proceedings of the 10th international conference on Membrane Computing
The complexity of small universal turing machines: a survey
SOFSEM'12 Proceedings of the 38th international conference on Current Trends in Theory and Practice of Computer Science
Reversible spiking neural P systems
Frontiers of Computer Science: Selected Publications from Chinese Universities
| Hi-index | 0.00 |
A reversible Turing machines is a computing model with a "backward deterministic" property, which is closely related to physical reversibility. In this paper, we study the problem of finding a small universal reversible Turing machine (URTM). As a result, we obtained a 17-state 5-symbol URTM in the quintuple form that can simulate any cyclic tag system.