Alexander Kulikov: Complexity Theory, AI, and How We Teach Computer Science Now

In our newest episode, we chat with Alexander Kulikov, head of the Computer Science and Artificial Intelligence B.Sc. program at Neapolis University Pafos.

Episode links:

Our previous episodes can be found here: https://jb.gg/rsrch-pdcst

Find out more about JetBrains Research here: https://jb.gg/rsrch

Chapters:

00:00 – Introduction and STACS Conference

02:00 – AI in Theoretical Computer Science

04:30 – Bachelor Program and Evolving Curriculums

08:30 – Boolean Circuit Synthesis Competitions

12:00 – The "Game of Life" and Modern AI Iterations

16:45 – LLMs Winning IMO Medals 22:00 – Formal Verification and the Lean Language

25:30 – The Chess Analogy: AI Replacing Mathematicians

33:00 – AI Coding Agents and Don Knuth's $2.56 Check

38:30 – Distributed Algorithms and Complexity Theory

41:00 – Large-Scale Online Education and Adding JavaScript

48:45 – The Importance of Algorithmic Thinking

56:00 – Real-World Application: The Google Maps Polygon Problem

1:01:30 – Bioinformatics, SPAdes, and Fundamental vs. Applied Research

1:10:00 – Sabbatical Dreams: P vs. NP and Linear Time Limits

1:18:00 – Creating Mathematical Animations with Python

1:21:30 – AI Interpolation vs. Extrapolation and Joke Generation

1:25:00 – "Birds vs. Frogs": Research Styles in the AI Era

1:30:15 – Surprises, Rapid Changes, and the Future of AI

1:33:30 – Advice for New PhD Students: Follow Your Passion

1:36:30 – Outro and Final Thoughts

Fler avsnitt av JetBrains Research Podcast