np hard
2026 United States meta
22

The Thesis

Software maintenance is at least NP-hard. AI helps the easy parts. Safety-critical software is the existence proof. The bill is coming due.

This book argues a single load-bearing claim: software maintenance is at least NP-hard, and several of its core subproblems are formally undecidable. The argument has three layers. First, the deepest maintenance questions — does this refactor preserve behavior, are these two versions equivalent — are undecidable by Rice's theorem, descending from Turing's halting result. Second, the practical maintenance subproblems are NP-hard or NP-complete: register allocation, test suite minimization, module clustering, package dependency resolution, refactoring optimization, type inference for rich systems. Third, the meta-problem inherits the hardness of its hardest subproblem. AI is a heuristic. Heuristics do not change problem complexity. They change which instances are handled well in practice. AI handles the local instances; the global ones it degrades. The empirical evidence — Stanford CCS, GitClear, DORA, METR — is what that mismatch looks like at scale. Safety-critical software is the existence proof that the trap can be escaped, at the cost of two to three orders of magnitude more effort per line of code. The industry has refused to pay that cost. The bill is coming due.

Specification: Gauger, A. (2026). NP-Hard — Thesis. Foundation references: Turing 1936, Rice 1953, Cook 1971, Karp 1972, Lehman 1980, Brooks 1986, Klein et al. 2009, METR 2025. Source →