Lecture 35

Lecture 35 - ECE52 Spring 11 Lecture 35 4/11/11 Interim...

Info iconThis preview shows pages 1–7. Sign up to view the full content.

View Full Document Right Arrow Icon
1 ECE52 Spring 11 Lecture 35 4/11/11 Interim project progress reports due Friday 4/15/11 Viewed some of http://aturingmachine.com/ in class
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
2 A FSM with infinite memory: Turing Machines Consider a system consisting of Finite State Machine M which is coupled through a read/write head to an arbitrarily long storage register called the tape . The tape is divided into squares, with each square storing a single symbol. Blank == 0. The head can do three things: read current symbol write a new (not necessarily distinct) symbol move the tape one position left or right 1 1 1 1 Tape Finite State Control Unit Head
Background image of page 2
3 Turing Machine operation In one computation cycle: – Starting from state S i , machine reads current symbol writes a new symbol (could be the same) moves one position left or right – enters state S j . 1 1 1 1 Tape Finite State Control Unit Head
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
4 Turing machine example Design Turing FSM that, given two finite blocks of 1’s separated by a finite block of 0’s (blanks) on the tape, will shift the left- hand block of 1’s to the right until it touches the right-hand group and then halt (i.e. unary addition!). Initial conditions: machine is in state A positioned over leftmost square containing a 1. 1 1 1 1 A 1 1 1 1 HLT
Background image of page 4
5 Algorithm At each step, erase left-most one and write a new one in first open blank square (blank=0) 1 1 1 1 A 1 1 1 1 C 1 1 1 1 A 1 1 1 1 C 1 1 1 1 C->HLT Present State Next State, write, shift 0 1 A - B,0R B C,1R B,1R C D,0L Halt D A,0R D,1L Halt Halt Halt
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
6 So why do we care? Provides theoretical framework (CPS140) for thinking about problems that are computable but not with a FSM alone not computable even with infinite tape (memory) Any “Turing-complete” computer can in principle run any computable problem
Background image of page 6
Image of page 7
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/05/2011 for the course ECE 52 taught by Professor Dr.jonathanboard during the Spring '11 term at Duke.

Page1 / 21

Lecture 35 - ECE52 Spring 11 Lecture 35 4/11/11 Interim...

This preview shows document pages 1 - 7. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online