Towards a Theory of Bugs: The Ruliology of the Unexpected
Summary
Stephen Wolfram argues that bugs are inevitable, unique phenomena caused by computational irreducibility, which prevents predicting program behavior without running it.
Bugs require external specifications.
A program only possesses a bug when it fails to meet a requirement outside of its own internal logic. Without a specification, a program simply does what it does.
relative to specifications like these that programs can have bugs
Proofs offer no computational shortcut.
Searching for a proof within a multiway graph of theorems requires an unbounded amount of effort, making it comparable to direct execution.
we don’t get any fundamental advantage by trying to make a proof rather than just running the Turing machine
Induction fails in ruliology.
Computational irreducibility allows for unexpected surprises that violate any inferred laws, meaning observed patterns may not persist indefinitely.
there’s always the potential for surprises, and for “bugs” that violate whatever laws we might have inferred
Mathematics avoids ruliological bugs.
Pure mathematics typically focuses on human-level questions that exist within pockets of computational reducibility, avoiding the generic complexity of ruliology.
Bugs reveal scientific progress.
While engineers view bugs as failures, Wolfram suggests that in a scientific context, discovering an unexpected bug is a success that reveals new information.
if we’re doing science, we might consider it a success
Read the original ↗Save to your Sponge
Summarized with Sponge. Quotes are the author’s own words.