computational equivalence
The principle that simple computational systems can be as powerful and capable as any computation, suggesting that fundamentally complex phenomena arise not from system complexity but from the inherent power of computation itself
As defined in What We've Learned from NKS 20 Years Later: The Making and Current State of NKS [Part 1]
Where it comes up · 1
Most important claims · 2 of 2Search all claims for “computational equivalence” →
- The principle of computational equivalence—the idea that simple computational systems can be as powerful as any computation—was discovered in spring 1992, and the name for the principle emerged simultaneously with the insight itself.What We've Learned from NKS 20 Years Later: The Making and Current State of NKS [Part 1]
- By early 1993, the table of contents for NKS was 'already starting to look a lot more similar to the final table of contents', with chapters on satisfying constraints vs evolving rules, processes of perception, the principle of computational equivalence, and fundamental implications.What We've Learned from NKS 20 Years Later: The Making and Current State of NKS [Part 1]