Skip to main content
Conference Proceedings

Asymptotic cellular complexity

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2009) 5583 LNCS 195-206
DOI: 10.1007/978-3-642-02737-6_15
0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We show here how to construct a cellular automaton whose asymptotic set (the set of configurations it converges to) is maximally complex: it contains only configurations of maximal Kolmogorov complexity. This cellular automaton hence exhibits the most complex possible asymptotic behavior. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Durand, B., & Poupet, V. (2009). Asymptotic cellular complexity. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5583 LNCS, pp. 195–206). https://doi.org/10.1007/978-3-642-02737-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free