15-453 Formal Languages, Automata, and Computation
Lecture 30: Verifiers

We define the notion of a verifier and consider some examples. A verifier is a deterministic Turing machine that checks a property when supplied with a certificate (also called witness). Verification in polynomial time is equivalent to non-deterministic computation in polynomial time.

[ Home | Schedule | Assignments | Handouts | Overview ]

Frank Pfenning