In computational complexity theory, the class IP is the class of problems solvable by an interactive proof system. It is equal to the class PSPACE. Wikipedia