CL
DP
A
M
CT
Cal
Prove that certain models of computation are equivalent and translate between them algorithmically.
Learning Goal: Explain nondeterminism and describe tools for simulating it with deterministic computation.
PDF LaTeX Raw HTML
Learning Goal: Explain the Church-Turing thesis and use it to operationalize the notion of algorithm.