Watch a detailed Kolmogorov seminar lecture exploring the layered version of the Kraft lemma, as presented in the Barmpalias-Lewis-Pye paper. Delve into this 79-minute presentation by Alexander Shen, delivered as part of the prestigious Kolmogorov seminar series on computational and descriptional complexity, which was established by Kolmogorov himself around 1979. Learn about the mathematical intricacies and theoretical implications of this important extension to the classical Kraft inequality.
Overview
Syllabus
Kraft--Barmpalias--Lewis-Pye lemma (24.10.2022)
Taught by
Kolmogorov-Seminar
Related Courses
-
Improving Solovay's Theorem in Computational Complexity - Part 1
-
Improving Solovay's Theorem - Part 2
-
Combinatorial Rectangles, Kolmogorov Complexity and Experts' Aggregation - March 4, 2024
-
One-Way Computable Transformations - The Barmalias-Zhang Example
-
Computable PAC Learning - Part 2
-
Checking the Fraction of Satisfying Assignments for 3CNF
