Complexity classes where $C^C = C$ One possible motivation for studying computational complexity classes is to understand the power of different kinds of computational resources (randomness, non-determinism, quantum effects, etc.).  If we look at it from this perspective, then it seems like we can obtain one plausible axiom for any attempt at characterizing which computations are feasible in some model:


Any feasible computation can always invoke another feasible computation as a subroutine.  In other words, suppose the programs $P,Q$ are considered feasible to execute.  Then if we construct a new program by hooking $P$ and $Q$ up, so that $P$ makes subroutine calls to $Q$, then this new program is also feasible.


Translated into the language of complexity classes, this axiom amounts to the following requirement:


If $C$ is a complexity class intended to capture which computations are feasible in some model, then we must have $C^C = C$.


(Here $C^C$ represents computations in $C$ that can invoke an oracle from $C$; that's an oracle complexity class.)  So, let's call a complexity class $C$ plausible if it satisfies $C^C=C$.

My question: What complexity classes do we know of, that are plausible (by this definition of plausible)?

For instance, $P$ is plausible, since $P^P=P$.  Do we have $BPP^{BPP} = BPP$?  What about $BQP^{BQP} = BQP$?  What are some other complexity classes that meet this criterion?

I suspect that $NP^{NP} \ne NP$ (or at least, that would be our best guess, even if we cannot prove it).  Is there a complexity class that captures non-deterministic computation and that is plausible, under this definition?  If we let $C$ denote the smallest complexity class such that $NP \subseteq C$ and $C^C \subseteq C$, is there any clean characterization of this $C$?
$\mathrm{BQP}^{\mathrm{BQP}} = \mathrm{BQP}$ has been proved in Strengths and Weaknesses of Quantum Computing Bennett et al. (arXiv).

According to the complexity zoo, $\mathrm{ZBQP}^{\mathrm{ZBQP}} = \mathrm{ZBQP}$.