Computability Theory

Home > Languages > Formal Language > Turing Machines > Computability Theory

This branch of computer science deals with the ability to solve problems with a computer. It explores the limits of computation, such as what problems can and cannot be solved using computational methods, including the Church-Turing thesis.