1LAAA Turing’s Machine A mechanical formalism (1937) –State (memory), rules (program) –Tape (data) Evolutionarily successful –Beat out Church’s mathematical.

Slides:



Advertisements
Similar presentations
THE CHURCH-TURING T H E S I S “ TURING MACHINES” Pages COMPUTABILITY THEORY.
Advertisements

Two-state, Reversible, Universal Cellular Automata In Three Dimensions Authors: Daniel B. Miller & Edward Fredkin Carnegie Mellon West Computing Frontiers.
CITS4403 Computational Modelling Game of Life. One of the first cellular automata to be studied, and probably the most popular of all time, is a 2-D CA.
Adventures in the Computational Universe Modelling Flocking Behaviour.
Cellular Automata (Reading: Chapter 10, Complexity: A Guided Tour)
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
CELLULAR AUTOMATON Presented by Rajini Singh.
CELLULAR AUTOMATA Derek Karssenberg, Utrecht University, the Netherlands LIFE (Conway)
CS Summer 2005 Final class - July 1st Assorted fun topics in computability and complexity.
Lecture of Norm Margolus. Physical Worlds Some regular spatial systems: –1. Programmable gate arrays at the atomic scale –2. Fundamental finite-state.
Lectures on Cellular Automata Continued Modified and upgraded slides of Martijn Schut Vrij Universiteit Amsterdam Lubomir Ivanov Department.
Today’s Plan Introduction to Artificial Life Cellular Automata
Cellular Automata Orit Moskovich
Introduction to Artificial Life and Cellular Automata
1 GEM2505M Frederick H. Willeboordse Taming Chaos.
Cellular Automata Avi Swartz 2015 UNC Awards Ceremony.
Introduction At the heart of the growth of a multi-cellular organism is the process of cellular division… … aka (in computing) self-replication.
Chapter 3 - The World of Simple Programs Wolfram, Stephen. A New Kind of Science. Wolfram Media, Inc
Nawaf M Albadia Introduction. Components. Behavior & Characteristics. Classes & Rules. Grid Dimensions. Evolving Cellular Automata using Genetic.
Parallelization: Conway’s Game of Life. Cellular automata: Important for science Biology – Mapping brain tumor growth Ecology – Interactions of species.
Universal Turing Machine
1.1 1 Introduction Foundations of Computer Science  Cengage Learning.
Discovery of Cellular Automata Rules Using Cases Ken-ichi Maeda Chiaki Sakama Wakayama University Discovery Science 2003, Oct.17.
The Role of Artificial Life, Cellular Automata and Emergence in the study of Artificial Intelligence Ognen Spiroski CITY Liberal Studies 2005.
Constraints on Hypercomputation Greg Michaelson 1 & Paul Cockshott 2 1 HeriotWatt University, 2 University of Glasgow.
David Evans Turing Machines, Busy Beavers, and Big Questions about Computing.
Class 37: Computability in Theory and Practice cs1120 Fall 2011 David Evans 21 November 2011 cs1120 Fall 2011 David Evans 21 November 2011.
Governor’s School for the Sciences Mathematics Day 13.
CS 484 – Artificial Intelligence1 Announcements Lab 4 due today, November 8 Homework 8 due Tuesday, November 13 ½ to 1 page description of final project.
1 CO Games Development 2 Week 21 Turing Machines & Computability Gareth Bellaby.
The Recursion Theorem Pages 217– ADVANCED TOPICS IN C O M P U T A B I L I T Y THEORY.
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
1 Cellular Automata and Applications Ajith Abraham Telephone Number: (918) WWW:
We must therefore not be discouraged by the difficulty of interpreting life by the ordinary laws of physics... We must also be prepared to find a new.
1 Chapter 13 Artificial Life: Learning through Emergent Behavior.
Cellular Automata & DNA Computing 우정철. Definition Of Cellular Automata Von Von Neuman’s Neuman’s Definition Wolfram’s Wolfram’s Definition Lyman.
CELLULAR AUTOMATA A Presentation By CSC. OUTLINE History One Dimension CA Two Dimension CA Totalistic CA & Conway’s Game of Life Classification of CA.
REVERSIBLE CELLULAR AUTOMATA WITHOUT MEMORY Theofanis Raptis Computational Applications Group Division of Applied Technologies NCSR Demokritos, Ag. Paraskevi,
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
The Game of Life Erik Amelia Amy. What is the “Game of Life?” The “Game of Life” (often referred to as Life) is not your typical game. There are no actual.
Model Iteration Iteration means to repeat a process and is sometimes referred to as looping. In ModelBuilder, you can use iteration to cause the entire.
Cellular Automata. John von Neumann 1903 – 1957 “a Hungarian-American mathematician and polymath who made major contributions to a vast number of fields,
C-cards Using paper and scissors to understand Computer Science Andrea Valente Aalborg University in Esbjerg Denmark Home:
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
History 398 Fall 2004 History 398Lecture 20 FROM ENIAC TO EDVAC.
A New Kind of Science by Stephen Wolfram Principle of Computational Equivalence - Ting Yan,
Cellular Automata Introduction  Cellular Automata originally devised in the late 1940s by Stan Ulam (a mathematician) and John von Neumann.  Originally.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
CS851 – Biological Computing February 6, 2003 Nathanael Paul Randomness in Cellular Automata.
Cellular Automata BIOL/CMSC 361: Emergence 2/12/08.
제 4 주. Cellular Automata A Brief history of Cellular Automata P. Sarkar, ACM Computing Surveys, vol. 32, no. 1, pp. 80~107, 2000 학습목표 계산도구로서의 Cellular.
A few of the people involved and what they’ve done.
TRU-COMP3710 Artificial Life and Emergent Behavior1 Course Outline Part I – Introduction to Artificial Intelligence Part II – Classical Artificial Intelligence.
Conway’s Game of Life Jess Barak Game Theory. History Invented by John Conway in 1970 Wanted to simplify problem from 1940s presented by John von Neumann.
Reconfigurable Asynchronous Logic Automaton
1 IDT Open Seminar ALAN TURING AND HIS LEGACY 100 Years Turing celebration Gordana Dodig Crnkovic, Computer Science and Network Department Mälardalen University.
The Church-Turing Thesis Chapter 18. Are We Done? FSM  PDA  Turing machine Is this the end of the line? There are still problems we cannot solve: ●
Computing Systems Lecture 12 Future Computing. Natural computing Take inspiration from nature for the development of novel problem-solving techniques.
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis (Winter 2016, these slides were also used for Day 33)
MA/CSSE 474 Theory of Computation Universal Turing Machine Church-Turing Thesis Delayed due dates for HWs See updated schedule page. No class meeting.
Fall 2013 Lecture 27: Turing machines and decidability CSE 311: Foundations of Computing.
Computational Irreducibility & Emergence
Illustrations of Simple Cellular Automata
Cellular Automata + Reaction-Diffusion Systems
Turing Machines, Busy Beavers, and Big Questions about Computing
فصل سوم The Church-Turing Thesis
Cellular Automata.
Lecture One: Automata Theory Amjad Ali
Cellular Automata (CA) Overview
CO Games Development 2 Week 21 Turing Machines & Computability
Presentation transcript:

1LAAA Turing’s Machine A mechanical formalism (1937) –State (memory), rules (program) –Tape (data) Evolutionarily successful –Beat out Church’s mathematical formalism Mental perspective –A mapping of Gödel’s proof of incompleteness to programmable devices –In the war effort, effective computation was often accomplished by arrays of humans. © Sir John Dermont Turing

2LAAA Turing’s Mental Perspective “Computable numbers are those… calculable by finite means… the justification lies in the fact that the human memory is necessarily limited.” The machine is “directly aware” of symbols. “We may compare a man in the process of computing … to a machine…”

3LAAA Cellular Automata (Stan Ulam, et al.) A mass of cells, each of which –Has one of a (finite) number of states –Communicates to other “local” cells Cells compute their next state based on –Their current state –The states of neighboring cells Effectively massively parallel –Distinguished from Turing’s serial machine © Univ. Frankfurt

4LAAA von Neumann Could machines self-reproduce? First attempt –Robot in a “pool of parts” Second attempt (after work with Ulam) –Use cellular automaton to describe a universal Turing machine, programmed to write itself out

5LAAA von Neumann’s Automaton Arthur Burks, Essays on Cellular Automata, 1970.

6LAAA Digital Logic Computing Model Church’s Thesis: –Turing Machines, Cellular Automata, desktop machines (with sufficient memory) are all equivalent (“Turing equivalent”) Real machines constructed from digital components. –Small number of types computing boolean true/false values –One is sufficient: the NAND gate Output true exactly when neither input is true

7LAAA Lionel and Roger Penrose’s Self-Reproducing Analogue Two types of molecules White & Black Molecule are interlocked forming machines –White + Black –Black + White Machine-less universe does nothing Machine in universe generates others Machine flavor is preserved Godfrey Argent St. Andrews Universeity

8LAAA Conway’s “Game of Life” Each cell is alive or dead Population-motivated rules: –Life appears when exactly 3 neighbors –Life survives exactly when 2-3 neighbors dies offstable“spins”“glides”complex alive dead © St. Andrews

9LAAA Infinite generation and Turing Equivalence Certain configurations generate unbounded numbers of new individuals –E.g. “guns” generate streams of gliders Thinking of glider streams as wires –Carrying false values –Gliders interact to generate NAND gates

10LAAA Langton’s Ant Each cell is white or black An oriented “ant” sits atop one square Each step: –Ant inverts square –Moves forward –Turns left/right if new square is white/black –Effectively, ant forces any followers to stray Emergent behavior: mulls about based on input, then shoots off in direction Believed to be Turing equivalent © LENS Ventures

11LAAA Things to Think About Suppose the matrix of these cells is non- uniform; similar results? –E.g. Suppose we place Ant on aperiodic lattice –4-Connected –Not self-similar under shifts Not well understood

12LAAA More Recent Efforts Fredkin (MIT) & Toffoli’s (BU) CAM & programmable matter –Billiard balls with inelastic collision: Turing equivalent –Appropriate shaped bottles containing idealized gas molecules: Turing equivalent Fredkin’s Digital Philosophy –Possible Model of Everything –Believes cellular automata suitable model for physical laws DigitialPhilosophy.org © Tommaso Toffoli

13LAAA Wolfram’s “New” Kind of Science Popularized 1D cellular automata –Each row of cells generates the next –Cells are determined by small neighborhood above Approach to science is unfortunate Some rules (e.g. “rule 110”) Turing equivalent (Matthew Cook) © Wolfram Research

14LAAA Algorithmic Beauty of Sea-Shells Work of Hans Meinhart –Simulation of sea shell growth –Local enhancement; long-range inhibition –Study of periodicity and aperiodicity Follows in footsteps of Aristid Lindenmayer –Father of L-Systems © Scott Camazine © P. Prusinkeiwicz

15LAAA Turing’s 1952 Paper Alan Turing wrote a paper on “chemical basis for morphogenesis,” arguably the first paper in computational biology While many of the original ideas of that paper have been supplanted by better theory, it demonstrates a natural inclination to bring these two disciplines together Only a matter of time before some form of obvious biological computation is established The basis for ethical concern?

16LAAA Biology of Self-Organization 2001 work of Scott Camazine et al. –Ocular dominance in visual cortex (monkey) –Animal coat patterns –Behaviors of social insects –Flocking of birds & schooling of fish © Hubel, Harvard © Camazine © PIXAR