Interactive proof, computational and complexity theory

Interactive proof is a computational model where two or more turing machines iterac: A verifier which is a PTM with polynomial time restriction and one or more provers, at begining with no time or space limitation. It has applications in criptografy and also give us a caracterization of some complexity classes like PSPACE and NEXP. One of its variants, PCP , allow us to caracterize NP.