Algorithmic Complexity and Spatial Simplicity

Rajendra G. Kulkarni, Roger R. Stough and Kingsley E. Haynes
Additional contact information
Rajendra G. Kulkarni: George Mason University

Chapter Chapter 5 in Complexity and Spatial Networks, 2009, pp 61-73 from Springer

Abstract: Abstract Recently the field of complexity science has emerged as an amalgamation of many different areas borrowing ideas and attracting researchers from the physical, biological and social sciences (Holland 1992; Bak 1996; Kohonen 1997; Fabian 1998; Wolfram 1994; Kauffman 2000). Of late, much of this interdisciplinary research has been facilitated by ideas and tools borrowed from another field, namely, computer science. Merging of complexity with computer science has provided researchers with a variety of tools to test new ideas and theories and carry out simulations that have offered greater insight into a variety of properties of how complex adaptive behavior evolves and how simple rules guiding interactions at the micro level give rise to complex macro behavior as well as to identifying the properties of self-organization and emergent behaviors.

Keywords: Compression Algorithm; Binary Number; Kolmogorov Complexity; Coin Toss; Binary Alphabet (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:adspcp:978-3-642-01554-0_5

Ordering information: This item can be ordered from
http://www.springer.com/9783642015540

DOI: 10.1007/978-3-642-01554-0_5

Access Statistics for this chapter

More chapters in Advances in Spatial Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().