Course Description

Welcome to Computability theory. This course covers the fundamentals of computation. We cover Finite Automata, Context Free languages, and Turing Machines. If time permits, we will also study more advanced problems in computational complexity theory. The course is being offered on the NPTEL Swayam portal also. The NPTEL course link is here
The course is also available on YouTube

Instructor: Dr. Subrahmanyam Kalyanasundaram
Teaching Assistants: Kartik Srinivas , Suryaansh Jain, Kartheek Tammanna, Gautham Bellamkonda