We intoduce the notion of interactive proof systems and the complexity classes IP, AM, MA, emphazing the role of randomness and interaction in these models. The concept is demonstrated by giving an interactive proof system for the graph non-isomorphism problem.We discuss issues regarding the relations between the complexity classes with respect to the number of rounds allowed. Furthermore we give an zero knowledge proof for the 3-coloring problem.