Computability theory
From Exampleproblems
Computability theory is the branch of theoretical computer science that studies which problems are computationally solvable using different models of computation.
Computability theory differs from the related discipline of computational complexity theory, which deals with the question of how efficiently a problem can be solved, rather than whether it is solvable at all.
