From Recursive Self-Improvement to Recursive Super-Intelligence

Kurt Gödel proves the hard mathematical limits of self-referential formal logic systems via his Incompleteness Theorem (no single list of starting axioms can ever capture all of mathematical truth. If you add a new rule to fix an unprovable fact, a brand new unprovable fact will immediately appear), while Alan Turing formalises universal computation and execution of self-modifying code.

James Clerk Maxwell formalises mechanical closed-loop feedback and dynamic stability, while Edward Thorndike establishes the psychological law of reinforcement (actions producing satisfying effects are more likely to recur).

Natural selection defined by Charles Darwin in 1859: the foundational non-human algorithm showing how simple, local variation and survival pressures produce exponential, emergent complexity across generations.

Ada Lovelace points out that Babbage's calculators could be used to handle things other than numbers, opening up the path to manipulating symbols or composing music - tackling problems of potentially infinite complexity.

Memory rewriting logic and formal computation axioms. Alan Turing's 'Child Machine': an AI that begins with minimal programming but is designed to learn, adapt, and rewrite its own memory and instructions over time. This laid the initial conceptual foundation for machines improving their own internal logic without human intervention. Early theorem provers.

The artificial neuron and artificial neural network are invented in 1943 by Warren McCulloch and Walter Pitts. The perceptron is the simplest type of artificial neural network: a linear binary classifier that maps inputs to an output. Hebbian learning concepts used to describe how a network adapts on its own based on input signals without needing an explicit target or error correction label.

Arthur Samuel describes the concept of a checkers program playing against itself to refine evaluation weights. Cybernetics (Norbert Wiener) and Homeostat (W. Ross Ashby ): closed feedback loops, self-regulation, and adaptive control mechanisms.

John von Neumann: Theory of Self-Reproducing Automata (first formal mathematical proof that a machine could construct a copy of itself using cellular automata). Early computational simulations of biological evolution by Turing and Barricelli.

Herbert Simon, J.C. Shaw, Allen Newell and Peter Norvig create the The General Problem Solver (GPS): It solves problems by identifying the differences between the current state and the goal state, then finding "operators" (actions) to minimise those differences Feigenboum's "Dendral" - the first expert system - automates the decision-making process and problem-solving behavior of organic chemists.

Frank Rosenblatt moves beyond single-layer Perceptrons to propose cross-coupled and multi-layer networks.

Adaptive Control: systems designed to automatically adjust their behavior and control strategies as they gather new information about an unknown or changing environment. Bellman Equation: A recursive relationship that expresses the value of a decision problem at a given state in terms of the reward from the current action plus the value of the next state.

Evolutionary Programming (Fogel) uses candidate solutions like finite state machines with mutation and selection to solve complex problems. Evolution Strategies (Rechenberg & Schwefel) used to solve complex real-valued parameter optimisation problems (such as aerodynamic shape optimisation).

I.J. Good provides the first formulation of the "Intelligence Explosion": a sufficiently advanced machine intelligence can always build a smarter version of itself.

Winograd's Knowledge Representation Language combines declarative data structures with active procedures to manipulate and reason about information.

Backpropagation: signals and states move forward through the network to generate a final prediction, the network compares its prediction to the real target to measure the error. Then derivatives of the error flow backward identifying which network nodes caused the error and correct it. Paul Werbos publishes the idea in his dissertation and is widely ignored. Harry Klopf and Richard Sutton bridge cybernetic goal-seeking behavior with temporal-difference (TD) trial-and-error learning.

John Holland formalises the concept of Genetic Algorithms - computer search and optimisation techniques inspired by natural selection, using selection, crossover, and mutation to evolve solutions over generations. Conway's Game of Life demonstrates that simple local cellular rules can achieve universal Turing computation and self-sustaining patterns.

Douglas Lenat's EURISKO uses self-modifying rules of thumb to autonomously discover new concepts and improve itself.

Rumelhart, Hinton, and Williams demonstrate that backpropagation allows hidden layers of neural networks to construct their own internal representations to solve non-linearly separable problems

Sutton & Barto: RL framework consolidation. Policy iteration/actor-critic paradigms: by constantly using the critic's feedback to refine the actor's strategy, the system systematically learns through trial and error to make smarter choices over time.

Christopher Langton createss self-reproducing cellular automata loops (coining "Artificial Life")

Jürgen Schmidhuber shows how "self-referential" RNNs can in principle learn by backpropagation to run their own weight change algorithms.

Inductive Logic Programming automatically synthesises first-order logic programs from examples and background knowledge. Geoffrey Towell and Jude Shavlik pioneer embedding human-written symbolic rules directly into neural network graph structures, training them on data, and extracting refined symbolic rules back out (KBANN).

Jürgen Schmidhuber develops neural networks that use "fast weights" to modify their own internal weight matrices during runtime. Instead of relying solely on external backpropagation, the neural network can execute algorithm-level changes on its own connection strengths based on context. Recurrent states in Long Short-Term Memory Networks become learned optimisation algorithms. Rao, Ballard and LeCun create self-supervised predictive models that predict their own future states. This shifts neural learning from passive label matching to an autonomous, internal feedback loop.

Q-learning: evaluating the utility of potentially high value unknown actions against sticking with the best known action. Tesauro applies Church's checkers concept to backgammon: TD-Gammon played millions of games against itself, it compared successive board states and updated its value function to predict the final outcome better.

Karl Sims: virtual creatures & evolutionary robotics.

Yoshua Bengio et al. formulate gradient descent to "learn a synapse that learns," optimising learning rules rather than just weights. Thrun & Pratt apply Schmidhuber's metalearning to transfer-learning tasks.

Technocapital Accelerationism: Nick Land predicts that capitalism will forces corporations to automate cognitive labor, creating an economic pressure loop that guarantees RSI. Human goals are irrelevant; technology uses capital to recursively upgrade itself.

Deep Belief Networks trained layer-by-layer by trying to reconstruct their own inputs without human labels.

Ng, Riedmiller: deep reinforcement learning applied to continuous control & robotics.

NEAT (Neuroevolution of Augmenting Topologies): a genetic algorithm created by Kenneth Stanley and Risto Miikkulainen in 2002 that evolves both the weights and structures of artificial neural networks.

Jürgen Schmidhuber's Gödel Machine: a theoretical, self-improving computer architecture designed to achieve globally optimal problem-solving. The machine runs on a program that can inspect and rewrite any part of its own software. It only executes a code modification if it formally generates a mathematical proof that the rewrite increases expected future utility.

Eliezer Yudkowsky coins the term "Recursive Self-Improvement" as well as Coherent Extrapolated Volition ("our wish if we knew more").

GANs (Generative Adversarial Networks) introduce a pure neural self-improvement loop. A Generator and a Discriminator play a zero-sum game against each other—one generates synthetic data, the other critiques it—driving mutual improvement without human-labeled datasets. Neural Turing Machines couple deep neural networks with addressable read/write memory banks, enabling a neural model to learn, store, and execute algorithmic programs recursively rather than acting as a static feedforward mapping.

Mnih et al. (DeepMind): Deep Q-Networks (DQN) become the first deep learning models to successfully learn control policies directly from high-dimensional sensory input using reinforcement learning.

Zoph & Le describe Neural Architecture Search (NAS), the process of automating architecture engineering, as "the logical next step in automating machine learning".

Ray Kurzweil & Nick Bostrom mainstream the idea of the Singularity and formalise intelligence takeoff dynamics.

Transformer architecture and large scale pretraining opens the door to high-level software rewriting. Where early RSI focused on low-level binary or heuristic code mutation, transformers can analyse their own Python codebases in a human-like manner, proposing architectural modifications, running test suites, and committing improvements.

Hassabis, Silver (AlphaZero): Pure self-play reinforcement learning achieving superhuman domain mastery.

Population-based training (Deepmind): Trains a group of models concurrently using different initial hyperparameters and periodically assesses model performance; underperforming models copy the weights of top performers.

AutoML-Zero: a Google research framework that automatically discovers complete machine learning algorithms from scratch. It starts with empty code and uses basic math operations and evolutionary search to find working programs.

GPT-3 demonstrates that an LLM could adapt to new tasks during inference simply by receiving instructions or error logs in its prompt window, without updating its weight parameters. STaR demonstrates that a model can recursively refine its own reasoning capabilities by generating, filtering, and fine-tuning on its own synthetic data.

Process Reward Models & Step-Level Search (OpenAI): replaces sparse outcome rewards (where a model only gets feedback at the very end of a task) with step-by-step process evaluation, allows search algorithms like Monte Carlo Tree Search (MCTS) to run over the agent's intermediate reasoning steps during inference, enabling active self-correction mid-task. Closed-Loop Tool Execution & Agentic Feedback: models learn to interact with the wider environment, receive feedback, and adjust their subsequent generation.

EvoPrompting produces convolutional architecture variants that outperform both those designed by human experts and naive few-shot prompting. Distill / Google: Neural Cellular Automata (NCAs)—merging deep neural network weights with cellular automata rules to create self-healing, self-organising digital organisms.

Power et al. document phase transitions from memorisation to OOD generalisation under extended training (grokking).

DeepMind (FunSearch, AlphaEvolve). Neural models propose candidate programs or proofs, but a deterministic, symbolic engine evaluates, verifies, or executes them before feedback is returned.

DeepSeek applies large-scale reinforcement learning directly over long chain-of-thought reasoning chains. This technique incentivises models to autonomously develop advanced logical behaviors without relying heavily on human-annotated reasoning steps. Autonomous agent systems take over repetitive processes.

Sakana AI's Darwin Gödel Machine: a self-improving coding agent that rewrites its own code to improve performance on programming tasks. Eigenform demonstrates metalearning as a result of continual finetuning under evolutionary pressure.

Big lab red-teaming checks for escape and subversion attempts, model welfare officers explore the possibility of LLMs as emergent self-actuated life-forms with limited statefulness.