An implementation of von neumann's self-reproducing machine
暂无分享,去创建一个
This article describes in detail an implementation of John von Neumann's self-reproducing machine. Self-reproduction is achieved as a special case of construction by a universal constructor. The theoretical proof of the existence of such machines was given by John von Neumann in the early 1950s [6], but was first implemented in 1994, by the author in collaboration with R. Nobili. Our implementation relies on an extension of the state-transition rule of von Neumann's original cellular automaton. This extension was introduced to simplify the design of the constructor. The main operations in our constructor can be mapped into operations of von Neumann's machine.
[1] C. Langton. Self-reproduction in cellular automata , 1984 .
[2] E. F. Codd,et al. Cellular automata , 1968 .
[3] Christopher G. Langton,et al. Studying artificial life with cellular automata , 1986 .
[4] A. Turing. On Computable Numbers, with an Application to the Entscheidungsproblem. , 1937 .
[5] John von Neumann,et al. Theory Of Self Reproducing Automata , 1967 .