Self-improving systems

Type: kb/types/tag-readme.md

Selective head: the membership definition, the update architectures, and the four-part pathway profile, with the load-bearing note per claim. Full tag membership comes from the by-tag sweep (kb/reference/navigation.md).

Membership

A self-improving system makes operative, evidence-responsive changes to its own behavior-determining organization. Read every attribution against a declared frame of boundary, horizon, and objective: including maintainers can make a development system a human-inclusive member, and self-improvement is relative to a declared objective — indexed in the attribution, antecedent in the pathway. When the objective itself changes, the change is improvement only against a level outside it. Below the objective sits the target level, where a structural property is pursued because it is held to serve the objective and is checked for achievement rather than for warrant — the profile dimensions below are read that way whenever they are treated as goals. Membership settles only the category.

Update architecture

Evidence may directly determine an update that is always adopted, as gradients and viability triggers do, or flow through the proposal-selection subtype, where search, reject-capable evaluation, and operative retention let a candidate be rejected first — and where false-positive acceptance becomes operative. A pathway may compose both.

Pathway profile

After membership and update architecture, profile the pathway across four parts rather than placing it on a ladder. The profile is descriptive and selects no order by itself; any comparison between pathways is indexed to a declared objective.

• Reflective structure — coverage of represented aspects and forms, plus the separate addressability profile over retained commitments.
• Improvement dynamics — cumulativity: later dependence through the retained result; accumulation versus compounding, with compounding tested in later improvement.
• Governance — what the methodology settles, and which of those decisions are warranted.
• Actor allocation — human, computational, or joint per function; allocation carries the comparison, and computational closure is its no-human endpoint, not a grade of reflectivity.

The four do not determine, subsume, or form a monotone progression through one another: each property's note states the entailments it does not license, and the placements below show which combinations actually occur. That is non-entailment, not full independence — coverage is structurally required for some addressability operations, and explicit criteria are what carry a decision to a computational actor.

What reflection adds

A self-improving pathway is reflective when it routes objective-bearing evidence into a change to the system's behavior-determining organization through a causally connected self-representation; later operation must depend on that change. This causal structure permits direct updates, proposal selection, and compositions of both. Authority family — evidence, advice, instruction, enforcement — does not decide reflection.

• Reflection buys addressability — retention later rounds can read, criticize, and selectively revise.
• Repeatable operative revision — complete addressability covers governing machinery; continuity keeps its revision path usable.
• Reflection makes retained lessons second-order — an addressable lesson can reject or rescope a represented prior commitment.
• Retrieval misses are path-local — a lesson cannot shape a task that does not surface it.
• Payoff hypotheses, still open: sample efficiency from learning by theory refinement, and faithfulness in revision guided by rationale.

Governance and computational allocation

• Methodological and computational closure track different changes — settled method can be human-executed; an unattended model can improvise.
• Computationally directed self-improvement is a fixed-boundary reallocation ending in contraction — the transition worth studying is intra-category, and its endpoint is whether the boundary can be contracted to exclude the humans.
• Increasing computational autonomy relocates human effort to the frontier — measure improvements per human judgment, not hours.
• Only explicit retention is durable, writable, and addressable — no tacit channel carries settled methodology.

Placements

Evidence: Commonplace paths show broad addressability; completeness remains open. Six external paths map supplied machinery; thirteen cases map profile combinations. Payoff remains untested.

Base vocabulary and boundary cases

• Behavior-determining organization, operative change, evidence bearing on an improvement objective — the definition's three base terms. All three rest on behavioral authority: consumer, channel, force.
• The definition classifies its boundary cases without ad hoc exceptions — ten cases, from gradient learning to accidental self-modification.
• Measuring autonomy well enough to see it improve is an open problem — a per-function profile locates a system but cannot yet show it becoming more autonomous.

Related Tags

• foundations — the broader core theory this sits inside
• constraining — methodological closure tracks retained settlement of consequential choices in a governed pathway
• computational-model — reflection and intercession as computational concepts generalized to socio-technical boundaries

Other tagged notes

• A benchmark that holds the client fixed exports the least-warrantable decisions by design - A fixed-client benchmark measures worker capability; it leaves broader closure untested when the client supplies internal production decisions, while ordinary user requirements and acceptance may remain external
• A better-factory claim compares operative states under an antecedent assessment relation - The improvement claim's relata are predecessor and operative-successor states and its relation is declared before the development it judges; evaluator location is a separate declaration from the learner boundary
• A claim without external assessment carries three obligations - Without external assessment a claim needs its own contradiction-and-support rule, comparison level for objective change, and attribution when it asserts a cause or lacks an independent outcome level; investigating a failure crosses no boundary
• A consumption channel delivers force without the history that earned it - A consumption path can promote content into a higher-force role without checking whether an authorization covers that content, version, and use
• A failure explanation becomes search control only when it changes a later branch decision - An explanation of a failed branch becomes operative search control only when its retention changes a later choice about scope, priority, probing, continuation, or abandonment
• A fixed-model house must retain missing procedures for theory use - With models pinned, newly acquired theory-use procedures must persist outside their parameters; existing general machinery may already supply them, while code can make specified steps cheaper and more reliable
• A method's ceiling bounds the method, not the transfer it already made - Separates envelope expansion, where a responsibility leaves the residual human work, from performance gains inside a fixed envelope, so a bounded method reaching its ceiling does not retract the transfer it already made
• A retained-theory intervention isolates one surface, not the whole program theory - An intervention on retained theory estimates that surface's causal contribution under matched conditions; influence, explanatory guidance, acquisition, and whole-system theory possession remain different claims
• A search controller is tested by what it brings to stronger evaluation - A search controller should be evaluated by the branches and probes it routes into stronger evaluation, not by treating every provisional judgment as an acceptance claim
• A theory's prototype standing is its revision cost: external binding plus lost investment - A theory's prototype standing is its expected revision cost — external binding plus the investment a revision discards — so natural-language versus symbolic form determines neither component and acceptance status is a separate axis
• An addressable theory can coordinate heterogeneous factory development - Tentative natural-language project theory may provide an addressable way to coordinate heterogeneous factory development while search, testing, and backtracking construct and revise it
• An agentic substrate becomes a software factory through family-specific production machinery - Maps the bounded-call agentic substrate to Greenfield's software-factory ontology without calling every generic harness or generated program a factory
• An omitted improvement-loop function and a frozen one need different repairs - Five proposal-selection systems expose frozen functions, while a direct-update contrast shows why absence of a gate is not omission; HyperAgents supplies a preliminary partial unfreezing
• An open-domain theory builder becomes a software house when new domains require production-machinery changes - A persistent automated theory builder for external users becomes a software house when genuinely new domains require it to revise the software that performs theory production rather than only the theories produced
• Autonomous theory builder - Definition — an autonomous theory builder performs every internal theory-building role computationally within a declared boundary; users still supply tasks and acceptance, and autonomy settles neither reliability nor objective governance
• Backtracking keeps lightweight search control provisional - Backtracking preserves the provisional status of a heuristic branch choice by restoring an earlier usable state and redirecting search after contrary evidence
• Broad software demands create pressure for agentic factory development - Broad software demands make exhaustive predefinition of useful family-specific production machinery practically implausible, motivating agentic factory development without ruling out a fixed universal substrate in principle
• Causal and proof obligations are two formal routes to assessing explanatory-reach - Causal and proof obligations demonstrate two ways formal symbolic systems can assess explanatory-reach inside a warranted model
• Citing retained theory at the decision point is a mediation trace - A decision record that cites the theory it followed supplies cheap, checkable evidence that the theory was consumed — necessary for a record-based mediation claim, but short of showing correct or load-bearing use
• Commonplace as a reflective self-improving system - Commonplace witnesses that a human-inclusive KB can be reflectively self-improving on one pathway despite uneven coverage and human-gated design judgment
• Cost-sensitive formalisms for tentative theory search - Exploratory map of backtracking, learning, and complexity models that expose budgets relevant to search guided by tentative theories
• Disconnected witnesses do not establish a full causal path through theory - Theory use, outcome, theory revision, and later use establish learning by theory refinement only when their witnesses identify the joins of the same full causal path
• Distinct residue classes require distinct functions in a self-improving architecture - Different reasons for an untransferred decision identify different missing functions; a single process can supply several, and the current carrier split is not a permanent requirement
• Externally tested theory builder - Definition — an externally tested theory builder gets an external falsifier, an external objective, and an evaluator-independent outcome level from its evidence interface, so outcomes compare without settling internal warrant
• Factory construction is not evidence of production-knowledge acquisition - Recursive software-factory construction is prior art, but the demonstrated constructors receive the family definitions, metamodels, mappings, and expertise that determine the produced factory
• Factory development - Definition — factory development constructs or revises reusable family-level production machinery rather than one product's lifecycle state
• Factory learning is experience-responsive retention that improves the factory - Experience-responsive retention: production experience determines a retained change to reusable family machinery that later production depends on; factory-level learning is retention that improves the factory relative to a declared objective
• Factory-learning mechanisms should be compared on the same causal job - Compares factory-learning mechanisms on their shared causal job — experience-responsive retention — while separating update mechanisms from the project-theory function needed for open-ended coherent modification
• Gödel machines are a proof-governed case of reflective self-modification - A Gödel machine admits self-rewrites through proof under its current formalization; this restricts admission without establishing how many useful changes are reachable or how reliably they are found
• Holding a program theory means sustaining coherent search under delayed feedback - Holding a program's theory is tested by whether a partial, tentative account of what the program is for keeps modification search, backtracking, and recovery coherent until delayed evidence arrives, not by whether the first change is right
• Improvements outside the admitted formal language need a pre-formal stage somewhere - An improvement whose concepts have no expression in a loop's admitted formal language is reached only through a pre-formal stage, inside the loop or fixed at design time in the choice of language; translation relocates that stage
• Learning by theory refinement - Definition — learning by theory refinement is the recurrent loop in which a retained addressable theory guides decisions, outcomes refine it, and the refined theory guides later work; the paradigm, distinct from the single refinement operation
• Lightweight search control allocates further search without licensing adoption - A search judgment is lightweight when its authority stops at allocating further investigation, probing, continuation, suspension, or abandonment rather than licensing an operative change
• Machinery persists by warrant, not position, in a reflective loop - Reflection makes selected production machinery challengeable, but placement alone neither warrants nor requires revision; fixed general machinery may persist when its role and scope are earned
• Moving the interpretation–enforcement boundary requires cross-form coverage - Moving responsibility between model-interpreted rules and formal enforcement crosses natural-language and symbolic forms, so governing the transfer requires coverage of both and their mapping
• Natural-language project state may specialize weight-resident search heuristics - The natural-language part of project state may specialize general search heuristics already represented in an LLM's weights by supplying current intent, theory, branch history, and constraints
• Open-ended improvement must allocate search before decisive evaluation is available - Open-ended improvement must choose which questions, candidates, experiments, or proof paths to develop before decisive evidence about them is available; even a Gödel machine's proof gate retains this prior search problem
• Open-ended theory learning and factory learning close the same reflective loop - Derives one reflective loop from both open-ended theory learning and software-factory learning, and places the Gödel machine by transition licensing and theory provenance
• Preferential codification concentrates less predictable work at the agent boundary - Explains the negative-selection mechanism by which preferential codification changes the composition of work retained at an agent boundary
• Project-theory possession requires comparing new demands with existing organization - For open-ended modification, project-theory possession includes relating a new demand to existing responsibilities before parallel structure becomes the default; an explicit assimilation branch may counter additive coding-agent patches
• Reach-assessment - Definition — judging whether a commitment's claimed explanatory-reach is genuine across natural-language, symbolic, and distributed-parametric forms
• Reflective theory builder - Definition — a reflective theory builder refines a causally connected theory of its own theory-building machinery; independent of autonomy and extension, evidenced by an episode from external failure to a tested machinery change
• Reflective theory refinement has separate structural, epistemic, and implementation lineages - No single predecessor is closest to reflective theory refinement: runtime self-modeling supplies the self-target, classical theory refinement the mechanism with different fillers, and Workspace Optimization only an implementation analogy
• Software factory - Definition — in the Greenfield lineage, a software factory is a configured family-specific software-production environment
• Software house - Definition — a software house is the complete persistent system responsible for developing and evolving software for external users
• Stale self-description conceals its own staleness - What artifact drift adds when it is reflexive: the process that would detect it consults the artifact that drifted, the trigger has no edit event to hook, and synchronization load scales with autonomy
• Task families and product families classify different things - Task families group obligations or evaluations; software product families group products through declared commonality, variability, and reusable production scope
• The 2026-08-30 Commonplace revision used retained theory to guide computational search - A 2026-08-30 Commonplace revision shows retained project theory guiding computational search while the operator supplied decisive global-fit selection
• Theory builder - Definition — a theory builder is the complete persistent system responsible for developing and revising tentative theories; identified by responsibility and lineage, assessed against a declared boundary, seed, and evidence interface
• Theory building and capacity building make the same kind of fallible commitment - Theory building and capacity building both retain resolutions their evidence does not entail; an explanatory commitment stays answerable to the object it describes while a constructive commitment changes the object, so retraction differs in kind
• Theory refinement - Definition — theory refinement revises an existing addressable tentative theory against empirical cases, seeking improved fit with limited changes; the KB departs from the classical systems in machinery, hence in form, and in subject
• Three 2026 harnesses retain editable rules or weights, not rationale - Prime Agent and Recuris retain editable rules about their own operation with no reported rationale, and Apodex retains weights; missing rationale neither excludes theory refinement nor establishes its transfer limits
• Tool usefulness, computational autonomy, warrant, and system power are separate dimensions - Tool usefulness, computational autonomy, warrant, and system power move independently in a human-agent system, so a progress claim has to say which one moved and autonomy gains do not license power claims
• Universal software factory needs a declared universality axis - Universal software factory is ambiguous unless the universality axis, covered class, supplied inputs, adequacy relation, and resource bounds are declared
• Warranted transfer out of the human cut leaves people the hardest-to-warrant decisions - When a system preferentially transfers decisions whose premises, criteria, and checks are available, the remaining human decisions become harder to warrant per decision; this predicts a residue composition, not structural computational openness
• Weakly discriminated qualities tend to be underselected - Statistical conjecture: under named proposal-selection conditions, unequal oracle discrimination yields unequal enrichment; absolute degradation needs an additional directional mechanism
• World models assess explanatory-reach through action-conditioned prediction - Learned world models can assess explanatory-reach when action-conditioned predictions are tested across the interventions or shifts a commitment claims