Aesthetic Evaluation of Cellular Automata Configurations Using Spatial Complexity and Kolmogorov Complexity

2021 ◽  
pp. 147-160
Author(s):  
Mohammad Ali Javaheri Javid
Keyword(s):  
Cellular Automata ◽  
Kolmogorov Complexity ◽  
Aesthetic Evaluation ◽  
Spatial Complexity

scholarly journals Spatial Complexity Measure for Characterising Cellular Automata Generated 2D Patterns

2015 ◽  
pp. 201-212 ◽  
Author(s):  
Mohammad Ali Javaheri Javid ◽  
Tim Blackwell ◽  
Robert Zimmer ◽  
Mohammad Majid Al-Rifaie
Keyword(s):  
Cellular Automata ◽  
Complexity Measure ◽  
Spatial Complexity

Complexity Measurement Based on Information Theory and Kolmogorov Complexity

2015 ◽  
Vol 21 (2) ◽  
pp. 205-224 ◽  
Author(s):  
Leong Ting Lui ◽  
Germán Terrazas ◽  
Hector Zenil ◽  
Cameron Alexander ◽  
Natalio Krasnogor
Keyword(s):  
Information Theory ◽  
Cellular Automata ◽  
Kolmogorov Complexity ◽  
The Self ◽  
Self Organization ◽  
The Past ◽  
Elementary Cellular Automata ◽  
Complexity Measurement

In the past decades many definitions of complexity have been proposed. Most of these definitions are based either on Shannon's information theory or on Kolmogorov complexity; these two are often compared, but very few studies integrate the two ideas. In this article we introduce a new measure of complexity that builds on both of these theories. As a demonstration of the concept, the technique is applied to elementary cellular automata and simulations of the self-organization of porphyrin molecules.

scholarly journals Analysis of information gain and Kolmogorov complexity for structural evaluation of cellular automata configurations

2016 ◽  
Vol 28 (2) ◽  
pp. 155-170
Author(s):  
Mohammad Ali Javaheri Javid ◽  
Tim Blackwell ◽  
Robert Zimmer ◽  
Mohammad Majid al-Rifaie
Keyword(s):  
Cellular Automata ◽  
Kolmogorov Complexity ◽  
Information Gain ◽  
Structural Evaluation

scholarly journals ASYMPTOTIC BEHAVIOR AND RATIOS OF COMPLEXITY IN CELLULAR AUTOMATA

2013 ◽  
Vol 23 (09) ◽  
pp. 1350159 ◽  
Author(s):  
HECTOR ZENIL ◽  
ELENA VILLARREAL-ZAPATA
Keyword(s):  
Asymptotic Behavior ◽  
Cellular Automata ◽  
Kolmogorov Complexity ◽  
Initial Conditions ◽  
Limit Function ◽  
Computing Systems ◽  
Symbolic Computing ◽  
Rule Space ◽  
Simple Rules ◽  
Block Entropy

We study the asymptotic behavior of symbolic computing systems, notably one-dimensional cellular automata (CA), in order to ascertain whether and at what rate the number of complex versus simple rules dominate the rule space for increasing neighborhood range and number of symbols (or colors), and how different behavior is distributed in the spaces of different cellular automata formalisms. Using two different measures, Shannon's block entropy and Kolmogorov complexity, the latter approximated by two different methods (lossless compressibility and block decomposition), we arrive at the same trend of larger complex behavioral fractions. We also advance a notion of asymptotic and limit behavior for individual rules, both over initial conditions and runtimes, and we provide a formalization of Wolfram's classification as a limit function in terms of Kolmogorov complexity.

scholarly journals Kolmogorov complexity and cellular automata classification

2001 ◽  
Vol 259 (1-2) ◽  
pp. 271-285 ◽  
Author(s):  
J.-C. Dubacq ◽  
B. Durand ◽  
E. Formenti
Keyword(s):  
Cellular Automata ◽  
Kolmogorov Complexity
Sign in / Sign up

Export Citation Format

Share Document