Seminar on Mathematical Logic: Kolmogorov Complexity and a Proof of Gödel’s Theorem

This Wednesday, May 8, a new Seminar on Mathematical Logic will be given by Pablo Barceló, director of the IMC and researcher at the Millennium Institute @fundamentosdelosdatos and the National Center for Artificial Intelligence (CENIA).

👨‍🏫 The seminar is aimed at undergraduate and graduate students interested in the fundamentals of mathematics, model theory and computability theory. The objective is to deepen in concepts and theorems related to formal languages, algebraic logic and decidability.

📑 Title: Kolmogorov Complexity and a Proof of Gödel’s Theorem 𝗔𝗯𝘀𝘁𝗿𝗮𝗰𝘁: We will define the notion of Kolmogorov complexity of a string and show that the problem of computing such complexity is undecidable. From this we will deliver the basic ingredients to perform a simple proof of Gödel’s Theorem.

📆 May 8

🕓 16:10 hours

📍 Multipurpose Room, second floor Edificio Felipe Villanueva, Facultad de Matemáticas (, Campus San Joaquín.