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 determin...
| Corporate Authors: | , |
|---|---|
| Format: | Video |
| Language: | English |
| Language Notes: | In English |
| Published: |
[San Francisco, California, USA] :
The Great Courses,
2015.
Kanopy Streaming, 2016. |
| Subjects: | |
| Online Access: | Connect to this streaming video |
| Summary: | 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.. |
|---|---|
| Item Description: | Title from title frames. Film Electronic resource. |
| Physical Description: | 1 online resource (streaming video file) (31 minutes): digital, .flv file, sound |
| Playing Time: | 00:30:49 |
| Format: | Mode of access: World Wide Web. |