When one faces problems to solve, randomness can be used in order obtain faster answers at the cost of some uncertainty. Probabilistic complexity classes capture the different ways in which this can be done. In this talk, we introduce the basic probabilistic complexity classes, their interrelations and we illustrate by outlining the solution to concrete problems.