Great Ideas in Theoretical Computer Science: Computability

This course on computability in theoretical computer science aims to teach students the fundamental concepts and theories related to computation and algorithms. By the end of the course, learners will understand the formal definition of Turing Machines, decidable languages, the Church-Turing Thesis, and the concept of uncomputable functions. The course covers topics such as the finite control, universal Turing Machines, and the Halting Problem. The teaching method includes lectures, programming exercises, and discussions. This course is intended for students and professionals interested in deepening their understanding of theoretical computer science and computability.