Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Automata and ComplexityThe Mirage of Universality in Cellular Automata

Automata and Complexity: The Mirage of Universality in Cellular Automata [This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no ‘universal’ way of being computationally universal. In particular, we show how some cellular automata can embed efficient but bounded computation, while others can embed unbounded computations but not efficiently. We also study two variants of Boolean circuit embedding, transient versus repeatable simulations, and underline their differences. Finally we show how strong forms of universality can be hidden inside some seemingly simple cellular automata according to some classical dynamical parameters.] http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png

Automata and ComplexityThe Mirage of Universality in Cellular Automata

Part of the Emergence, Complexity and Computation Book Series (volume 42)
Editors: Adamatzky, Andrew
Theyssier, Guillaume
Automata and Complexity — Apr 20, 2022
Download PDF
13 pages

Loading next page...
 
/lp/springer-journals/automata-and-complexity-the-mirage-of-universality-in-cellular-IS9KWpHISe
Publisher
Springer International Publishing
Copyright
© The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
ISBN
978-3-030-92550-5
Pages
57 –70
DOI
10.1007/978-3-030-92551-2_5
Publisher site
See Chapter on Publisher Site

Abstract

[This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no ‘universal’ way of being computationally universal. In particular, we show how some cellular automata can embed efficient but bounded computation, while others can embed unbounded computations but not efficiently. We also study two variants of Boolean circuit embedding, transient versus repeatable simulations, and underline their differences. Finally we show how strong forms of universality can be hidden inside some seemingly simple cellular automata according to some classical dynamical parameters.]

Published: Apr 20, 2022

There are no references for this article.