Abstract
A computational model based on 1-D cellular automaton (CA) is introduced. This model consists of conventional CA rules and a process that changes CA rules and interaction length between the cells. Despite the highly irregular behaviour of this model, it has re-created some emergent properties commonly found in nature, including power law and 1/f noise. Although those emergent patterns are already created in a number of computational models, our model is significantly different in that no random component is employed in transition rules. We discuss that there are different computational structures that re-create complex patterns.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bak P. Chen K. Self-Organized Criticality. Sci Am 1991; 264: 46–53
Bak P. Tang C. Wiesenfeld K. Self-organized criticality: an explanation of 1/f noise. Phy Rev Lett 1987; 59: no 4: 381–384
Bak P. Tang C. Wiesenfeld K. Self-organized criticality. Phy Rev A 1988; 38: no 1: 364–374
Berlekamp ER. Conway JH. Guy RK. Winning Ways for Your Mathematical Plays, vol 2, Academic Press, New York, 1982
Boolos GS. Jeffrey RC. Computability and logic. 3rd ed, Cambridge University Press, 1989
Garzon M. Models of massive parallelism: analysis of cellular automata and neural networks. Springer, New York, 1995
Kauffman SA. The origin of order: Self-organization and selection in evolution. Oxford University Press, 1993
May RM. Theoretical Ecology. 2nd ed, Blackwell Scientific Publications, 1981
Mitchell M. Crutchfield JP. Hraber PT. Evolving cellular automata to perform computations: Mechanisms and impediments. Physica D 1994; 75: 361–391
Raup DM. Extinction: bad genes or bad luck? Norton, 1991
Solé RV. Manrubia SC. Are rainforests self-organized in a critical state? J Theor Biol 1995; 173: 31–40
Wolfram S. Computation Theory of Cellular Automata. Commun Math Phys 1984; 96: 15–57
Wolfram S. Universality and complexity in cellular automata. Physica D 1984; 10: 1–35
Yamamoto T. Critical state between local and global interaction. Appl Math Comp 1995; 73: 153–180
Yamamoto T. Self-organization between local and non-local interaction in 2-D cellular automata. IEEE International Conference on Evolutionary Computation, 1996; 300–305
Yamamoto T. Emergent properties and behaviour of cellular automata with cross-scale interactions. PhD Thesis, Charles Sturt University, 1998
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag London Limited
About this paper
Cite this paper
Yamamoto, TF. (1998). Role of Irreducible Processes in Complex Dynamics. In: Bandini, S., Serra, R., Liverani, F.S. (eds) Cellular Automata: Research Towards Industry. Springer, London. https://doi.org/10.1007/978-1-4471-1281-5_3
Download citation
DOI: https://doi.org/10.1007/978-1-4471-1281-5_3
Publisher Name: Springer, London
Print ISBN: 978-1-85233-048-4
Online ISBN: 978-1-4471-1281-5
eBook Packages: Springer Book Archive