Concept and definition of complexity

Intelligent Complex Adaptive Systems

Volumn , Issue , 2008, Pages 105-124

  Standish, Russell K ^a  

^a UNIVERSITY OF NEW SOUTH WALES   (Australia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 82855160890     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.4018/978-1-59904-717-1.ch004     Document Type: Chapter

References (27)

1. Adami, C. (1998). Introduction to artificial life. Berlin: Springer.
2. Albert, R., & Barabási, A. L. (2002). Statistical mechanics of complex networks. Reviews of Modern Physics, 74, 47.
3. Barrow, J. D., & Tipler, F. J. (1986). The anthropic cosmological principle. Oxford: Clarendon.
4. Bennett, C. H. (1988). Logical depth and physical complexity. In R. Harkin (Ed.), The universal turing machine: A half century survey (Vol. 1, pp. 227-258). Oxford: Oxford UP.
5. Bonner, J. T. (1988). The evolution of complexity. Princeton: Princeton UP.
6. Claussen, J. C. (2007). Offdiagonal complexity: A computationally quick complexity measure for graphs and networks. Physica A, 375, 365-373. arXiv:q-bio.MN/0410024.
7. Conway, J. H. (1982). What is life? In E. Berlekamp, J. H. Conway, & R. Guy (Eds.), Winning ways for your mathematical plays (Vol. 2, Chapter 25). New York: Academic.
8. Diestel, R. (2005). Graph theory (3rd ed.). Berlin: Springer.
9. Edmonds, B. (1999). Syntactic measures of complexity. PhD thesis, University of Manchester. http://bruce.edmonds.name/thesis/, Complexity Bibliography: http://bruce.edmonds.name/compbib/.
10. Erdös, P., & Rényi, A. (1959). On random graphs. Publ. Math. Dubrecen, 6, 290-291.
11. Fromm, J. (2004). The emergence of complexity. Kassel: Kassel UP.
12. Gell-Mann, M. (1994). The Quark and the Jaguar: Adventures in the simple and the complex. London: Little Brown Co.
13. Goodman, N. (1972). Problems and projects. Indianapolis, IN: Bobbs-Merrill.
14. Hofstadter, D. R. (1979). Gödel, Escher, Bach: An eternal golden braid. New York: Basic Books.
15. Holland, J. (1997). Emergence: From chaos to order. Reading, MA: Addison-Wesley.
16. Levin, L. A. (1974). Laws of information conservation (non-growth) and aspects of the foundation of probability theory. Problems Inform. Transmission, 10, 206-210.
17. Li, M., & Vitányi, P. (1997). An introduction to Kolmogorov complexity and its applications (2nd ed.). New York: Springer.
18. McShea, D. W. (1996). Metazoan complexity and evolution: Is there a trend? Evolution, 50, 477-492.
19. Newman, M. E. J. (2003). The structure and function of complex networks. SIAM Review, 45(2), 167-256. arXiv:cond-mat/0303516.
20. Rosen, R. (1991). Life itself. New York: Columbia UP.
21. Shannon, C. E. (1949). The mathematical theory of communication. Urbana- Champaign, IL: University of Illinois Press.
22. Solomonoff, R. J. (1964). A formal theory of inductive inference, part 1 and 2. Inform. Contr., pages 1-22,224-254.
23. Standish, R. K. (2001). On complexity and emergence. Complexity International, 9. arXiv:nlin.AO/0101006.
24. Standish, R. K. (2004). Why Occam's razor? Foundations of Physics Letters, 17, 255-266. arXiv:physics/0001020.
25. Standish, R. K. (2005). Complexity of networks. In Abbass et al. (Eds.), Recent advances in artificial life, volume 3 of Advances in Natural Computation, pages 253-263, Singapore. World Scientific. arXiv:cs.IT/0508075.
26. Watts, D. J., & Strogatz, S. H. (1998). Collective dynamics of "small-world" networks. Nature, 393(6684), 409-10.
27. Wolfram, S. (1984). Cellular automata as models of complexity. Nature, 311, 419-424.