Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
Theory of Computation: Decidability and Complexity
This lecture explores the theory of computation, focusing on the concepts of decidability and complexity. It covers topics such as undecidable problems, algorithms for specific instances, complexity classes P and NP, and the P vs. NP problem. The instructor discusses the efficiency measurement of algorithms, the classes P and NP, and the Boolean Satisfiability Problem. The lecture also delves into reductions, equisatisfiability, and the transformation of CNF SAT to 3SAT, providing examples and insights into the complexity of problems.
This video is available exclusively on Mediaspace for a restricted audience. Please log in to MediaSpace to access it if you have the necessary permissions.
Watch on Mediaspace