Table Of Content

DUCING MATA Commerce NOTICE:ReturnorrenewallLibraryMaterials!TheMinimumFeefor eachLostBookis$50.00. The person charging this material is responsible for itsreturntothelibraryfromwhichitwaswithdrawn on or before the Latest Date stamped below. Theftmutilation,andunderliningofbooksarereasonsfordiscipli- naryactionandmayresultindismissalfromtheUniversity. TorenewcallTelephoneCenter,333-8400 UNIVERSITY OF ILLINOIS LIBRARY AT URBANA-CHAMPAIGN 4 TO re:MEW BOOKS CALL: 333-8400 "y. 0 5 2009 JUL 0 7 ?93 L161—O-1096 Theory of Self-Reproducing Automata Theory of Self-Reproducing Automata JOHN VON NEUMANN edited and completed by Arthur W. Burks University of Illinois Press URBANA AND LONDON 1966 © 1966 by the Board of Trustees of the University ofIllinois. Manufactured in the United States of America. Library of Congress Catalog Card No. 63-7246. 5 o l , CONTENTS Preface xv EDITOR'S INTRODUCTION Von Neumann's Work on Computers 1 Von Neumann the Mathematician 2 Von Neumann and Computing 2 Logical Design of Computers 6 Programming and Flow Diagrams 12 Computer Circuits 15 Von Neumann's Theory of Automata 17 Introduction 17 Natural and Artificial Automata 21 Mathematics of Automata Theory 25 PART ONE THEORY AND ORGANIZATION OF COMPLICATED AUTOMATA First Lecture: Computing Machines in General 31 Second Lecture: Rigorous Theoriesof Control and Information. 42 . Third Lecture: Statistical Theories of Information 57 Fourth Lecture: The Role of High and of Extremely High Complication 64 Fifth Lecture: Re-evaluation of the Problems of Complicated — Automata Problems of Hierarchy and Evolution 74 PART TWO THE THEORY OF AUTOMATA: CONSTRUCTION, REPRODUCTION, HOMOGENEITY CHAPTER 1 GENERAL CONSIDERATIONS 1.1 Introduction 91 1.1.1.1 The theory of automata 91 1.1.1.2 The constructive method and its limitations 91 1.1.2.1 The main questions: (A)-(E) 92 1.1.2.2 The nature of the answers to be obtained 92 V — Vi THEORY OF SELF-REPRODUCING AUTOMATA [1.1.2.3 Von Neumann's models of self-reproduction] 93 1.2 The Role of Logics—Question (A) 99 — 1.2.1 The logical operations neurons 99 1.2.2 Neural vs. muscular functions 101 — 1.3 The Basic Problems of Construction Question (B) 101 1.3.1.1 The immediate treatment, involving geometry, kinematics, etc 101 — 1.3.1.2 The non-geometrical treatment structure of the vacuum 102 — 1.3.2 Stationarity quiescent vs. active states 103 1.3.3.1 Discrete vs. continuous framework 103 1.3.3.2 Homogeneity: discrete (crystalline) and continuous (Euclidean) 103 1.3.3.3 Questions of structure: (P)-(R) 104 1.3.3.4 Nature of results, crystalline vs. Euclidean: state- ments (X)-(Z) 105 [1.3.3.5 Homogeneity, quiescence, and self-reproduction] 106 . . 1.3.4.1 Simplification of the problems of construction by the treatment according to Section 1.3.1.2 108 1.3.4.2 Quiescence vs. activity; excitability vs. unexcita- bility; ordinary and special stimuli 109 1.3.4.3 Critique of the distinctions of Section 1.3.4.2. 110 — . . . 1.4 General Construction Schemes Question (B) Continued. Ill — . 1.4.1.1 Construction of cell aggregates the built-in plan. Ill . 1.4.1.2 The three schemes for building in multiple plans the parametric form 112 1.4.2.1 The descriptive statement L for numerical param- eters 112 1.4.2.2 Applications of L 113 1.4.2.3 Use of L as an unlimited memory for (A) 113 1.4.2.4 Use of base two for L 114 [1.4.2.5 The linear arrayL] 114 — 1.5 Universal Construction Schemes Question (C) 116 1.5.1 Use of L for non-numerical (universal) parametri- zation 116 1.5.2 The universal type of plan 116 — 1.6 Self-Reproduction Question (D) 118 1.6.1.1 The apparent difficulty of using L in the case of self-reproduction 118 — 1.6.1.2 Circumvention of the difficulty the types E andEF 118 1.6.2.1 First remark: shape of L 119