Oatmeal is Cheap - A Fundamental Theorem for Procedural Generators

Explore the fascinating world of procedural generation in this 42-minute conference talk from Strange Loop. Delve into the Kolmogorov complexity of procedural generators and discover a fundamental theorem for programs that generate content. Uncover the deep connection between the knowledge encoded in generators and the complexity of their outputs. Gain insights into the practical decisions game designers face when developing popular titles like Minecraft, Borderlands, and Tea Garden. Engage with interactive examples throughout the presentation to enhance your understanding. Led by Younès Rabii, an award-winning game designer and PhD researcher in game AI, this talk bridges the gap between theoretical concepts and real-world applications in game development and generative AI. Learn about Rabii's research goals, including resisting systemic oppression in the AI and game industries and creating games that surprise both players and designers.