On operators of higher types

We discuss the use of operators of higher types in complexity theory. These are operators ranging over sets of words, i.e. over oracles. Depending on different oracle access mechanisms we consider two types of operators. In particular we examine existential, universal, and bounded-error probabilistic operators. We identify some of the emerging classes and we interpret recent results about interactive protocols in terms of these operators.