Why compute what you already know? Dev unpacks Wolfram's computational irreducibility

ctjlewis · x · 2026-10-06

Responding to confusion over a Stephen Wolfram post, developer ctjlewis explains computational irreducibility with an analogy: if you already know AB, running a large irreducible computation to get it is wasted work. The point applies only to computations where each step must actually be executed to reach the result.

Original post →

More from Research

Research channel →