The Chomsky hierarchy formula in Theory of Computation is a classification of formal languages based on the types of rules used to generate them. It includes four levels, with each level capable of generating a more complex set of languages than the previous level.