The limits of computation are governed by a number of different factors.
Computability theory describes the degree to which problems are computable, whereas complexity theory describes the asymptotic degree of resource consumption.
Computational problems are therefore confined into complexity classes.
The arithmetical hierarchy and polynomial hierarchy classify the degree to which problems are respectively computable and computable in polynomial time.
of the arithmetical hierarchy classifies computable, partial functions.