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
Halting Problem: Unsolvable Problems
Description
This lecture discusses the concept of unsolvable problems in algorithms, focusing on the halting problem introduced by Turing. It presents a proof sketch demonstrating that there cannot be a procedure to determine if a program will halt. The lecture concludes by highlighting the limitations of algorithms in solving every problem.
Official 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.