✦ LIBER ✦

Communication complexity and intrinsic universality in cellular automata

✍ Scribed by E. Goles; P.-E. Meunier; I. Rapaport; G. Theyssier

Book ID: 108281679
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 509 KB
Volume: 412
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.10.005

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Erratum to: “Communication Complexity an

Erratum to: “Communication Complexity and Intrinsic Universality in Cellular Automata” [Theor. Comput. Sci. 412 (1–2) (2011) 2–21]

✍ E. Goles; P.-E. Meunier; I. Rapaport; G. Theyssier 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 184 KB

Partitioned quantum cellular automata ar

Partitioned quantum cellular automata are intrinsically universal

✍ Pablo Arrighi; Jonathan Grattage 📂 Article 📅 2011 🏛 Springer Netherlands 🌐 English ⚖ 526 KB

Intrinsically universal n-dimensional qu

Intrinsically universal n-dimensional quantum cellular automata

✍ Pablo Arrighi; Jonathan Grattage 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 581 KB

Universality and decidability of number-

Universality and decidability of number-conserving cellular automata

✍ Andrés Moreira 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 138 KB

Number-conserving cellular automata (NCCA) are particularly interesting, both because of their natural appearance as models of real systems, and because of the strong restrictions that number-conservation implies. Here we extend the deÿnition of the property to include cellular automata with any set

Computational Complexity Volume 7183 ||

Computational Complexity Volume 7183 || Algorithmic Complexity and Cellular Automata

✍ Meyers, Robert A. 📂 Article 📅 2012 🏛 Springer New York ⚖ 876 KB

Communication Complexity Method for Meas

Communication Complexity Method for Measuring Nondeterminism in Finite Automata

✍ Juraj Hromkovič; Sebastian Seibert; Juhani Karhumäki; Hartmut Klauck; Georg Schn 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 117 KB