Abstract
We present two original computational models — globular universe and autopoietic automata — capturing the basic aspects of an evolution: a construction of self–reproducing automata by self–assembly and a transfer of algorithmically modified genetic information over generations. Within this framework we show implementation of autopoietic automata in a globular universe. Further, we characterize the computational power of lineages of autopoietic automata via interactive Turing machines and show an unbounded complexity growth of a computational power of automata during the evolution. Finally, we define the problem of sustainable evolution and show its undecidability.
This research was carried out within the institutional research plan AV0Z10300504 and partially supported by grant No. 1ET100300419 within the National Research Program “Information Society”.
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
Adleman, L.: Toward a mathematical theory of self-assembly. Tech. Rep. 00-722, Dept. of Computer Science, University of Southern California (2000)
Dorin, A.: Physically Based, Self-Organizing Cellular Automata. In: Zhang, C., Lukose, D. (eds.) DAI 1998. LNCS (LNAI), vol. 1544, pp. 74–87. Springer, Heidelberg (1998)
McMullin, B.: John von Neumann and the Evolutionary Growth of Complexity: Looking Backwards, Looking Forwards. Artificial Life 6(4), 347–361 (Fall 2000)
von Neumann, J.: Theory of Selfreproducing Automata. In: Burks, A. (ed.). University of Illinois Press, Urbana and London (1966)
van Leeuwen, J., Wiedermann, J.: The Turing machine paradigm in contemporary computing. In: Enquist, B., Schmidt, W. (eds.) Mathematics Unlimited – 2001 and Beyond, pp. 1139–1155. Springer, Berlin (2001)
Wiedermann, J.: Self–reproducing self-assembling evolutionary automata. In: Proc. of the Workshop on Tilings and Cellular Automata, WTCA 2004, CDMTCS, University of Auckland (December 2004), http://www.cs.auckland.ac.nz/CDMTCS//researchreports/253maurice.pdf
Wiedermann, J.: Autopoietic automata. Research Report V-929, Institute of Computer Science AS CR, Prague (February 2005), http://www.cs.cas.cz.cf
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wiedermann, J. (2005). Globular Universe and Autopoietic Automata: A Framework for Artificial Life. In: Capcarrère, M.S., Freitas, A.A., Bentley, P.J., Johnson, C.G., Timmis, J. (eds) Advances in Artificial Life. ECAL 2005. Lecture Notes in Computer Science(), vol 3630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11553090_3
Download citation
DOI: https://doi.org/10.1007/11553090_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28848-0
Online ISBN: 978-3-540-31816-3
eBook Packages: Computer ScienceComputer Science (R0)