Computer Language
Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines
Journal of the ACM (JACM)
Universality of Tag Systems with P = 2
Journal of the ACM (JACM)
Computer Studies of Turing Machine Problems
Journal of the ACM (JACM)
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
A new kind of science
New Small Universal Circular Post Machines
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Three Small Universal Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Cellular automata and intermediate degrees
Theoretical Computer Science
Universality of Tag Systems with p=2
Universality of Tag Systems with p=2
Chaos and Fractals
Small turing machines and generalized busy beaver competition
Theoretical Computer Science
Computation: finite and infinite machines
Computation: finite and infinite machines
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
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Study of limits of solvability in tag systems
MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality
Four small universal turing machines
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
Small weakly universal turing machines
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Solvability of the Halting and Reachability Problem for Binary 2-tag Systems
Fundamenta Informaticae
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
| Hi-index | 5.23 |
It is a well-known fact that apparently simple systems can give rise to complex behavior. But why exactly does a given system behave in a complex manner? There are two main approaches to tackle this and other related questions. One can take on a theoretical approach or else start from a more experimental study of the behavior of such systems with the help of a computer. In this paper, the experimental approach is applied to tag systems with a very small program size. After a discussion of some of the main theoretical results on tag systems, several results from a computer-assisted and experimental study on tag systems are analyzed. Special attention is given to the well-known example studied by Post with only 2 symbols and a deletion number v=3. These results are combined with some theoretical results on tag systems in order to gain more insight into the computational power of simple tag systems.