Rice's Theorem for µ-Limit Sets of Cellular Automata

Abstract : Cellular automata are a parallel and synchronous computing model, made of innitely many nite automata updating according to the same local rule. Rice's theorem states that any nontrivial property over computable functions is undecidable. It has been adapted by Kari to limit sets of cellular automata [Kar94], that is the set of congurations that can be reached arbitrarily late. This paper proves a new Rice theorem for µ-limit sets, which are sets of congurations often reached arbitrarily late.
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-01957552
Contributor : Martin Delacourt <>
Submitted on : Monday, December 17, 2018 - 2:08:03 PM
Last modification on : Thursday, February 7, 2019 - 3:36:28 PM
Long-term archiving on : Monday, March 18, 2019 - 3:47:30 PM

File

murice.pdf
Files produced by the author(s)

Identifiers

Citation

Martin Delacourt. Rice's Theorem for µ-Limit Sets of Cellular Automata. Luca Aceto, Monika Henzinger, Jiří Sgall. Automata, Languages and Programming, 6756, Springer, pp.89-100, 2011, Lecture Notes in Computer Science, ⟨10.1007%2F978-3-642-22012-8_6⟩. ⟨hal-01957552⟩

Share

Metrics

Record views

10

Files downloads

11