Lectures related to Theory of Computation: Countability and Undecidable Problems

Covers the Deutsch and Josza problem in quantum computation, focusing on boolean functions and oracles.

Explores counting infinite sets and decision problems, showcasing the limits of computation in solving certain undecidable problems.

Covers complexity classes, tractable problems, the class NP, NP-complete problems, and summarizes the concept of tractable problems.