Learning Path

Theory of Computation

Mathematical Foundations → The Polynomial Hierarchy and Beyond

16 Knowledge Nodes · 16 Learning Steps · v0 Active

A systematic path through the foundations of theoretical computer science, from automata and formal languages to Turing machines, undecidability, and complexity classes. Designed for senior university students, it builds rigorous mathematical intuition for what can and cannot be computed, and how efficiently.

Knowledge Map

Explore the complete knowledge graph with this learning route highlighted, or switch to Route to focus on the route topology.

Explore Knowledge Structure

Explore all concepts and relationships across the complete graph.

16 nodes26 edges3 relationships

Drag to pan · Scroll to zoom · Click a node to inspect

Click a node to preview its details without leaving this path. Scroll to zoom, or open Fullscreen to explore the whole map.

Learning Route

16 learning steps · 4 phases. Click any step to inspect it and see it on the Knowledge Map.

Phase 1

Foundation

4 steps

Phase 2

Core Concepts

4 steps

Phase 3

Advanced Topics

4 steps

Phase 4

Specialization

4 steps