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
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.
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.