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
Undecidability: Part 1
Description
This lecture introduces the concept of undecidability in the context of recursive languages and Turing machines, demonstrating the existence of languages that cannot be recognized by any algorithm.
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.