Post's theorem establishes a close connection between the arithmetical hierarchy of sets of natural numbers and the Turing degrees.
Post's theorem establishes a close connection between the arithmetical hierarchy and the Turing degrees of the form, that is, finitely iterated Turing jumps of the empty set.
0.004 seconds.