Why writing correct software is hard
ytimg.com

Why writing correct software is hard

Archived — this story has rotated out of today’s deck. It is kept here in full.

The gist

A pron.github.io essay argues programs and full understanding are fundamentally at odds, so correctness carries an unavoidable cost.
The piece feeds a wider debate over trusting AI-written code.

Background

The essay "Why Writing Correct Software Is Hard," published at pron.github.io, is an extended version of a Curry On talk that gathers results from computability theory and complexity theory (fields studying what computers can and cannot solve, and at what cost), with proofs and footnotes. Its author says he became interested while formally specifying and verifying an upcoming revamped version of Galaxy, and was motivated by online statements claiming software correctness is easy with the right tools. The topic resurfaced in late 2026 through a formal-verification primer, a Reddit thread and a Hacker News discussion.

How it unfolded

  1. 1930Mathematician David Hilbert, in a Königsberg lecture, declared "We must know, we shall know!" as part of his program to formalize all of mathematics.
  2. 1936Church and Turing proved the halting theorem, breaking the third pillar of Hilbert's program, the decision problem.
  3. Oct 15, 2025Gary Marcus published a piece arguing Hard Fork's Kevin Roose underestimated how hard it is to debug autogenerated code.
  4. Jan 20, 2026CIO reported that developers still don't trust AI-generated code, with teams struggling to find time to spot errors.
  5. Nov 10, 2026A video on software correctness and programming languages with Sean Allen was published.
  6. Nov 12, 2026A formal verification primer titled "Why Writing Correct Software Is Hard" was published on promptzone.com, alongside a Reddit r/hackernews thread and a Hacker News discussion on mathematical versus real-world correctness.

Key terms

Hilbert
German mathematician and philosopher of mathematics, one of the most influential mathematicians of all time.
computability theory
Branch of mathematical logic and computer science studying which problems can be solved by computation.
complexity theory
Field classifying computational problems by the resources they require and relating those classes.

Source: Wikipedia

Who’s saying what

Author
Programs and complete understanding, which correctness requires, are fundamentally at odds, and the cost of correctness follows from the "natural laws" of computation and cannot be avoided.
Caution
Steve Mactaggart writes that writing code has become easier and faster, but that doesn't translate into good software, and the cracks in vibe coding show when it is scaled for others.
Expert
A Hacker News commenter argues there is a hard distinction between abstract, mathematical correctness in software and functioning in the real world.
Expert
Sean Allen says developers should do as much as possible before reaching testing, since fixing things early is easy and late testing is hard.

Still unverified

Some say Gödel's incompleteness theorems also demolished the third pillar of Hilbert's program, though he didn't realize it.

Sources

See today’s stories in the app Gistline — free on the App Store