Mind · Reasoning
Decompose
Dividing complexity into manageable units
Definition
Mechanism
Strategy: The cognitive act of splitting a Task into independent subordinate parts. Criterion: solving each constituent Problem in isolation must yield Solution to the whole. If subproblems interact, the split is wrong—try a different decomposition axis. Recurse until subproblems are trivial.
Preconditions
- Problem too large to solve directly.
- Decomposition axis identifiable.
Postconditions
- Set of subproblems, each satisfying the declared independence criterion.
- Combined Solution equals original.
Invariants
- States the independence criterion it claims, and the split satisfies the criterion it declared.
Risks
Failure modes
Coupling Leakage
Subproblems are not truly independent; solving one breaks another.
Relationships
Builds on
Accepts
Infrastructure
The atomic unit of intent
Used by
References
Structural limit on parallel execution (Fan-out)
Finding what a concept is made of: locate it, carve it into the dimensions every case it claims needs, test each, search for what is missing, route real cases through it, say how the parts make the whole, and carve again below
Entropy-based stopping condition for recursion
Explain by first laying out the complexity a quick account would blur, then building a simpler account that keeps it
Solve subproblems from easiest to hardest sequentially
Test a candidate carve by routing a few concrete tasks through it before it is kept
Lock requirements to prevent scope creep
Infrastructure
Deterministic partitioning of state
Parallel outline expansion (Macro for Think(Skeleton))
Breaking a concept into solver-contract-bound sub-concepts — the move that enables fractal recursion
Combining elements
Composes with
Estimation via decomposition
Deeply optimizing a solution across PURE dimensions
Vertical traversal of the solution tree
Reference