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 Computability and Halting Problem
Description
This lecture introduces the theory of computability, focusing on decision problems that require a 'yes' or 'no' answer for each value. The instructor explains the halting problem, which questions if an algorithm will terminate in finite time. Turing's 1936 demonstration shows that an algorithm predicting this does not exist.
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.