Cognitive Scaffold

Preparing your thinking workspace

arrow_back_ios_new
MENTAL MODEL · M3638

Lubarsky's Law of Cybernetic Entomology

Lubarsky's Law of Cybernetic Entomology
SystemsmediumComplexity Science
Included
account_tree

Updated 2026-08-05

Loading revision record…

INTRODUCTION

English translation pending.

CORE DEFINITION

A software engineering maxim, commonly attributed to Bruce Lubarsky and cited in Gerald Weinberg's writing on systems thinking. Its core proposition is that a complex system always contains at least one undetected defect: no amount of testing establishes its absence, only the failure to find one so far. The key constraint is that the law is not an argument against testing but against the target of testing. It implies that effort should be balanced between reducing defects and increasing the system's capacity to detect, contain, and recover from the ones that remain.

SCAFFOLDING EFFECT

psychology

Reduce cognitive load

- Release decision: treat zero defects as unattainable and define the defect level at which shipping is acceptable. - Investment balance: shift some effort from prevention to detection and fast recovery. - Humility check: when everything looks clean, ask what has not been tested rather than concluding the system is sound.

anchor

Anchor fast decisions

Complexity makes the defect count grow with the number of states and interactions, and each fix adds code that can introduce new faults, so the count does not reliably approach zero. Since absence of evidence cannot be established by testing, the rational target becomes bounded exposure rather than perfection. Systems designed for this, with redundancy, monitoring, and fast rollback, convert unavoidable defects from outages into incidents, which changes the cost of being wrong rather than the probability.

MINIMUM ACTION

In progress 0/1

Practice this model in one real situation:

Check to track your progress (stored locally)
Learning progress0%
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more

Source support: Explicit

  • link
    cs.earlham.eduhttps://www.cs.earlham.edu/~skylar/humor/Unix/laws.of.programming.htmZH · Explicit
    verified

RELATED MODELS