Skip to main content
Book Chapter

Algorithmic complexity and cellular automata

Springer New York, (2012), 132-146
DOI: 10.1007/978-1-4614-1800-9_10
0Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Article Outline: Glossary Definition of the Subject Introduction Kolmogorov Complexity Dynamical Systems and Symbolic Factors Cellular Automata Algorithmic Complexity as a Demonstration Tool Measuring CA Structural Complexity Measuring the Complexity of CA Dynamics Future Directions Acknowledgments Bibliography

Cite

CITATION STYLE

APA

Cervelle, J., & Formenti, E. (2012). Algorithmic complexity and cellular automata. In Computational Complexity: Theory, Techniques, and Applications (Vol. 9781461418009, pp. 132–146). Springer New York. https://doi.org/10.1007/978-1-4614-1800-9_10

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