Chapter 12: The Principle of Computational Equivalence

Section 8: Undecidability and Intractability

Algorithmic complexity theory

Ordinary computational complexity theory asks about the resources needed to run programs that perform a given computation. But algorithmic complexity theory (compare page 1067) asks instead about how large the programs themselves need to be. The results of this book indicate however that even programs that are very small—and thus have low algorithmic complexity—can nevertheless perform all sorts of complex computations.

Image Source Notebooks:

From Stephen Wolfram: A New Kind of Science [citation]