The Last Lecture: Computability Questions in the Sphere Packing Problem

I will dedicate this last lecture of Manin's "Algebra, Geometry, and Physics" seminar to present his last work (and our last joint work) on computability questions arising naturally in the context of the sphere packing problem. I will show how our previous results on Kolmogorov complexity and the asymptotic bound for error correcting codes can provide some insight on this problem.