- ... time.
^{1}
- Note that there
are still inward, degenerative, pathways shown here; the claim
is only that this graph permits the
*possibility* of a
growth in complexity; whether it actually *will* grow is a
different, and an altogether more difficult, question which I
do not attempt to address here.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

- ....
^{2}
- It is
neither trivial nor obvious that there exists a general
constructive automaton within any given ; this is why
the bulk of von Neumann's unfinished manuscript is taken up
with the detailed design of a particular example to
establish this result for his particular .
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

- ... right.
^{3}
- Indeed, we call such
changes ``mutations'' precisely because they can ``breed true''
in the offspring.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.

- ... processors.
^{4}
- Here, of
course, I am referring to the so-called ``von Neumann computer
architecture'' (von Neumann, 1945)--which was not, by any
means, solely von Neumann's invention--rather than to his very
different work on cellular automata.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.
.