Tesler's law (law of conservation of complexity)
Source status: Source not yet verified by the archive.
Every application has an irreducible amount of complexity.
Source status: Source not yet verified by the archive.
Every application has an irreducible amount of complexity.
This law belongs with Murphy's Laws, where small assumptions, timing, and system complexity tend to turn into memorable failures.
Keep exploring laws from this topic or browse the full archive for neighboring ideas.
Know the original source, a better attribution, or a duplicate we should merge? Report an issue.