aifollow.news
Search
一篇 Google DeepMind 与 Cambridge 的新论文称，基于 Gemini 的智能体为 11 台此前没有已记录分析的 Busy Beaver 图灵机找到了精确规则，并用 Lean 验证。材料描述的流程包括用模拟器测试边界情况、起草证明，再交由 Lean 检查；这些结果针对特定数学问题，不能据此推断智能体能解决一般数学难题。
Coverage of the same occurrence shares a node; subsequent developments have their own nodes.
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.
By original publication time, with each report's bookmarks and feedback preserved.
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.
另有 1 家信源报道Rohan Paul (@rohanpaul_ai) 同一事件，精选展示《Google DeepMind 与 Cambridge 研究展示 AI 智能体发现并验证图灵机规律》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.
另有 1 家信源报道Rohan Paul (@rohanpaul_ai)