causal
Coarse-graining tractable despite computational irreducibility
Even though Gödel's incompleteness, computational irreducibility, and undecidability make perfect bottom-up simulation of emergent behavior in agent-based networks mathematically impossible, macroscopic coarse-graining remains tractable and successful—even far from equilibrium—because robust statistical regularities and effective descriptions emerge that are largely insensitive to microscopic detail, giving a thermodynamic rather than computational justification for higher-level predictability.
causalpending
Speaker
Sean CarrollEvidence Quote
“Given these hard logical ceilings on bottom-up approaches, what is the underlying physical or thermodynamic justification for why macroscopic coarse-graining remains tractable”
Created: 6/13/2026, 12:13:30 AM
Your notes
Loading notes...