Advertisement

Uncomputable Functions and Incompleteness

Algorithmic information is plagued by a strange impossibility that shakes the very foundations of logic and mathematics. Investigate this drama in four acts, starting with a famous conundrum called the Berry Paradox and including Turing's surprising proof that no single computer program can determine whether other programs will ever halt.

English
  • Runtime 31 minutes
  • Network The Great Courses
  • Created July 22, 2020 by
    Administrator admin
  • Modified February 7, 2023 by
    RicaRaducanu