我放弃了日本的大学入学考试,去参加了一场“计算形而上学”考试。

2作者: fumi20266 个月前
我是一名来自日本的21岁“浪人”(三年级复读生)。 今天是大学入学共通测试——一项一年一度的强制性全国考试,是进入大学的唯一途径。缺考就意味着要再等一整年。 我花了过去6年的时间准备这场孤注一掷的考试。但今天早上,我意识到我真正需要的学位是决心。 所以,我没去参加考试。 我没有参加考试,而是用我的准考证和多年的努力换取了创造人工生命的力量。过去的一年,我全身心投入到Rust和C++的学习中,我意识到,成为定义社会的人,比仅仅成为社会中运转的齿轮要兴奋100倍。 为了证明——主要是为了向自己证明——我没有放弃是因为我做不了数学,而是因为我想解决更难的问题,我写了一份虚构的“宇宙大学”入学考试。 它结合了非微扰物理学、高等范畴论和计算形而上学,来探索作为异类存在的存在主义恐惧。 以下是摘要和一道例题。 2026年入学考试:计算形而上学系 摘要 本考试考察考生在非微扰物理学、高等范畴论和计算复杂性方面的熟练程度。它将宇宙视为一个遗产代码库,运行在普朗克尺度硬件上。 核心主题:局部与全局,微扰与非微扰,可计算与不可计算,自我与他者。 问题5:宇宙模拟器中的权限提升 [50分] 宇宙是一个运行在量子计算机上的遗产模拟,其网格尺度为普朗克尺度$\ell_P$。内存根据贝肯斯坦界限全息地分配在边界上。攻击者(物理学家)试图通过堆溢出来获取root权限。 (a) 通过黑洞形成的缓冲区溢出 [10分] 贝肯斯坦界限:$S \leq S_{Bek} = \frac{A}{4\ell_P^2}$ 宇宙的缓冲区被硬编码为`uint64_t` ($2^{64}$ 位)。 (i) 使用$S_{BH} = \frac{4\pi G M^2}{\hbar c}$,计算超出范围写入的最小质量$M_{overflow}$(以$M_P$为单位)。 (ii) 证明$M_{overflow} \sim 10^{9} M_P \approx 20\,\mu\text{g}$(微型黑洞尺度)。 (iii) 结论:宇宙在没有ASLR的情况下运行。物理常数存储在可预测的地址。黑洞是堆喷射。 你可以在这里阅读完整的考试(Gist): https://gist.github.com/fumi2026/a6d1b9af31e1960448f5333c2a1a1425 (注:我目前正在将这些基本原理应用到运行在iPhone X上的AI引擎中。演示视频即将推出。)
查看原文
I am a 21-year-old &quot;Ronin&quot; (3rd-year gap student) from Japan.<p>Today is the Common Test for University Admissions—a mandatory, once-a-year national exam that serves as the sole gateway to university. Missing it means waiting another full year.<p>I spent the last 6 years of my life preparing for this single, all-or-nothing event. But this morning, I realized that the only degree I truly need is Resolve.<p>So, I didn&#x27;t go.<p>Instead of taking the test, I traded my admission ticket and years of effort for the power to create Artificial Life. I dedicated this past year entirely to Rust and C++, realizing that it is 100x more exciting to be the one defining society than to be a mere cog turning inside it.<p>To prove—mostly to myself—that I am not dropping out because I can&#x27;t do the math, but because I want to solve harder problems, I wrote a fictional entrance exam for a &quot;University of the Universe.&quot;<p>It combines non-perturbative physics, higher category theory, and computational metaphysics to explore the existential dread of being an outlier.<p>Here is the Abstract and a sample problem.<p>2026 Entrance Exam: Department of Computational Metaphysics<p>Abstract This examination probes the candidate&#x27;s fluency across non-perturbative physics, higher category theory, and computational complexity. It treats the universe not as a physical object, but as a legacy code base running on Planck-scale hardware.<p>Core themes: local vs. global, perturbative vs. non-perturbative, computable vs. uncomputable, self vs. other.<p>Problem 5: Privilege Escalation in the Universe Simulator [50 Points]<p>The universe is a legacy simulation running on a quantum computer with Planck-scale grid $\ell_P$. Memory is holographically allocated on the boundary per the Bekenstein bound. An attacker (physicist) attempts root access via heap overflow.<p>(a) Buffer Overflow via Black Hole Formation [10 Points]<p>The Bekenstein bound: $S \leq S_{Bek} = \frac{A}{4\ell_P^2}$<p>The universe&#x27;s buffer is hardcoded as `uint64_t` ($2^{64}$ bits).<p>(i) Using $S_{BH} = \frac{4\pi G M^2}{\hbar c}$, compute minimum mass $M_{overflow}$ (in $M_P$) for out-of-bounds write.<p>(ii) Show $M_{overflow} \sim 10^{9} M_P \approx 20\,\mu\text{g}$ (micro black hole scale).<p>(iii) Conclude: the universe runs without ASLR. Physical constants are stored at predictable addresses. Black holes are heap sprays.<p>You can read the full exam here (Gist): https:&#x2F;&#x2F;gist.github.com&#x2F;fumi2026&#x2F;a6d1b9af31e1960448f5333c2a1a1425<p>(Note: I am currently implementing these first principles into an AI engine running locally on an iPhone X. Demo video coming soon.)