Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
Universality of Tag Systems with p=2
Universality of Tag Systems with p=2
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
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
Tag systems and Collatz-like functions
Theoretical Computer Science
Study of limits of solvability in tag systems
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Small semi-weakly universal turing machines
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Tag systems and Collatz-like functions
Theoretical Computer Science
On the complex behavior of simple tag systems-An experimental approach
Theoretical Computer Science
| Hi-index | 0.00 |
In this paper a detailed proofwill be given of the solvability of the halting and reachability problem for binary 2-tag systems.