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
Turing Machines: Decidability and Recursion Theory
Description
This lecture covers the concept of decidability in the context of Turing machines, exploring the Church-Turing thesis, undecidability, recursive languages, and the content of the tape at the end of computation.
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.