Mean field theory of the edge of chaos

22Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Is there art Edge of Chaos, and if so, can evolution take us to it? Many issues have to be settled before any definitive answer can be given. For quantitative work, we need a good measure of complexity. We suggest that convergence time is an appropriate and useful measure. In the case of cellular automata, one of the advantages of the convergence-time measure is that it can be analytically approximated using a generalized mean field theory. In this paper we demonstrate that the mean field theory for cellular automata can 1) reduce the variablity of behavior inherent in the λ-parameter approach, 2) approximate convergence time, and 3) drive an evolutionary process toward increasing complexity.

Cite

CITATION STYLE

APA

Gutowitz, H., & Langton, C. (1995). Mean field theory of the edge of chaos. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 929, pp. 52–64). Springer Verlag. https://doi.org/10.1007/3-540-59496-5_288

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