Infinite Duration Games, Memory and Graphs - Part 2

Explore advanced concepts in infinite duration games, memory structures, and graph theory in this nearly two-hour seminar lecture presented at the prestigious Kolmogorov Seminar on computational and descriptional complexity. Delve into the second part of Pierre Ohlmann's comprehensive analysis, building upon foundational concepts established in part one while examining the intricate relationships between infinite game structures, memory requirements, and their graphical representations. Learn from cutting-edge research presented at this renowned seminar series, which has been advancing computational complexity theory since its establishment by Kolmogorov in 1979.