YoVDO

Kolmogorov Complexity and Gödel's Incompleteness Theorems

Offered By: Churchill CompSci Talks via YouTube

Tags

Mathematical logic Courses Information Theory Courses Kolmogorov Complexity Courses

Course Description

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the fascinating intersection of information theory and mathematical logic in this 26-minute conference talk. Delve into the concept of Kolmogorov complexity, which measures the shortest program length required to output a given string. Discover how this fundamental idea relates to data randomness and compressibility in information theory. Learn how Kolmogorov complexity can be applied to prove classical results in mathematical logic and computability. Follow along as the speaker presents an overview of Kolmogorov complexity, demonstrates its application in simple proofs, and then provides proof sketches for both of Gödel's incompleteness theorems using these concepts.

Syllabus

Kolmogorov Complexity and Gödel’s Incompleteness Theorems


Taught by

Churchill CompSci Talks

Related Courses

Kolmogorov Complexity for DNA Sequences Analysis in Python
Yacine Mahdid via YouTube
Unexpected Hardness Results for Kolmogorov Complexity Under Uniform Reductions
Association for Computing Machinery (ACM) via YouTube
Kolmogorov Music
Strange Loop Conference via YouTube
Cryptography and Kolmogorov Complexity - A Quick Tutorial
Simons Institute via YouTube
On One-way Functions and Kolmogorov Complexity
IEEE via YouTube