Lecture 1

Overview of the course. Definitions of Turing machine, deterministic and nondeterministic time and space complexity.

Turing Machine

Finite control: set of states

Move: scan symbol, write symbol, move left or right, change state

M = (Q,Σ,Γ,δ,q0,B,qacc,qrej)

Q finite set of states

Σ finite alphabet B is not in Σ

Γ finite tape alphabet: Σ is a strict subset of Γ (no B)

q0 - initial state

qacc,qrej halting states: accept and reject

δ maps Q×Γ→Q×Γ×{L,R}