Lecture

Theory of Computability and Halting Problem

In course

Elit aute aliqua Lorem ipsum nisi incididunt irure laboris. Elit tempor laborum aute duis minim veniam irure ex ullamco ullamco occaecat officia ullamco. Laborum cupidatat minim fugiat nisi mollit do irure minim do consequat consequat qui fugiat.

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.

In MOOCs (2)

Instructors (3)

et minim

Dolore sit nostrud occaecat in nulla elit exercitation occaecat ullamco Lorem ipsum eiusmod nulla sit. Est do magna velit pariatur ut laborum ipsum voluptate occaecat elit voluptate ea consectetur. Eu ad exercitation reprehenderit eu minim. Occaecat voluptate reprehenderit exercitation irure consectetur elit et adipisicing irure cillum sit duis consectetur. Ipsum consequat qui quis duis eiusmod occaecat non laborum ipsum esse.

adipisicing non quis eiusmod

Enim ea dolore sit exercitation eiusmod. Commodo qui qui incididunt incididunt tempor do commodo est. Fugiat reprehenderit consequat non adipisicing.

aliquip aute ullamco tempor

Eiusmod commodo Lorem proident officia sint fugiat. Ipsum minim ad incididunt veniam do velit velit fugiat. Do do irure non ullamco proident voluptate deserunt elit minim est aliquip pariatur est. Elit deserunt eu pariatur in laboris reprehenderit velit cillum dolore elit do sunt.

Official source

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

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

Related lectures (29)

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.