You are incorrect. The ability to control for structural risk in random forests and boosting is comparable to that of SVMs.
(For the audience, "structural risk" = "model complexity". Structural risk can cause overfitting. Hence, Occam's razor.)
You control for structural risk in random forests through hyperparameters like the maximum depth.
You control for structural risk in Adaboost through early stopping. In extensions of Adaboost, there might also be a learning rate.
In practice, I find it of comparable difficulty to control for overfitting in SVMs and random forests.
You are also incorrect that boosting can be easily parallelized. Each model update causes the weight of each example to be updated, and this weight vector must be shared. Hence, it is not trivial to parallelize boosting.
Roughly speaking, dropout training provides a strong regularizing effect through a sort of model averaging that is conceptually related to the well-known bagging approach from which random forests derive their power and flexibility. Dropout training has already produced state-of-the art results on several time-worn standard benchmarks and helped Hinton's group win a recent Kaggle competition (for an overview of their approach, see: http://blog.kaggle.com/2012/11/01/deep-learning-how-i-did-it...).
The number of layers is one of the factors controlling model complexity.
Interesting, the number of units in the hidden layers isn't as important as the size of the weights of the hidden units. This is a famous result from the 1990's.
Hence, a principled way of controlling overfitting in NNs is: Pick a large enough number of weights that you don't underfit, and apply l2-regularization to the hidden unit weights. This is superior to fiddling with the number of hidden units in an unregularized net.
A related result is that you can control model complexity by imposing sparsity on the activations of the hidden units.