korrents

korrents · piece

Towards a Theory of Bugs: The Ruliology of the Unexpected

Stephen Wolfram · 21 Jul 2026

Read the piece on writings.stephenwolfram.com ↗

3 korrents from this piece ↓

Stephen Wolfram did not write this page.

Every claim below was made in this piece, quoted word for word and numbered in the order the piece makes them, so you can read it there rather than take our word for it. The sentence above each quote is our reading of the claim, not their wording. Each quote was checked against a stored copy of the page at build time; where the two differ, the quote is the fact.

  1. even programs (or fragments of them) that are very simple in their structure can end up doing computation that is in a sense as sophisticated as anything.
  2. computational irreducibility is not just something that's in principle possible; it's something that (according to the Principle of Computational Equivalence) is at some level ubiquitous-and affects essentially any system whose behavior is not obviously simple.
  3. to make the program worth actually running, there have to be parts of its behavior you can't foresee. But then there's a piece of intuition from the Principle of Computational Equivalence: once there's anything you can't foresee, there tends to be a lot you can't foresee. In other words, the system will tend to be full of computational irreducibility.

Keep reading

The other pieces are the ones whose claims are worded most like this one's. That measures language, not agreement: they may argue the opposite.