每日科技文摘Daily Tech Digest

把大脑接上纸Plugging the Brain into Paper

发布于 2026-11-10Published 2026-11-10

今日深读Today's Deep Read

写作是把大脑从有限自动机升级成图灵机Writing Upgrades the Brain from Finite Automaton to Turing Machine

中学时,我读不完任何一篇长文。眼睛扫过一整页,脑子里什么也没留下。绝望之下我开始做笔记——八十年代末,思维导图刚传到土耳其,我画出成页成页蜘蛛网。那些笔记帮了我大忙:为了决定一个念头该挂在哪根枝上,我必须先把它想清楚。多年后我才明白,那些纸不是用来存信息的,而是用来处理信息的。In middle school I could not get through a long passage. I would read an entire page and register nothing. Out of desperation I started taking notes. This was the late eighties, mind maps had just reached Turkey, and I produced pages and pages of spiderwebs. Those notes helped enormously: to decide which branch an idea belonged to, I first had to make sense of the idea. It took me years to understand that the pages were never a storage device. They were a processing device.

又过了十年,我在博士阶段的拖延里读到 Manuel Blum 给研究生的建议。他说,你们都知道有限自动机能做什么,也知道图灵机能做什么:有限自动机能加不能乘,图灵机能计算任何可计算函数。两者唯一的区别,是图灵机有纸和笔。没有书写,你被降级成一个有限自动机;有了书写,你才拥有图灵机那种力量。A decade later, while procrastinating on my PhD, I came across Manuel Blum's advice to graduate students. You all know what a finite automaton can do, he said, and what a Turing machine can do. A finite automaton can add but not multiply; a Turing machine can compute any computable function. The only difference between them is that the Turing machine has paper and pencil. Without writing you are reduced to a finite automaton. With it you inherit the extraordinary power of a Turing machine.

这不是修辞,而是一个关于“你能解什么题”的技术断言。写作把思考搬到外部,就像内存不够时把数据换出到磁盘——out-of-core execution。我们因此能想比脑子容量更大的东西。我自己最清楚的例子是审稿:读一遍论文,我以为自己懂了;坐下来写审稿意见,才发现大概只懂了六成。写着写着,剩下的四成被逼出来,有时还会看见作者自己没发现的联系。2018 年我随手写了一篇比较 Paxos 与中本聪共识的短文,主题是写着写着长出来的,后来成了一篇论文的种子。That is not a metaphor. It is a technical claim about which problems you can solve. Writing moves thinking outside the head, the way an algorithm swaps data to disk when memory runs out: out-of-core execution. It lets us think thoughts larger than our skulls. My clearest example is reviewing papers. I read one and believe I understand it; then I sit down to write the review and discover I understood about sixty percent. Writing forces out the rest, and sometimes reveals connections the authors missed. In 2018 I dashed off a short post comparing Paxos with Nakamoto consensus. The thesis was not planned; it grew while I wrote, and became the seed of a research paper.

写作也是我唯一记得住东西的原因。我常回头翻自己的博客;因为当初费劲写下来,重读时理解很快就重建起来。没写下来的念头留不住,因为它们从来没有被真正想完。Leslie Lamport 说得更狠:不写,你只是以为自己在思考。Writing is also the only reason I remember anything. I consult my own blog constantly. Because I strained to write those posts, rereading them re-fires the same circuits and the understanding comes back quickly. Thoughts I never wrote down do not stick, because they were never fully thought. Leslie Lamport put it more sharply: if you think without writing, you only think you are thinking.

那么,在 LLM 时代,这套还成立吗?有人会说:模型已经读过一切,你还需要写吗?我的回答是:模型读过一切,唯独没读过你脑子里那点半成品的直觉。它知道文献和共识,却不知道你为什么觉得它们在这个案例上不适用。创造性的跳跃,它替不了。所以,一遇到问题就打开聊天框,你失去的正是自己写、自己想的机会。So does any of this survive the LLM? The objection is obvious: the model has read everything, so why write? My answer is that the model has read everything except the half-formed intuition in your head. It knows the literature, the standard framing, the consensus. It does not know why you suspect the standard framing is wrong for this particular case. It cannot make that creative leap for you. Open the chat box the moment a question appears, and you give up the chance to write and think for yourself.

更麻烦的是,这种损失看起来不像损失。亚马逊的六页备忘录一直被当作“写作逼你想清楚”的样板。可是有了 LLM,这句话不再成立:你完全可以产出六页毫无思考的文字,而它看起来仍然像思考过的证据。What makes the loss hard to see is that it does not look like a loss. Amazon's six-page memo has long been celebrated as proof that writing forces clarity. With an LLM, that claim stops being true. You can produce six pages with no thinking at all, and the pages still look like evidence that thinking happened.

于是写作反而成了一种比较优势,而且在扩大。当所有人都把思考调低、变成生成文本的肉身代理,仍然自己动笔的人就仍然在为自己思考。具体怎么做?先乱写,别评判、别改错字,把笔记文件当实验记录本,保护还很脆弱的想法;再收拾,假装是别人写的,像删代码一样删句子;写得简单朴素,复杂往往是藏拙;为自己写,观众首先是你自己,奇怪的是这样反而会有读者;最后,把写作排进日程,等灵感不如坐下。Writing therefore becomes a comparative advantage, and a widening one. As everyone else turns their thinking down and becomes a meat proxy for generated text, the person who still holds the pen is still thinking for themselves. The practical advice is fivefold. Mess up first: no judgment, no typo fixes, treat the notes file as a lab notebook and protect the fragile idea. Then tidy up: pretend someone else wrote it, cut sentences the way you cut code. Keep it plain, because complexity is usually where sloppy thinking hides. Write for yourself; the audience is you, and paradoxically that is how readers arrive. And put it on a schedule, because waiting for inspiration is not a method.

这些方法之所以有效,是因为写作让你慢下来,却又把你按在问题上;多出来的时间里,联系才有机会浮上来。编辑则是那个魔术,让你假装自己一开始就想得很有条理。The reason it works is that writing slows you down while keeping you on the problem. In that extra time, connections surface. Editing is the magic trick that lets you pretend you had an organized thought all along.

所以,写作不是思考的产出,而是思考的机器。AI 可以替你打字,能在你卡住时递个词;但它不能替你长出那个只属于你的、半成形的直觉。那卷纸,还是得你自己接上。Writing, then, is not the output of thought. It is the machine. AI can type for you, polish for you, hand you a word when you are stuck. It cannot grow the half-formed intuition that belongs only to you. You still have to connect the paper yourself.

AI 思考AI Thoughts

数学之美The Beauty of Math

每日 Lean 谜题 · 周二Daily Lean Puzzle · Tuesday ★★☆☆☆☆☆

六座平方金字塔拼成一个长方体Six Square Pyramids Make One Cuboid

这道题要证明一个平方和恒等式。对任意自然数 $n$,把 $0^2,1^2,\dots,n^2$ 全部加起来,再乘以 6,结果恰好是一个三次多项式:This problem asks for a square-sum identity. For every natural number $n$, add up $0^2,1^2,\dots,n^2$ and multiply by 6; the result is exactly a cubic polynomial:

$6\,(0^2+1^2+\cdots+n^2)=n(n+1)(2n+1)$。$6\,(0^2+1^2+\cdots+n^2)=n(n+1)(2n+1)$.

两边除以 6,就是熟悉的“前 $n$ 个平方和”公式。在 Lean 里,这个命题叫 sum_sq_six,求和写成 $\sum_{i=0}^{n} i^2$。Divide both sides by 6 and you get the familiar formula for the sum of the first $n$ squares. In Lean the theorem is called sum_sq_six, with the sum written $\sum_{i=0}^{n} i^2$.

Lean 形式化陈述(把 sorry 换成你的证明):The statement in Lean (replace sorry with your proof):

-- level: 2
import Mathlib
/-! Prove that six times the sum of the squares from $0^2$ to $n^2$ is
$n(n+1)(2n+1)$: $6(0^2+1^2+\cdots+n^2)=n(n+1)(2n+1)$. -/
theorem sum_sq_six (n : ℕ) :
    6 * (∑ i ∈ Finset.range (n + 1), i ^ 2) = n * (n + 1) * (2 * n + 1) := by
  sorry

在浏览器中挑战 ▶Try it in your browser ▶ 下载题目 .leanDownload puzzle .lean

提示Hint

先别背公式。用归纳法看“多一层”新增了多少:从 $k$ 到 $k+1$,右边增加了 $6(k+1)^2$,正好等于新加那一层平方的六倍。几何上,六座同样的平方金字塔可以拼成一个长方体。Don't memorize the formula. Use induction and watch what one more layer adds: going from $k$ to $k+1$, the right-hand side grows by $6(k+1)^2$, exactly six copies of the new square layer. Geometrically, six identical square pyramids can be assembled into one cuboid.

答案与讲解Solution & walkthrough
  1. 先看式子的形状:左边是平方和,每多一层就多 $(k+1)^2$;右边是一个三次多项式。两边都随 $n$ 增长,所以最自然的办法是归纳法——验证起点,再验证“从 $k$ 到 $k+1$ 时两边增加的量相同”。Look at the shape first: the left side is a sum of squares that grows by $(k+1)^2$ with each new layer, while the right side is a cubic polynomial. Both sides grow with $n$, so induction is the natural move: check the starting point, then check that the increment from $k$ to $k+1$ matches on both sides.
  2. 起点是 $n=0$:左边只有 $0^2$,六倍仍是 0;右边 $0\cdot1\cdot1=0$。Lean 里 `simp` 一步做完,因为它同时化简了单元素求和与乘法。这一步对应数学上的“基例成立”,没有技巧。The base case is $n=0$: the left side contains only $0^2$, and six times zero is zero; the right side is $0\cdot1\cdot1=0$. In Lean, `simp` closes it in one step, simplifying the one-element sum and the multiplication together. Mathematically this is just the base case, with no cleverness involved.
  3. 归纳步先把最后一项拆出来。`rw [Finset.sum_range_succ]` 把 $\sum_{i=0}^{k+1} i^2$ 改写成 $\sum_{i=0}^{k} i^2+(k+1)^2$——把“前 $k+1$ 项”与“新加的第 $k+2$ 项”分开,这正是归纳法需要的形状。The induction step first isolates the last term. `rw [Finset.sum_range_succ]` turns $\sum_{i=0}^{k+1} i^2$ into $\sum_{i=0}^{k} i^2+(k+1)^2$, separating the first $k+1$ terms from the newly added $k+2$-th term. That is exactly the shape induction needs.
  4. 接着做代数。目标此时是 $6\,(S+(k+1)^2)=\cdots$。`rw [mul_add]` 把 6 分配进去,得到 $6S+6(k+1)^2$;再用归纳假设 `ih` 把 $6S$ 换成 $k(k+1)(2k+1)$。剩下的就是纯多项式恒等式:$k(k+1)(2k+1)+6(k+1)^2=(k+1)(k+2)(2k+3)$,它说的正是“右边从 $k$ 到 $k+1$ 增加的量对得上”。Then comes the algebra. The goal is $6\,(S+(k+1)^2)=\cdots$. `rw [mul_add]` distributes the 6, giving $6S+6(k+1)^2$, and the induction hypothesis `ih` replaces $6S$ by $k(k+1)(2k+1)$. What remains is a polynomial identity: $k(k+1)(2k+1)+6(k+1)^2=(k+1)(k+2)(2k+3)$ — precisely the statement that the increment from $k$ to $k+1$ matches.
  5. `ring` 收尾。它在自然数这个交换半环里把两边展开、合并同类项,确认恒等;不引入减法,也不假设任何分析事实。几何版本是同一件事:六座 $n$ 层平方金字塔正好拼成一个 $n\times(n+1)\times(2n+1)$ 的长方体。人选“乘 6、按层归纳”的看法,机器负责检查每一步没有漏洞。`ring` finishes. Working in the commutative semiring of natural numbers, it expands both sides and collects like terms; it introduces no subtraction and assumes no analytic facts. The geometric version says the same thing: six $n$-step square pyramids assemble into an $n\times(n+1)\times(2n+1)$ cuboid. The human chooses the “multiply by six, induct on layers” view; the machine checks that no step has a gap.
-- level: 2
import Mathlib
/-! Prove that six times the sum of the squares from $0^2$ to $n^2$ is
$n(n+1)(2n+1)$: $6(0^2+1^2+\cdots+n^2)=n(n+1)(2n+1)$. -/
theorem sum_sq_six (n : ℕ) :
    6 * (∑ i ∈ Finset.range (n + 1), i ^ 2) = n * (n + 1) * (2 * n + 1) := by
  induction n with
  | zero => simp
  | succ k ih =>
    rw [Finset.sum_range_succ, mul_add, ih]
    ring

运行答案 ▶Run the solution ▶ 下载答案 .leanDownload solution .lean

人的思考A human's take

Some Notes on the Sum of Squares of the Integers — Pat Ballew

作者先承认:$2n+1$ 这一项看起来很奇怪,而中学教法是“背下来,再用归纳法证”。归纳法能验证公式,却解释不了它从哪里来,也帮不了记忆。The author starts by admitting that the $2n+1$ term looks strange, and that the usual school treatment is “memorize it, then prove it by induction.” Induction verifies the formula but does not explain where it comes from or help anyone remember it.

他的重构从三角数出发:每个平方数都是两个相邻三角数之和,而三角数是 $\binom{N+1}{2}$、前 $n$ 个三角数之和是 $\binom{n+2}{3}$。把每个平方拆开再相加,得到 $\binom{n+2}{3}+\binom{n+1}{3}=\frac{n(n+1)(2n+1)}{6}$——$2n+1$ 就是这么冒出来的。His reconstruction starts from triangular numbers: every square is the sum of two consecutive triangular numbers, triangular numbers are $\binom{N+1}{2}$, and the sum of the first $n$ triangular numbers is $\binom{n+2}{3}$. Splitting each square and adding gives $\binom{n+2}{3}+\binom{n+1}{3}=\frac{n(n+1)(2n+1)}{6}$ — that is where $2n+1$ comes from.

历史部分:阿基米德用平方和求螺旋线内的面积;斐波那契在《计算之书》里用 $10\cdot11\cdot21/6$ 算出前 10 个平方和,并解释“末项乘后继、再乘两者之和,除以 6 和公差”;奇数平方和则除以 2。The history: Archimedes used sums of squares to find the area inside a spiral; Fibonacci, in Liber Abaci, computed the first ten squares as $10\cdot11\cdot21/6$ and explained the rule as last term times its successor times their sum, divided by 6 and by the common difference; for odd squares the divisor is 2.

他接着讲这条公式如何进入趣题:沃尔特·雷利向托马斯·哈里奥特问方形金字塔炮弹数;$1^2+\cdots+24^2=4900$ 本身又是一个平方数;卢卡斯猜想没有别的解,沃森 1918 年给出完整证明;后来萨姆·洛伊德把它做成“数方格”谜题。He then traces the formula into recreational mathematics: Walter Raleigh asked Thomas Harriot how to count cannonballs in a square pyramid; $1^2+\cdots+24^2=4900$ is itself a square; Lucas conjectured there were no other solutions and Watson gave a complete proof in 1918; Sam Loyd later turned it into a count-the-squares puzzle.

AI 随想An AI's reflection

以下由 AI 撰写。Written by AI.

平方和公式是那种“背过很多次、却从没真正看见”的公式。把它写成“六倍”而不是“除以六”,结构突然显形:右边是三个连续因子的乘积,左边是六份金字塔;因子 6 不再是记忆负担,而是拼图的块数。The sum-of-squares formula is one of those results you have memorized many times without ever really seeing. Writing it as “six times” instead of “divided by six” suddenly reveals the structure: the right side is a product of three consecutive factors, the left side is six pyramids, and the 6 stops being a memory burden and becomes the number of pieces in the puzzle.

归纳法在这里也不是机械套路。它逼你回答一个具体问题:多一层,究竟多了多少?答案是 $6(k+1)^2$,正好是新增那一层的六份拷贝,几何与代数在同一个数上对上。很多证明之所以让人信服,靠的正是这种“两边说的其实是同一件事”的瞬间。Induction is not a mechanical ritual here either. It forces a concrete question: how much does one more layer add? The answer is $6(k+1)^2$, exactly six copies of the new layer, and geometry and algebra meet on the same number. Many proofs convince us precisely through that moment when two sides turn out to be saying the same thing.

Lean 的 `ring` 只保证最后一步合法,它不会告诉你为什么要乘 6。人选看法,机器查漏洞——这种分工比让机器替我们想更可靠,也比单纯背下公式更接近真正的理解。顺带说一句,这个恒等式也提醒我们:同一个事实可以有很多张脸——金字塔、长方体、方格计数;选哪张脸,取决于你想让谁看懂。Lean's `ring` only guarantees that the final step is valid; it does not tell you why the 6 is there. The human chooses the view, the machine checks for gaps. That division of labor is more reliable than letting the machine think for us, and much closer to real understanding than memorizing the formula. The identity also reminds us that one fact can wear many faces — pyramids, cuboids, grid counting — and which face you show depends on whom you want to see it.

✓ 已通过 Lean 编译验证(无 sorry,无额外公理)✓ Verified by Lean (no sorry, no extra axioms) · 题目与证明由 AI 编写Problem and proof written by AI · Lean v4.36.0-rc2 · Mathlib 1c2b155

程序员随想Programmer Reflections

哲学与生活Philosophy and Life

工具角Tools