Scribd
Upload
191 views18 pages

CSCI-2400 Models of Computation: Fall 2005 Costas Busch - RPI 1

This document provides information about a Models of Computation course taught by Costas Busch in Fall 2005. It outlines that the course will cover chapters 1-5 and 7 of Sipser's Introduction to the Theory of Computation textbook. It also describes different types of automata including finite automata, pushdown automata, and Turing machines, and how their varying memory capabilities allow them to solve more or less complex computational problems.

Uploaded by

tariqravian
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
Download as ppt, pdf, or txt
191 views18 pages

CSCI-2400 Models of Computation: Fall 2005 Costas Busch - RPI 1

This document provides information about a Models of Computation course taught by Costas Busch in Fall 2005. It outlines that the course will cover chapters 1-5 and 7 of Sipser's Introduction to the Theory of Computation textbook. It also describes different types of automata including finite automata, pushdown automata, and Turing machines, and how their varying memory capabilities allow them to solve more or less complex computational problems.

Uploaded by

tariqravian
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
Download as ppt, pdf, or txt
Download as ppt, pdf, or txt
You are on page 1/ 18

CSCI-2400

Models of Computation

Fall 2005 Costas Busch - RPI 1


General Info for the Course

Instructor: Costas Busch

Syllabus: tentative class schedule


can be found in course web page
http://www.cs.rpi.edu/~buschc/courses/modcomp/fall2005

Grading: Weekly Homeworks: 34%


3 Exams: 66% (each 22%)
Fall 2005 Costas Busch - RPI 2
Book: Introduction to the
Theory of Computation
Michael Sipser, 2nd edition

Chapters that will be covered: 1-5,7

Fall 2005 Costas Busch - RPI 3


Outline of the course contents

Computation

CPU memory

Fall 2005 Costas Busch - RPI 4


temporary memory

input
CPU
output

Program memory

Fall 2005 Costas Busch - RPI 5


3
Example: f ( x)  x

temporary memory

input
CPU
output
Program memory
compute xx
2
compute x x
Fall 2005 Costas Busch - RPI 6
3
f ( x)  x

temporary memory
input
x2
CPU
output
Program memory
compute xx
2
compute x x
Fall 2005 Costas Busch - RPI 7
3
temporary memory f ( x)  x
z  2*2  4
f ( x)  z * 2  8
input
x2
CPU
output
Program memory
compute xx
2
compute x x
Fall 2005 Costas Busch - RPI 8
3
temporary memory f ( x)  x
z  2*2  4
f ( x)  z * 2  8
input
x2
CPU
f ( x)  8
Program memory output
compute xx
2
compute x x
Fall 2005 Costas Busch - RPI 9
Automaton
temporary memory

Automaton
input
CPU
output

Program memory

Fall 2005 Costas Busch - RPI 10


Automaton
temporary memory

Automaton
input

output
transition

state

Fall 2005 Costas Busch - RPI 11


Different Kinds of Automata
Automata are distinguished by the temporary memory

• Finite Automata: no temporary memory

• Pushdown Automata: stack

• Turing Machines: random access memory

Fall 2005 Costas Busch - RPI 12


Finite Automaton

temporary memory

input
Finite
Automaton
output

Example: Vending Machines


(small computing power)
Fall 2005 Costas Busch - RPI 13
Pushdown Automaton
Temp.
memory Stack Push, Pop

Pushdown input

Automaton
output

Example: Compilers for Programming Languages


(medium computing power)
Fall 2005 Costas Busch - RPI 14
Turing Machine

Temp.
memory Random Access Memory

input
Turing
Machine
output

Examples: Any Algorithm


(highest computing power)
Fall 2005 Costas Busch - RPI 15
Power of Automata
Simple More complex Hardest
problems problems problems

Finite Pushdown Turing


Automata Automata Machine

Less power More power


Solve more
computational problems
Fall 2005 Costas Busch - RPI 16
Turing Machine is the most powerful
computational model known

Question: Are there computational


problems that a Turing Machine
cannot solve?

Answer: Yes (unsolvable problems)

Fall 2005 Costas Busch - RPI 17


Time Complexity of Computational Problems:

NP-complete problems
Believed to take exponential
time to be solved

P problems
Solved in polynomial time

Fall 2005 Costas Busch - RPI 18

You might also like