Back Rohan Paul

Rohan Paul· @rohanpaul_ai · X· 2026-10-22 19:34 · Original publication time AI score54

Google DeepMind and Cambridge paper explores AI discovery on the Busy Beaver frontierMachine translation

Automatically verified and published · Generated and evidence-checked automatically; not reviewed by a human.

AI introduction

A description of the paper says a Gemini-based agent found new rules for 11 Busy Beaver Turing machines with no prior documented analysis and verified them in Lean. It says the agent tested edge cases in a simulator, drafted informal proofs, and then proved the rules with the Lean proof checker.

Original post · Original

The article text is unavailable in this language; an existing version is shown.

Rohan Paul@rohanpaul_ai

– https://t.co/QfuYGBMfl7

Title: "At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier"

ReplyRohan Paul@rohanpaul_ai

New Google DeepMind and Cambridge paper shows that an AI agent can discover new math itself, proving exact rules for 11 unsolved Turing machines. AI can move from answering human-posed math questions to open-ended discovery, shown by a Gemini-based agent that found and Lean-verified new rules for 11 Busy Beaver machines with no prior documented analysis. It tested edge cases in a simulator, drafts informal proofs, and then proves the rules in the Lean proof checker.

View this post on X ↗

19:34 · 2026-10-22 · UTC+8

Found an error? Send a correction