We study a new type of proof system, where an unbounded prover
and a polynomial time verifier interact, on inputs a string $x$ and
a function $f$, so that the Verifier may learn $f(x)$. The novelty
of our setting is that there no longer are ``good...