The Halting Problem Criterion
Updated 2026-08-05
INTRODUCTION
English translation pending.
CORE DEFINITION
From Alan Turing's proof that the halting problem is undecidable. The practical reading is that when a process shows no sign of terminating, no amount of additional internal computation guarantees a verdict. The criterion applies to open-ended deliberation, not to well-posed problems that have a known decision procedure.
SCAFFOLDING EFFECT
Reduce cognitive load
- Stop-loss circuit: Treat endless weighing as a signal to impose a hard deadline. - Timeout rule: Set a date or an information threshold that forces a decision. - Exit line: Fix the point at which you leave and refuse to renegotiate it.
Anchor fast decisions
Undecidability means the answer is not merely hard to compute but unavailable from inside the process. Continuing to deliberate therefore adds cost without adding information. An externally imposed timeout converts an unanswerable question into a decidable one by making the clock, rather than the reasoning, the arbiter.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Halting_problemverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS