Physical complexity and black hole quantum computers
Michele Reilly, Seth Lloyd

TL;DR
This paper explores the physical limits of computation across various systems, including black holes and the universe, highlighting implications for future AI and computational paradigms beyond digital technology.
Contribution
It introduces measures of physical complexity and applies them to diverse systems, revealing fundamental resource constraints and potential new computational approaches.
Findings
Black holes exhibit extreme physical complexity.
Biological systems operate near efficiency limits.
Implications for developing new AI paradigms.
Abstract
The ultimate limits of computation are not just logical, but physical. We investigate the physical resources -- time, energy, entropy, and free energy -- required to perform computational work. We apply the resulting measures of physical complexity to conventional electronic computers, to quantum computers, to biological systems, to black holes, and to the universe itself, with implications for artificial intelligence development where biological efficiency limits suggest new computational paradigms beyond current digital architectures.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComputability, Logic, AI Algorithms · Quantum Computing Algorithms and Architecture · Cellular Automata and Applications
