aifollow.news Search
Back Rohan Paul
Report a correction 中文 English
Back
Rohan Paul· @rohanpaul_ai · X· · Original publication time AI score68

Google DeepMind and Cambridge study shows an AI agent finding and verifying Turing machine rulesMachine translation

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

AI introduction

A new Google DeepMind and Cambridge paper says a Gemini-based agent found exact rules for 11 Busy Beaver Turing machines with no prior documented analysis and verified them in Lean. The described process tests edge cases in a simulator, drafts proofs and checks them in Lean; the results concern a specific math problem and do not establish that the agent can solve math problems in general.

Original post · Original

Rohan 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.

· UTC+8

来源：Rohan Paul · x.com

Research
Found an error? Send a correction