Turing machine simulations. Why study so many examples? –Get an intuition for what goes on inside computers without learning all the details of a programming.

Slides:



Advertisements
Similar presentations
Operations and Algebraic Thinking. Quick write (sentence each) What is algebraic thinking? How is algebraic thinking connected to operations? Why do.
Advertisements

30 min Scratch July min intro to Scratch A Quick-and-Dirty approach Leaving lots of exploration for the future. (5 hour lesson plan available)
Announcements You survived midterm 2! No Class / No Office hours Friday.
Excel Using Formulas and Functions Microsoft Office 2010 Fundamentals 1.
New Mexico Computer Science For All Designing and Running Simulations Maureen Psaila-Dombrowski.
The Big Picture Chapter 3. We want to examine a given computational problem and see how difficult it is. Then we need to compare problems Problems appear.
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.
January 5, 2015CS21 Lecture 11 CS21 Decidability and Tractability Lecture 1 January 5, 2015.
CS Summer 2005 Final class - July 1st Assorted fun topics in computability and complexity.
Scientific Notation. Mathematicians are Lazy!!! They decided that by using powers of 10, they can create short versions of long numbers.
RM2D Let’s write our FIRST basic SPIN program!. The Labs that follow in this Module are designed to teach the following; Turn an LED on – assigning I/O.
{ CS203 Lecture 7 John Hurley Cal State LA. 2 Execution Time Suppose two algorithms perform the same task such as search (linear search vs. binary search)
Copyright 2009 by Pearson Education Building Java Programs Chapter 2 Lecture 2-2: The for Loop reading: 2.3 self-check: exercises: 2-14 videos: Ch.
Governor’s School for the Sciences Mathematics Day 13.
Establishing the Equivalence between Recurrent Neural Networks and Turing Machines. Ritesh Kumar Sinha(02d05005) Kumar Gaurav Bijay( )
Chapter 11 An Introduction to Visual Basic 2008 Why Windows and Why Visual Basic How You Develop a Visual Basic Application The Different Versions of Visual.
Does not Compute 4: Finite Automata In which we temporarily admit defeat with cellular automata (we will face them again, in the epic final “Does Not Compute”
Course material – G. Tempesti Course material will generally be available the day before the lecture Includes.
2015 CSE/EGR Summer Camps 1 Computer Science Concepts 1. What is an algorithm? 2. Binary information coding 3. Programming concepts via Scratch Designed.
Introduction to Lattice Simulations. Cellular Automata What are Cellular Automata or CA? A cellular automata is a discrete model used to study a range.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
Analysis of Algorithms CSCI Previous Evaluations of Programs Correctness – does the algorithm do what it is supposed to do? Generality – does it.
Chapter 11 An Introduction to Visual Basic 2005 Why Windows and Why Visual Basic How You Develop a Visual Basic Application The Different Versions of Visual.
COMPUTER ORGANISATION I HIGHER STILL Computing Computer Systems Higher Marr College Computing Department 2002.
David Evans cs302: Theory of Computation University of Virginia Computer Science Lecture 16: Universality and Undecidability.
Practice: a) cm – cm = b) 6.54 m x 0.37 m = c) 40.8 m 2  m =
The Northern Lights: Demonstrations. Programmability Overview A major aspect of our project is programmability- it is an interactive display medium, the.
Cellular Automata FRES 1010 Eileen Kraemer Fall 2005.
Use Flowchart modeling to design and create an interactive quiz to be run on Powerpoint. Start Question Click to start the quiz Correct Incorrect, try.
Cellular Automata Martijn van den Heuvel Models of Computation June 21st, 2011.
CS851 – Biological Computing February 6, 2003 Nathanael Paul Randomness in Cellular Automata.
A few of the people involved and what they’ve done.
Introduction to TouchDevelop Lesson 3 – Comments & Lists Created by S. Johnson
OCR A Level F453: The function and purpose of translators Translators a. describe the need for, and use of, translators to convert source code.
1 8.4 Extensions to the Basic TM Extended TM’s to be studied: Multitape Turing machine Nondeterministic Turing machine The above extensions make no increase.
Mealy Machines Finite State Machines with Outputs given on the transitions.
Victorian Curriculum Mathematics F - 6 Algorithms unplugged
CSE202: Introduction to Formal Languages and Automata Theory
Scratch Unit Overview We are going to look at computer programming and how to create your very own computer game The piece of software we will be using.
Big O: Make it Simple Determine how complex the algorithm is, in relative to the size of the problem (e.g: List to be sorted) 'O' Stands for 'Order' -
Extensions and Restrictions of Turing Machines
My Penguin Math Book By:
My Penguin Math Book By:
Statistics 1: Elementary Statistics
Learn… Create… Program
My Penguin Math Book By:
My Penguin Math Book By:
Arithmetic Logical Unit
Genetic Algorithms Artificial Life
Bacteria Objectives To identify & obtain necessary information to solve problems. To solve substantial problems by breaking them down into smaller parts.
My Penguin Math Book By:
My Penguin Math Book By:
Learn… Create… Program
My Penguin Math Book By:
Algorithms.
My Penguin Math Book By:
Recall last lecture and Nondeterministic TMs
ICT Gaming Lesson 3.
Jeopardy Operations Start.
Year 2 Autumn Term Week 9 Lesson 2
Number Lines.
Learn… Create… Program
Learn… Create… Program
Year 2 Autumn Term Week 9 Lesson 2
Primary School Computing
Sequences Example Continue the following sequences for the next two terms 1, 2, 3, 4, 5, ……… 2, 4, 6, 8, 10, ………… 1, 3, 5, 7, 9, ………….. 4, 8, 12, 16, ………….
Fast-Track UiPath Developer Module 3: Workflow Organization
a) I can work out the next two terms (numbers) in a sequence
Presentation transcript:

Turing machine simulations

Why study so many examples? –Get an intuition for what goes on inside computers without learning all the details of a programming language –Complex tasks performed by sequence of very simple instructions Emergent complexity –Very simple rules lead to very complex behavior –Scientists try to understand how our universe can be so complex when physics is simple

Multiplication and sample output Addition and doubling programs Recognizing a language A sorting Turing machine Addition and subtraction Addition, divisibility, and primality Turing Kara Wolfram’s Version of Turing machines –Explain notation –Explain 3-state 2-color TM

Minsky’s small universal Turing machine –Explain transition function notation Two-dimensional TM from Wolfram –Binary counting Turmite (90 degrees left) –Initially arrow faces up –Little square, original color. –Big square, new color. –Other patterns produced by various turmites A random pattern produced by a Turmite –Binary counter, started with two black squares

Langton’s Ant –Believed to start a highway from any intial pattern Turmite simulations –Click on “Launch Turmites” –Click on “Load” –Choose turmite –Click on “Load” –Click on “Fast” then “Zoom out” –Can edit rules too

John Conway’s Game of Life –Show rules –Do a few random patterns, see what happens Turing Machines in Conway’s Game of LifeTuring Machines in Conway’s Game of Life Patterns, Programs, and Links for Conway's Game of LifePatterns, Programs, and Links for Conway's Game of Life –Click on a picture to run the game of life –Do a few selected topics