Backtracking keeps lightweight search control provisional

Type: kb/types/note.md · Tags: foundations, computational-model, self-improving-systems

A branch chosen by lightweight search control may be wrong. Backtracking keeps that choice provisional when the process can preserve an earlier usable state, recognize evidence against the current branch, return to that state, and redirect search.

Without an operative return path, a trial can become a de facto commitment. Later work may depend on it, the prior state may become costly to recover, and a judgment that was meant only to allocate search may acquire the consequences of acceptance.

Backtracking does not show that the original heuristic was good. It also does not recover spent effort or guarantee that contrary evidence will be noticed. Its narrower function is to keep branch selection from becoming final merely because the branch was tried.

Scope

  • Backtracking may restore an artifact, a plan, a theory state, or another search position; it is not limited to reverting code.
  • A reversible branch can still cause irreversible external effects. The claim applies only to the state the process can actually restore.

Relevant Notes: