Self-Assembling Dynamical Hierarchies
Alan Dorin and Jon McCormack: Self-Assembling Dynamical Hierarchies. In: R. K. Standish, M. A. Bedau and H. A. Abbass (eds), Proceedings of the Eighth International Conference on Artificial Life (Artificial Life VIII), NSW, Australia, 9-13 December 2002, The MIT Press, London, England, ISBN: 0-262-69281-3, pp 423-428.
This paper addresses the open problem of assembling multi- levelled hierarchical structure. It presents a model of an in- finitely-levelled, self-assembling dynamical hierarchy which arises from the interaction of geometric primary elements with a fixed complexity. A formal description of the pre- sented hierarchy is derived. This quantifies the relative compression achieved by describing the system in terms of components of different organization. The relationship be- tween properties of representations and those of physical ob- jects is then discussed to support the view that at each level in the hierarchy presented, the components exhibit emergent properties not possessed by those at the levels below. It is concluded that these new properties are trivial and that such infinitely-levelled structures may be constructed easily. However since the definition of the problem in the literature admits such trivial possibilities, further discussion is re- quired to ensure “interesting” emergent properties are clearly distinguished from those that are not.
Baas, N.A. 1994. Emergence, Hierarchies and Hyper- structures, Proc. of Artificial Life III, Addison-Wesley, 515–537.
Bealer, G. 1999. Property in The Cambridge Dictionary of Philosophy, 2nd edn., Audi (ed.), Cambridge Univ. Press, 751-752.
Bedau, M.A., et.al. 2000. Open Problems in Artificial Life, Artificial Life, 6(4), MIT Press, 363–376.
Bertalanffy, Ludwig von, 1968. General Systems Theory, Foundations, Development, Applications, revised edition, George Braziller Inc.
Boulton, D.M. and Wallace, C.S. 1970. An information measure for hierarchic classification, The Computer Journal, 16(3), 254–261.
Chaitin, G.J. 1987. Information Randomness & Incom- pleteness, Papers on Algorithmic Information Theory, World Scientific.
Chaitin, G.J. 1970. To A Mathematical Definition of ‘Life’, ACM, SICACT News 4, January 1970, 12-18. Dennett, D.C. 1991. Real Patterns, Journal of Philosophy, 88, 27–51.
Dittrich, P., Ziegler, J., Banzhaf, W. 2001. Artificial Chemistries — A Review, Artificial Life, 7(3), MIT Press, 225–275.
Dorin, A. 2000. Creating a Physically-based, Virtual Me- tabolism with Solid Cellular Automata, Proc. Artificial Life 7, Bedau, M. et al (eds), MIT Press, 13–20.
Gardner, M. 1970. Mathematical Games: The Fantastic Combinations of John Conway’s New Solitaire Game ‘Life’, Scientific American, 223(4), 120–123.
Gross, D., McMullin, B. 2001. Is it the Right Ansatz?, Ar- tificial Life, 7(4), MIT Press, 355–366.
Hansen, N.R., 1958. Patterns of Discovery, Cambridge Univ. Press.
Langton, C.G. 1986. Studying Artificial Life with Cellular Automata, Physica 22D, North-Holland, 120–149.
Mirkin, B., McMorris, F. R., Roberts, F. S., Rzhetsky, A., (ed’s) 1996. Mathematical Hierarchies and Biology, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, Vol. 37, Am. Math. Soc.
Nehaniv, C.L., Rhodes, J.L. 2000. The Evolution and Un- derstanding of Hierarchical Complexity in Biology from an Algebraic Perspective, Artificial Life, Vol. 6, No. 1, MIT Press, 45–68.
Polanyi, M. 1968. Life’s Irreducible Structure, Science, 160(21) 1308–1312.
Rasmussen, S., Baas, N.A., Mayer, B., Nilsson, M., Ole- sen, W. 2001a. Ansatz for Dynamical Hierarchies, Artifi- cial Life, 7(4), MIT Press, 329–354.
Rasmussen, S., Baas, N.A., Mayer, B., Nilsson, M. 2001b. Defence of the Ansatz for Dynamical Hierarchies, Artificial Life, 7(4), MIT Press, 367–374.
Simon, H.A. 1962. The Architecture of Complexity, Proc. Am. Phil. Soc., 106, 467–482.
Simon, H.A. 1994. The Sciences of the Artificial, second edition, MIT Press.
Tufte, E.R. 1990. Envisioning Information, Graphics Press.
Wallace, C.S. and Boulton, D.M. 1968. An information measure for classification. The Computer Journal, 11(2), 185-194.