Institute Output
Quantum Gravity and Computation: Information, Pregeometry, and Digital Physics
Dean Rickles, Xerxes D. Arsiwalla, Hatem Elshatlawy
This volume argues that concepts from the theory of computation—including information theory, formal languages, and discrete structures—might provide novel paths towards a solution to the problem of quantum gravity. By combining elements of physics with computer science and mathematics, the volume proposes to transform the foundations of spacetime physics and bring it into the digital age.
Kolmogorov Complexity vs. Computational Irreducibility: Understanding the Distinction
James K. Wiles
Kolmogorov complexity and computational irreducibility describe two kinds of limits on simplification, but they apply in different ways. Kolmogorov complexity measures the shortest possible description of an object, such as a string. Computational irreducibility refers to processes that cannot be predicted or accelerated. This paper introduces each concept, explains their theoretical distinction, and illustrates the difference using simple examples.