John von Neumann and the Evolutionary Growth of Complexity: Looking Backward, Looking Forward

  title={John von Neumann and the Evolutionary Growth of Complexity: Looking Backward, Looking Forward},
  author={Barry McMullin},
  journal={Artificial Life},
  • B. McMullin
  • Published 1 September 2000
  • History
  • Artificial Life
In the late 1940s John von Neumann began to work on what he intended as a comprehensive theory of [complex] automata. He started to develop a book length manuscript on the subject in 1952. However, he put it aside in 1953, apparently due to pressure of other work. Due to his tragically early death in 1957, he was never to return to it. The draft manuscript was eventually edited, and combined for publication with some related lecture transcripts, by Burks in 1966. It is clear from the time and… 

Computational Intelligence: The Legacy of Alan Turing and John von Neumann

In this chapter fundamental problems of collaborative computational intelligence are discussed and an early proposal from John Holland is analyzed, which centers on adaptability and population of programs.

Computational Intelligence : The Legacy of Alan Turing and

In this chapter fundamental problems of collaborative computational intelligence are discussed and an early proposal from John Holland is analyzed, which centers on adaptability and population of programs.

Von Neumann’s Theory of Self-Reproducing Automata: A Useful Framework for Biosemiotics?

The properties of universality, programmability, underspecification, complementarity of description/construction, and open-ended evolutionary potential are shown to be usefully applicable to language, thus opening a new line of inquiry in biosemiotics.

Architectures for Self-reproduction: Abstractions, Realisations and a Research Program

How the abstract von Neumann architecture can be readily realised in coreworld systems is indicated; the resulting analogies with molecular biology are made more precise, at least up to the (prokaryotic) cell level.

Construction theory, self-replication, and the halting problem

It is argued that self-replication of von Neumann's universal constructors holds a close similarity to circular computational processes of universal computers that appear in Turing's original proof of the undecidability of the halting problem.

Evolution of G-P mapping in a von Neumann Self-reproducer within Tierra

An exploratory model is presented which implements the von Neumann architecture for selfreproduction within the pre-existing evolutionary platform of Tierra and may allow for a more robust genotype, increasing its robustness to fatal mutations and therefore increasing its ability to preserve its phenotypic form under perturbations.

Zipf’s Law, unbounded complexity and open-ended evolution

It is concluded that statistical information (standard Shannon information) is not conserved, resulting in the paradoxical situation in which the increase of information content has the effect of erasing itself, and it is proved that this paradox is solved if the authors consider non-statistical forms of information.

Evolution unbound: releasing the arrow of complexity

A different understanding of that complexity which evolution grows is presented, one that genuinely runs counter to entropy and has thus far eluded proper analysis in information-theoretic terms.


Working in a research area such as Artificial Life has indeed been a mental voyage into a deeply mysterious phenomenon of life with sometimes disturbing philosophical realizations regarding the authors' own existence and meaning.

Evolution in asynchronous cellular automata

Sayama's evo-loop system is implemented asynchronously, giving the first example of evolution in asynchronous cellular automata, and requirements for evolutionary systems in Cellular automata are discussed.



Computation: Finite and Infinite Machines

From the Preface (See Front Matter for full Preface) Man has within a single generation found himself sharing the world with a strange new species: the computers and computer-like machines.

Essays on Darwinism 3: Genic and Organismic Selection

The notion that genes play a uniquely distinguished rôle in biological evolution has been championed by Richard Dawkins (1976; 1989b). Furthermore, Dawkins has argued that this idea can be

The General and Logical Theory of Au-tomata

I have to ask your forbearance for appearing here, since I am an outsider to most of the fields which form the subject of this conference. Even in the area in which I have some experience, that of

Artificial knowledge an evolutionary approach

I present a new analysis of the problem, situation in Artificial Intelligence (AI), grounded in a Popperian epistemology. I first review arguments purporting to establish that no purely

Essays on Darwinism

MR. DARWIN, in his recent work, very truly observes that “false facts are highly injurious to the progress of science, for they often long endure; but that false theories are comparatively

What Is Life

Preface A scientist is supposed to have a complete and thorough I of knowledge, at first hand, of some subjects and, therefore, is usually expected not to write on any topic of which he is not a

An Implementation of von Neumann's Self-Reproducing Machine

This article describes in detail an implementation of John von Neumann's self-reproducing machine that relies on an extension of the state-transition rule of vonNeumann's original cellular automaton to simplify the design of the constructor.

From artificial evolution to artificial life

It is suggested that the study of open-ended evolution can lead to a better understanding of the essential properties of life, but only if the questions being asked in these studies are phrased appropriately.


A complete informal description of the cellular system is presented including an explanation of the realization of logical components, the design of computer organs, the construction, destruction and movement of organs by sequences of internally originated pulses, universal computation and construction, and self-reproduction.

Self-reproduction in cellular automata