Lecture

Halting Problem: Unsolvable Problems

In course

Commodo velit id aliqua esse cupidatat consequat tempor elit ex cupidatat. Deserunt irure cillum ipsum reprehenderit tempor exercitation eiusmod consequat eu irure culpa. Aliquip velit nisi amet reprehenderit ad veniam nostrud qui ea qui consequat. Eiusmod Lorem et ullamco nostrud minim et irure labore consectetur velit ea id officia consequat. Esse elit esse est anim enim sit.

Description

This lecture discusses the concept of unsolvable problems in algorithms, focusing on the halting problem introduced by Turing. It presents a theorem stating that the halting problem cannot be solved by any procedure, providing a proof sketch to support this claim. The lecture concludes by summarizing the limitations of algorithms in solving every problem.

Official source

https://mediaspace.epfl.ch/media/0_5d1mh4ny

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.

Ontological neighbourhood

Theoretical computer science

Algorithms and data structures: Analysis of algorithms

Theory of computation: Computability theory

Related lectures (31)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.