I have been studying Zero Knowledge Proof. I found the Definition of Interactive Proof says that Verifier is ppt. And I only found in PP (Complexity) Wikipedia says that ppt:
Turing machines that are polynomially-bound and probabilistic are characterized as PPT, which stands for probabilistic polynomial-time machines. This characterization of Turing machines does not require a bounded error probability. Hence, PP is the complexity class containing all problems solvable by a PPT machine with an error probability of less than 1/2.
Still very confusing about the PPT, what's the full name of PPT? we do we need the verifier to be PPT for interactive Proof?
Resource from: Zero Knowledge Proofs CS276: Cryptography, UC Berkeley