Zobrazeno 1 - 2
of 2
pro vyhledávání: '"Pierre-Etienne Meunier"'
Publikováno v:
Electronic Proceedings in Theoretical Computer Science, Vol 1, Iss Proc. CSP 2008, Pp 81-92 (2009)
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the decidability o
Externí odkaz:
https://doaj.org/article/c99e0187f83c4ca0aa369b354d650d23
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AP,..., Iss Proceedings (2011)
Studying cellular automata with methods from communication complexity appears to be a promising approach. In the past, interesting connections between communication complexity and intrinsic universality in cellular automata were shown. One of the las
Externí odkaz:
https://doaj.org/article/1eaef9d58707404d83cfce5370b8088f