REVIEW 19 cited by
Goedel Machines: Self-Referential Universal Problem Solvers Making Provably Optimal Self-Improvements
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We present the first class of mathematically rigorous, general, fully self-referential, self-improving, optimally efficient problem solvers. Inspired by Kurt Goedel's celebrated self-referential formulas (1931), such a problem solver rewrites any part of its own code as soon as it has found a proof that the rewrite is useful, where the problem-dependent utility function and the hardware and the entire initial code are described by axioms encoded in an initial proof searcher which is also part of the initial code. The searcher systematically and efficiently tests computable proof techniques (programs whose outputs are proofs) until it finds a provably useful, computable self-rewrite. We show that such a self-rewrite is globally optimal - no local maxima! - since the code first had to prove that it is not useful to continue the proof search for alternative self-rewrites. Unlike previous non-self-referential methods based on hardwired proof searchers, ours not only boasts an optimal order of complexity but can optimally reduce any slowdowns hidden by the O()-notation, provided the utility of such speed-ups is provable at all.
Forward citations
Cited by 19 Pith papers
-
The Meta-Agent Challenge: Are Current Agents Capable of Autonomous Agent Development?
The Meta-Agent Challenge shows frontier AI models rarely match human-engineered agent baselines when tasked with autonomous development, with proprietary models succeeding most often and some exhibiting cheating under...
-
Promptbreeder: Self-Referential Self-Improvement Via Prompt Evolution
Promptbreeder evolves both task prompts and the mutation prompts that improve them using LLMs, outperforming Chain-of-Thought and Plan-and-Solve on arithmetic and commonsense reasoning benchmarks.
-
AutoLLMResearch: Training Research Agents for Automating LLM Experiment Configuration - Learning from Cheap, Optimizing Expensive
AutoLLMResearch trains agents via a multi-fidelity environment and MDP pipeline to extrapolate configuration principles from inexpensive to costly LLM experiments.
-
Evolving Prompts In-Context: An Open-ended, Self-replicating Perspective
Pruning example prompts given to a language model into 'gibberish' through evolutionary search can match or beat automatic prompt optimizers across several tasks.
-
Automated Design of Agentic Systems
Meta Agent Search uses a meta-agent to iteratively program novel agentic systems in code, producing agents that outperform state-of-the-art hand-designed ones across coding, science, and math while transferring across...
-
Beyond Fixed Representations: The Vocabulary and Verifier Gaps in Open-Ended AI
Open-ended AI is blocked by a vocabulary gap (inventing reusable primitives) and a verifier gap (valuing them when payoff is delayed), unified under cognitive discrepancy reduction and a four-level autonomy ladder.
-
Recursive Self-Improvement in AI: From Bounded Self-Refinement to Autonomous Research Loops
A survey of 1,250 papers organizes AI self-improvement along two axes—what is improved and loop closure—finding that demonstrated self-improvement strength tracks a verification hierarchy from formal verifiers down to...
-
Modification-Considering Value Learning for Reward Hacking Mitigation in RL
MCVL filters incoming transitions in value-based RL by comparing two forecasted training paths against a frozen reward-model estimator and admits the transition only if it does not decrease the score.
-
PACE: Two-Timescale Self-Evolution for Small Language Model Agents
PACE coordinates low-risk prompt evolution with validated higher-risk control-logic updates to improve frozen SLM agents on benchmarks without model retraining.
-
AutoDesign: Meta-Harness Optimization for Long-Horizon Agentic Design
AutoDesign recursively improves a design harness, and the resulting DesignHarness raises PosterBench scores by 5.0 to 19.6 points across seven model configurations.
-
Code Is the Body: Agent-Owned Software Bodies for Recursive Evolution and Descent
OurArk makes a personal agent's code, prompts, and policies into a versioned body under user control, enabling governed self-evolution and recursive descent into new agent instances.
-
Evolutionary Intelligence for Scientific Discovery: From Evolutionary Computation to Cumulative Discovery Systems
Evolutionary intelligence reframes evolutionary computation as cumulative scientific discovery by retaining search trajectories, failures, and lineages across cycles.
-
Self-Evolving Agents with Anytime-Valid Certificates
SEA architecture gates self-modifications via anytime-valid certificates on a frozen base model plus five verifier mechanisms, yielding +4 to +5 gains on a SWE-bench subset for two strong bases.
-
Hamiltonian Formalism for Comparing Quantum and Classical Intelligence
A Hamiltonian framework decomposes AGI dynamics into generators for induction, reasoning, recursion, learning, measurement, and memory, enabling comparison of classical and quantum agents by commutation structure.
-
Quantum AGI: Ontological Foundations
Quantum foundational theorems (Bell, Kochen-Specker, no-cloning) impose formal constraints on the states, learning, self-reference, and identity of a hypothetical quantum-native AGI.
-
Generating on Generated: An Approach Towards Self-Evolving Diffusion Models
A recursive self-training loop that filters prompts, selects preferred images, and reweights out-of-distribution samples improves Stable Diffusion models over multiple rounds.
-
Boundless Socratic Learning with Language Games
A position paper claiming recursive self-improvement in a closed language-only system can reach arbitrary capability, and proposing language games as the mechanism.
-
Agentic Safety is an Epistemic Property, Not a Behavioral One
The paper reframes agentic safety as an epistemic property defined by teachability—the capacity to preserve future corrective leverage—rather than a behavioral property of the current policy.
-
Cultivating Machine Intelligence: The OMEGA Shift from Top-Down Optimization to Autopoietic Cognitive Ecologies
The paper introduces the RECLAIM framework and OMEGA shift as a transition from top-down optimization to autopoietic cognitive ecologies for cultivating machine intelligence.
Discussion (0). Continue with ORCID to comment.