Computability theory

Home > Computer Science > Theory of Computation > Formal Languages > Computability theory

This topic involves understanding the limits of computation. It includes understanding the concept of recursive and recursively enumerable languages, Church-Turing thesis, and the concept of decidable and undecidable problems.