The Possible Irreducibility of Artificial Software Life - Bruce Edmonds

References

[2] Edmonds, B., (1996): Pragmatic Holism. CPM report 95-08. Also available electronically at http://www.fmb.mmu.ac.uk/~bruce/praghol

[3] GÖdel, K., (1931), Uber formal unentscheidbare Satze der Principia Mathematicca und verwandter System I. Monatschefte Math. Phys., 38, 173-198.

[4] Langton, C. G., (1988): Artificial Life, in Langton C. G. (ed), Artificial Life, Addison-Wesley, MA. 1-48.

[5] Pattee, H. H., (1995): Evolving self-reference: matter, symbols and semantic closure. Communication and Cognition - Artificial Intelligence. 12, 9-27.

[6] Rosen, R., (1993): Bionics Revisited. In: The Machine as Metaphor and Tool, (Eds: Haken, H.; Karlquist, A.; Svedin, U.) Springer-Verlag, Berlin, 87-100.

[7] Sarkar, S., (1992): Models of Reduction and Categories of Reductionism. Synthese 91, 167-194.

[8] Turing, A. M., (1936): On Computable Numbers, with an application to the Entscheidungsproblem. Proc. London Math. Soc., 42, 230-265.

Generated with CERN WebMaker