原帖引用 · 原文
该语言的正文暂不可用，当前显示已有版本。
Rohan Paul@rohanpaul_ai
Title: "At the Limits of Computability: Steps Towards Autonomous AI Discovery on the Busy Beaver Frontier"
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.
在 X 查看这条帖子 ↗
· UTC+8