Surprising Areas in the Quest for Small Universal Devices

Authors:
Maurice Margenstern
Affiliations:
LITA, EA 3097 and IUT de Metz, Université Paul Verlaine -- Metz, Metz, France
Venue:
Electronic Notes in Theoretical Computer Science (ENTCS)
Year:
2009

Citing 15
Cited 8

Reversibility of 2D cellular automata is undecidable

Physica D
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
5-Symbol 8-State and 5-Symbol 6-State Universal Turing Machines

Journal of the ACM (JACM)
A computation-universal two-dimensional 8-state triangular reversible cellular automaton

Theoretical Computer Science - Special issue on universal machines and computations
The Quest for Small Universal Cellular Automata

ICALP '02 Proceedings of the 29th International 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
A universal cellular automaton in the hyperbolic plane

Theoretical Computer Science
On the infinigons of the hyperbolic plane, a combinatorial approach

Fundamenta Informaticae
Register cellular automata in the hyperbolic plane

Fundamenta Informaticae
Computation: finite and infinite machines

Computation: finite and infinite machines
Cellular Automata

Cellular Automata
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
Decision procedures for surjectivity and injectivity of parallel maps for tessellation structures

Journal of Computer and System Sciences
Four small universal turing machines

MCU'07 Proceedings of the 5th international conference on Machines, computations, and universality

Reversible computing and cellular automata—A survey

Theoretical Computer Science
The complexity of small universal Turing machines: A survey

Theoretical Computer Science
Towards the frontier between decidability and undecidability for hyperbolic cellular automata

RP'10 Proceedings of the 4th international conference on Reachability problems
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states

Theoretical Computer Science
A new weakly universal cellular automaton in the 3D hyperbolic space with two states

RP'11 Proceedings of the 5th international conference on Reachability problems
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
Universality and the halting problem for cellular automata in hyperbolic spaces: the side of the halting problem

UCNC'12 Proceedings of the 11th international conference on Unconventional Computation and Natural Computation
Turing computability and membrane computing

CMC'12 Proceedings of the 13th international conference on Membrane Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study a few points indicated in the talk which we presented at MFCSIT meeting in Cork. Our study concerns three main areas: Turing machines, cellular automata and hyperbolic cellular automata. The common thread is the quest for small universal devices. It leads from properties belonging to the classical domain up to results on super-Turing computations.