In this note we overview class #P. The main attention is devoted to the permanent computing problem. The proof of it's #P-completeness (Valiant's theorem) is given. And finally we give an interactive protocol for P^#P with prover from the same class.