Theory of Self-Reproducing Automata John Von Neumann. Joshua Ridens and David Shubsda

Similar documents
Artificial Neural Network and Fuzzy Logic

VON NEUMANN'S CONTRIBUTIONS TO AUTOMATA THEORY

0 volts. 2 volts. 5 volts

Decidable Languages - relationship with other classes.

Lecture 23: Rice Theorem and Turing machine behavior properties 21 April 2009

Turing machines Finite automaton no storage Pushdown automaton storage is a stack What if we give the automaton a more flexible storage?

Computation. Some history...

Dendrites - receives information from other neuron cells - input receivers.

Unit 4: Computer as a logic machine

PBIS Correlations to the Next Generation Science Standards, Grades 6-8

Theory of Computation

Lectures on PROBABILISTIC LOGICS AND THE SYNTHESIS OF RELIABLE ORGANISMS FROM UNRELIABLE COMPONENTS. delivered by. PROFESSOR J.

Automata Theory CS S-12 Turing Machine Modifications

Evolution of Genotype-Phenotype mapping in a von Neumann Self-reproduction within the Platform of Tierra

The Characteristics of Life. AP Biology Notes: #1

Virtualization. Introduction. G. Lettieri A/A 2014/15. Dipartimento di Ingegneria dell Informazione Università di Pisa. G. Lettieri Virtualization

COMPARATIVE ANALYSIS ON TURING MACHINE AND QUANTUM TURING MACHINE

Introduction to Artificial Life and Cellular Automata. Cellular Automata

Brains and Computation

Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.

Cell Division and Reproduction

Theory of Computation Prof. Kamala Krithivasan Department of Computer Science and Engineering Indian Institute Of Technology, Madras

CS 256: Neural Computation Lecture Notes

Knots, Coloring and Applications

Potential from a distribution of charges = 1

Specialized Cells, Tissues, Organs and Organ Systems. Chap 2, p. 67 Chap 9, p. 295 Chap 14, p

Cellular Automata. and beyond. The World of Simple Programs. Christian Jacob

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Digital Logic

Week 2: Defining Computation

6.045: Automata, Computability, and Complexity Or, Great Ideas in Theoretical Computer Science Spring, Class 8 Nancy Lynch

GRADE 6 SCIENCE REVISED 2014

Computability and Complexity

Cellular Automata. ,C ) (t ) ,..., C i +[ K / 2] Cellular Automata. x > N : C x ! N. = C x. x < 1: C x. = C N+ x.

Great Theoretical Ideas in Computer Science. Lecture 7: Introduction to Computational Complexity

2.1. Unit 2. Digital Circuits (Logic)

Finite Automata. Finite Automata

Modelling with cellular automata

Quantum Computing Professor Andrew M. Steane Oxford University

Middle School Science Level Shifts

From Sequential Circuits to Real Computers

EN2912C: Future Directions in Computing Lecture 08: Overview of Near-Term Emerging Computing Technologies

07-PS4-2. Develop and use a model to describe that waves are reflected, absorbed, or transmitted through various materials.

Hybrid CPU/GPU Acceleration of Detection of 2-SNP Epistatic Interactions in GWAS

From Greek philosophers to circuits: An introduction to boolean logic. COS 116, Spring 2011 Sanjeev Arora

Capacitors. HPP Activity 68v1. Charge Inside the Body A Close Look at Cell Membranes

Science 8 Unit 4: Cells, Tissues, Organs & Systems

Post Von Neumann Computing

BIOL Week 5. Nervous System II. The Membrane Potential. Question : Is the Equilibrium Potential a set number or can it change?

Sources of randomness

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee

CMP 309: Automata Theory, Computability and Formal Languages. Adapted from the work of Andrej Bogdanov

TURING MAHINES

ECE/CS 250 Computer Architecture

Chapter 7 Turing Machines

CSCB58:Computer Organization

Cellular automata are idealized models of complex systems Large network of simple components Limited communication among components No central

Thermodynamics of computation.

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates

DEVS Simulation of Spiking Neural Networks

INTRODUCTORY NOTES ON QUANTUM COMPUTATION

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

An Interview with ARTHUR W. BURKS OH 136. Conducted by William Aspray. 20 June Ann Arbor, MI

Grids of Finite Automata

Information in Biology

Probabilistic Logics and the Synthesis of Reliable Organisms from Unreliable Components *

Fundamentals of Computer Science

How Does Nature Compute?

Lecture notes on Turing machines

Lectures on Medical Biophysics Department of Biophysics, Medical Faculty, Masaryk University in Brno. Biocybernetics

Chapter 1 Biology: Exploring Life

Griffith University 3130CIT Theory of Computation (Based on slides by Harald Søndergaard of The University of Melbourne) Turing Machines 9-0

Self-reproducing programs. And Introduction to logic. COS 116, Spring 2012 Adam Finkelstein

2401 : Anatomy/Physiology

Information in Biology

Mmm: cats! Modeling molecular motion: complex adaptive thermodynamic simulations. Eric Jankowski Glotzer Group CSAAW talk

Reglerteknik, TNG028. Lecture 1. Anna Lombardi

CS 100: Parallel Computing

Discrete Tranformation of Output in Cellular Automata

Alignment of Oregon Science Standards

CSE370: Introduction to Digital Design

Simple Interactions CS 105 Lecture 2 Jan 26. Matthew Stone

3/10/2013. Lecture #1. How small is Nano? (A movie) What is Nanotechnology? What is Nanoelectronics? What are Emerging Devices?

Part I: Definitions and Properties

Theory of Computation. Theory of Computation

RAJASTHAN TECHNICAL UNIVERSITY, KOTA

Elementary factoring algorithms

Bio 1M: The evolution of apes. 1 Example. 2 Patterns of evolution. Similarities and differences. History

Electric Circuits Part 2: Kirchhoff s Rules

The Science of Biology. Chapter 1

The Nervous System. What did you learn at school today? Neurophysiology!

The BrainGate Neural Interface System is an investigational medical device that is being developed to improve the quality of life for physically

B L U E V A L L E Y D I S T R I C T C U R R I C U L U M Science 7 th grade

Threshold Logic. 2.1 Networks of functions

Announcements. Problem Set 6 due next Monday, February 25, at 12:50PM. Midterm graded, will be returned at end of lecture.

Realizing Logic in Hardware

ECS 120 Lesson 23 The Class P

Chapter Two: Finite Automata

Claude Tadonki. MINES ParisTech PSL Research University Centre de Recherche Informatique

BINARY MORPHOLOGY AND CELLULAR AUTOMATA

von Neumann Architecture

Transcription:

Theory of Self-Reproducing Automata John Von Neumann Joshua Ridens and David Shubsda

Natural Automata vs. Artificial Automata Specifically Von Neumann looked at the nervous system and a vacuum tube computer Scale: Number of Neurons vs Number of Vacuum Tubes Throughput: Speed of Neuron Actuation vs Speed of Vacuum Tube Actuation Energy Dissipation: Dissipation of Neuron vs Dissipation of Vacuum Tube Memory: Nervous System Memory vs Computer Memory System Reliability: Differences between natural and artificial behaviors Additionally we will look at some current computers in terms of transistors against his comparisons.

Scale Estimated number of neurons in nervous system is 10 10 ENIAC has about 2*10 4 vacuum tubes SPARC M7: 10 10 transistors (Wikipedia) Core i7 Haswell: 2.6*10 9 transistors (Wikipedia) Titan Cray XK7 (3rd fastest computer according to top500.org) 299,008 cores, or about 10^12 transistors 50,233,344 CUDA cores, or about 10^17 transistors Von Neumann noted the differences in scale between natural and artificial automata as a way to measure the differences in complexity.

Throughput Human nerve next potential response time (according to Von Neumann): 200Hz (once per 5 milliseconds). Vacuum tube (at the time): about 5000 times faster, 1 million per second (1MHz) Wikipedia says the ENIAC operates at about 100kHz (ENIAC) CPU s today are capping out around 4GHz, but we also add more cores Von Neumann noted that while, at the time, the scale of nerves was huge in comparison to vacuum tubes that the artificial automata is still favored. Because an n-fold increase in size bring much more than an n-fold increase in what can be done.

Energy Dissipation Von Neumann measure this in relation to the the energy dissipation of the transmittal of 1 unit of information. Thermodynamic Minimum: 3*10-14 ergs Nerve: 3*10-3 ergs Vacuum Tube: about 3*10 2 ergs Transistor Estimate (i7 Haswell): 84W for the chip, at 3.5GHz, and 1.4 billion transistors gives about 1.7*10-10 ergs Von Neumann noted that the interesting measurement here was the difference between the energy dissipation of a nerve, and the thermodynamic minimum. Though the observation that information is entropy tells an important part of the story, it by no means tells the whole story.

Memory Von Neumann points out that the devices used in nature are not actually binary or digital, instead they are analog. The thing which remembers is nowhere in particular There s therefore no reason to believe that the memory of the central nervous system is in the switching organs (the neurons). Estimated human memory: Between 10 10 (1.5 GB) and 10 15 (125 TB) The environment that the automata operates in is very important to the overall behavior of the automata.

Question... These comparisons between artificial and natural automata result in one question: Our artificial automata are much smaller than natural automata in what they do and in the number of components they have, and they re phenomenally more expensive in terms of space and energy. Why is this so? Von Neumann also says that producing the answer to this is hopeless, but that there are a few discrepancies we can observe: Materials System Reliability

System Reliability Errors are unavoidable, and the larger the automata the larger the probability for error. Natural System Tend to behave in spite of errors Errors do not in general indicate a degenerative tendency System is flexible (one might say adaptable) Can repair errors, or block off entire portions of its systems Artificial System Tend to halt because of errors System is rigid Error repair is difficult This takes a very considerable autonomy of parts to make possible. We ve made a lot of progress in artificial systems to behave more like natural systems, but the original attitudes were very different.

Input and Output Turing machine modifies an infinite tape Neurons receive and produce pulses Both are qualitatively completely different from the automaton But what about automata which can have outputs similar to themselves?

Replication Modification of objects similar to themselves Affect synthesis Picking up parts Putting parts together Take synthesized entities apart https://upload.wikimedia.org/wikipedia/commons/5/5d/advanced_automation_for_sp ace_missions_figure_5-29.gif

Elementary Parts... it is very difficult to give rigorous rules as to how one should choose the elementary parts. Too large - define the problem away Too small - get stuck on questions of the wrong scale Common sense criteria

Example System Neurons Muscles Energy sources Connective Tissues Disconnecting Tissues 10-15 elementary parts Potential Problems: Simplified system missing important parts Avoid explaining these parts composition Size in selection - may vary by multiple orders of magnitude

Questions What principles are involved in organizing these elementary parts into functioning organisms? What are the traits of such organisms? What are the essential quantitative characteristics of such organisms?

Complication No clear definition...an object is of the highest degree of complexity if it can do very difficult and involved things. Crudest standard - number of elementary parts

Miracle of the First Magnitude Organisms produce other like organisms For this reason they are abundant in this world They are complicated collections of elementary parts Improbable by any reasonable probability of thermodynamics

Natural Evolution One degree better than self-reproduction Description of complex organism encoded in a simpler ancestor? Genes as a partial description in the milieu

Artificial Automata Degenerative reproduction Simpler automata produced by more complex automata Clear opposite of Natural automata in this detail

Early Model of Self-Reproducing Automaton Stimulus organ - receives and transmits stimuli realizing or function Coincidence organ - realizes and function Inhibitory organ - realizes p and not-q Stimuli producer - source of stimuli Rigid member - insulated girder Fusing organ - welds two parts together Cutting organ - unwelds two parts Muscle - contracts to create motion