Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small deterministic Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Small universal register machines
Theoretical Computer Science - Special issue on universal machines and computations
Signals in one-dimensional cellular automata
Theoretical Computer Science - Special issue: cellular automata
A brief history of cellular automata
ACM Computing Surveys (CSUR)
Collision-based computing
Collision-based computing
The Quest for Small Universal Cellular Automata
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality
LATIN '95 Proceedings of the Second Latin American Symposium on Theoretical Informatics
Three Small Universal Turing Machines
MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Theory of cellular automata: a survey
Theoretical Computer Science
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
Small fast universal turing machines
Theoretical Computer Science
The complexity of small universal Turing machines: A survey
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
Abstract geometrical computation 3: black holes for classical and analog computing
Natural Computing: an international journal
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
P-completeness of cellular automaton rule 110
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Abstract geometrical computation for black hole computation
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Abstract geometrical computation: turing-computing ability and undecidability
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
Computing in the fractal cloud: modular generic solvers for SAT and Q-SAT variants
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
| Hi-index | 5.23 |
This paper provides several very small signal machines able to perform any computation-in the classical understanding-generated from Turing machines, cellular automata and cyclic tag systems. A halting universal signal machine with 13 meta-signals and 21 collision rules is presented (resp. 15 and 24 for a robust version). If infinitely many signals are allowed to be present in the initial configuration, five meta-signals and seven collision rules are enough to achieve non-halting weak universality (resp. six and nine for a robust version).