Uncomputable Functions and Incompleteness
(2016, original release: 2015)

Nonfiction

eCourse

Provider: Kanopy

Details

PUBLISHED
The Great Courses, 2015
[San Francisco, California, USA] : Kanopy Streaming, 2016
DESCRIPTION

1 online resource (streaming video file) (31 minutes): digital, .flv file, sound

ISBN/ISSN
1198272
LANGUAGE
English
NOTES

In Process Record

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

Title from title frames

Film

Originally produced by The Great Courses in 2015

Mode of access: World Wide Web

In English

Additional Credits