1990Unpublished venueRequires access

From Universal Turing Machines to Self-Reproduction*

Michael A. Arbib

Open publisher page 3 citations

Abstract

Abstract Although Turing in his later years became interested in the use of reaction diffusion equations to model morphogenesis (cf. Turing 1952) my task in this essay is to trace the way in which Turing’s notion of the universal computer led to a computational theory of organism growth and reproduction. The focus, then, is on the work in the 1960’s that was spurred by von Neumann’s (1951, 1966) theory of self-reproducing automata. Turing’s result that there exists a universal computing machine suggested to von Neumann that there might be a universal construction machine A, which, when furnished with a suitable description IN of any appropriate automaton N, will construct a copy of N.

About this research paper

What this paper is about

Abstract Although Turing in his later years became interested in the use of reaction diffusion equations to model morphogenesis (cf. Turing 1952) my task in this essay is to trace the way in which Turing’s notion of the universal computer led to a computational theory of organism growth and reproduction. The focus, then, is on the work in the 1960’s that was spurred by von Neumann’s (1951, 1966) theory of self-reproducing automata. Turing’s result that there exists a universal computing machine suggested to von Neumann that there might be a universal construction machine A, which, when furnished with a suitable description IN of any appropriate automaton N, will construct a copy of N.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Abstract Although Turing in his later years became interested in the use of reaction diffusion equations to model morphogenesis (cf. Turing 1952) my task in this essay is to trace the way in which Turing’s notion of the universal computer led to a computational theory of organism growth and reproduction. The focus, then, is on the work in the 1960’s that was spurred by von Neumann’s (1951, 1966) theory of self-reproducing automata. Turing’s result that there exists a universal computing machine suggested to von Neumann that there might be a universal construction machine A, which, when furnished with a suitable description IN of any appropriate automaton N, will construct a copy of N.

Key concepts: Universal Turing machine, Description number, Turing machine examples, Super-recursive algorithm, Turing machine, Turing, NSPACE, Computer science

Related papers

Back to paper searchBrowse research topicsOriginal source
From Universal Turing Machines to Self-Reproduction* — Research Paper | ScholarLens