AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
The Complexity Theory Analogies
This section contains some complex mathematical notation from complexity theory. The coordinators of the AGI safety fundamentals course have indicated that if you don't have a background in complexity theory you can skip this section. I will continue to read this section because it also contains natural language explanations, and I'll try to gloss over the mathematical notation. Back to the text. Section 2.2, complexity theory analogies. Debate equals p space. This table has columns for steps, formula, complexity class, and machine learning algorithm. Zero steps corresponds to supervised learning, one step to reinforcement learning, two steps to two round games,. And then so forth until n steps for n round games, and then poly or