Computability

This hierarchy reveals that undecidability has structure. It is not a uniform darkness but a landscape with its own topography. Some problems are "just barely" undecidable; others are profoundly so. The study of these degrees, computability theory in the narrow sense, is a rich branch of mathematical logic with connections to set theory, model theory, and descriptive set theory.