factual
CS Complexity Theory Distinct From Santa Fe Complexity
Computer-science 'complexity theory'—which classifies problems by how time and memory resources scale with input size (e.g. P vs NP)—is a distinct, tightly-defined field that merely shares a name with Santa Fe Institute-style 'complexity theory'; the latter, studying complex adaptive systems, lacks a similarly crisp characterization of which problems fall inside it, making it more of a loose interdisciplinary cluster than a precisely bounded area.
factualpending
Speaker
Sean CarrollEvidence Quote
“Do you think that there is any similarly tight characterization of Santa Fe-style complexity theory, where researchers would agree on which problems fall within that area and which don't?”
Created: 6/13/2026, 12:14:15 AM
Your notes
Loading notes...