Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

15

STACS
2005
Springer

favoriteEmaildiscussreport

135views Theoretical Computer Science» more STACS 2005»

How Common Can Be Universality for Cellular Automata?

13 years 9 months ago

How Common Can Be Universality for Cellular Automata?

Download www.lama.univ-savoie.fr

Abstract. We address the problem of the density of intrinsically universal cellular automata among cellular automata or a subclass of cellular automata. We show that captive cellular automata are almost all intrinsically universal. We show however that intrinsic universality is undecidable for captive cellular automata. Finally, we show that almost all cellular automata have no non-trivial sub-automaton.

Guillaume Theyssier

Real-time Traffic

Captive Cellular Automata | Cellular Automata | STACS 2005 | Theoretical Computer Science | Universal Cellular Automata |

claim paper

Related Content

» A New Universal Cellular Automaton Discovered by Evolutionary Algorithms

» Cryptography by Cellular Automata or How Fast Can Complexity Emerge in Nature

» Computational complexity of dynamical systems The case of cellular automata

» Rule 110 universality and catenations

» Design of Autonomous DNA Cellular Automata

» Reversible computing and cellular automata A survey

» On Local Symmetries and Universality in Cellular Automata

» Research of a Cellular Automaton Simulating Logic Gates by Evolutionary Algorithms

» Simulating Spatial Partial Differential Equations with Cellular Automata

Post Info
More Details (n/a)

Added	28 Jun 2010
Updated	28 Jun 2010
Type	Conference
Year	2005
Where	STACS
Authors	Guillaume Theyssier

Comments (0)