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.
Lecture
Theory of Computation: Countability and Undecidable Problems
Description
This lecture covers the theory of computation, focusing on countability and undecidable problems. It delves into the study of which problems can be solved with algorithms efficiently, the concept of countability, complexity classes P and NP, problem instances, look-up tables, comparing infinite sets, and the halting problem's undecidability.
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 MediaspaceOfficial source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.