CSCI 419 Lecture 1 Introduction
CSCI 419 Lecture 1 Introduction
CSCI 419 Lecture 1 Introduction
Theory of
q0 q1
1
0 1 1
q2 0
q3
COMPUTATION
Lecture 1: Introduction
Sahar Selim
Prerequisites
Lecture (2 hrs/week)
Theoretical and Scientific Background
Lecture
Sunday 12:30 – 2:30
Monday 12:30 – 2:30
Wednesday 8:30 – 10:30
Office Hours
Wednesday 2:30 – 4:30
Historical Perspective
Branches of TC
Computability vs Complexity
Solvable or not Easy or hard
Sahar Selim CSCI419 | Theory of Computation Lecture 1: Introduction 25
Computation
CPU memory
Program memory
26
temporary memory
input
CPU
output
Program memory
27
Example: f(x) = x3
temporary memory
input
CPU
output
Program memory
compute x * x
compute x2 * x 28
f(x) = x3
temporary memory
input
x=2
CPU
output
Program memory
compute x * x
compute x2 * x 29
temporary memory f(x) = x3
z = 2*2 = 4
f(x) = z*2 = 8
input
x=2
CPU
output
Program memory
compute x * x
compute x2 * x 30
temporary memory f(x) = x3
z = 2*2 = 4
f(x) = z*2 = 8
input
x=2
CPU
f(x) = 8
Program memory output
compute x * x
compute x2 * x 31
Automaton an abstract
computing
temporary memory device
Automaton
input
CPU
output
Program memory
32
Automaton
temporary memory
Automaton
input
output
state
33
Different Kinds of Automata
temporary memory
input
Finite
Automaton
output
input
Pushdown
Automaton
output
input
Turing Machine
output
Answer:
Yes (unsolvable problems)
NP-complete problems
(Non-deterministic Polynomial time problems)
► Believed to take exponential time to be solved