Gap Theorem
Updated 2026-08-05
INTRODUCTION
English translation pending.
CORE DEFINITION
Proved by Boris Trakhtenbrot and independently by Allan Borodin, the gap theorem shows that for any resource measure such as time or space there exist arbitrarily large gaps in which increasing the resource bound does not enlarge the class of functions computable within it. The construction exploits the way resource bounds interact with machine encodings rather than any property of real hardware. The core claim is that resource and capability are not continuously related. The qualification is that the result is asymptotic and does not predict the behavior of practical systems.
SCAFFOLDING EFFECT
Reduce cognitive load
- Use Gain Verification: Check whether added resources actually expanded capability before assuming they did. - Use Step Change Search: Look for the magnitude of increase that crosses a gap rather than incremental top-ups. - Use Gap Awareness: Expect that some expansions produce no new capability at all.
Anchor fast decisions
Computability within a bound depends on whether a machine can complete its work before the limit is reached, and the relationship between the bound and the achievable class is not smooth. There are ranges where every machine that fits the smaller bound also fits the larger one, so the larger budget adds nothing. Capability therefore increases in steps with gaps between them rather than rising continuously with resources.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- zh.wikipedia.orghttps://zh.wikipedia.org/wiki/%E9%96%93%E9%9A%99%E5%AE%9A%E7%90%86verified
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