ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (131 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/S0304-3975(00)00012-8    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 2001 Published by Elsevier Science B.V. All rights reserved.

Kolmogorov complexity and cellular automata classification

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

J. -C. DubacqE-mail The Corresponding Author, B. DurandE-mail The Corresponding Author and E. FormentiCorresponding Author Contact Information, E-mail The Corresponding Author

Lab. de Inform. du Parallelisme, Ecole Normale Sup. de Lyon, 46 Alleé d'Italie, F-69364 Lyon Cedex 07, France


Received 1 January 1998;
revised 1 March 1999.
Communicated by Nivat.
Available online 9 May 2001.

Abstract

We present a new approach to cellular automata (CA) classification based on algorithmic complexity. We construct a parameter κ which is based only on the transition table of CA and measures the “randomness” of evolutions; κ is better, in a certain sense, than any other parameter recursively definable on CA tables. We investigate the relations between the classical topological approach and ours. Our parameter is compared with Langton's λ parameter: κ turns out to be theoretically better and also agrees with some practical evidences reported in literature. Finally, we propose a protocol to approximate κ and make experiments on CA dynamical behavior.

Corresponding Author Contact Information Corresponding author; email: enrico.formenti@cmi.univ-mrs.fr


 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2009 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.