Mind · Reasoning
RecursionDive
Vertical traversal of the solution tree
Definition
Mechanism
Execution: the active process of traversing a SolverTree downwards. Accepts a SolverNode, applies Decompose to its task, and either generates child SolverNodes or reports the node atomic.
Postconditions
- Either child SolverNodes exist, or the node is marked atomic
Invariants
None stated.
Risks
Failure modes
Ungoverned descent
the depth bound lives in `DepthGovernor` and `MarginalValueRule`, so an ungoverned dive descends until the substrate stops it.
Fan-in re-expanded
the runtime graph is a DAG, so a shared node is expanded once per parent.
Relationships
Builds on
Composes with
Dividing complexity into manageable units
References
Society
Stateful container for a running solver instance
Society
Active hierarchy of coordinated solver instances
Used by
References
Entropy-based stopping condition for recursion
Deepen only while expected improvement plus an exploration credit, divided by incremental cost, exceeds a domain threshold
Composes with
Expansion of cognitive capability through recursive decomposition of concepts into contract-bounded sub-concepts
Reference