---
slug: oip-invariant-20-320-universal-computation
title: Invariant 3.20 — Universal computation
canonical: https://miscsubjects.com/a/oip-invariant-20-320-universal-computation
---

## 3.20 Universal computation
One machine can simulate any other; some processes are computationally irreducible. **Sources:** Church, Turing; von Neumann; Wolfram (irreducibility — T2/T3); Conway. **Domains:** computation, (contested) physics and biology. **Dual:** non-computable. **Tier:** T0 (core) / T3 (pancomputationalism). **Falsifier:** a physical process provably non-simulable by any Turing machine. **Maps:** A₃.

---

## Corpus map
- Same invariant, other planes: [Catalogue node C20](/a/oip-node-c20-universal-computation) · [Encyclopedia C20](/a/convergence-encyclopedia-c20)
- Inventory hub: [Convergence Catalogue — Public Article](/a/oip-convergence-public-article)
