Concept stub
Complexity Theory (P vs NP)
Mathematics & Logic
The study of what is computable in practice, not just in principle.
Complexity Theory (P vs NP) — The study of what is computable in practice, not just in principle.
This entry is a stub. It will be written out in full when a Chromix article calls for it. What belongs here: what Complexity Theory (P vs NP) actually did, why it mattered at the time, and what it made possible afterwards — each claim carrying its own source.
This entry is a stub. Most First Principles entries begin short and deepen only when a new article calls for it — the encyclopedia grows as Chromix writes.