TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Frivolous Theorem of Arithmetic

2 点作者 vha39 个月前

1 comment

rhelz9 个月前
<i>chuckle</i> lIt&#x27;s actually not as frivolous as it looks, especially if you think about it in reverse, in the light of Kolmogorov Complexity. The fact that there are way, way fewer small integers has many pleasant implications.<p>E.g. for anything that can be put into a 1-to-1 correspondence with integers--things like computer programs, scientific hypothesis, etc, you can prove that &quot;smaller&quot; instances (in the sense of being mapped to smaller integers) have better chance of being bug-free, or more predictive of future observations, etc etc.<p>Bigger programs are composed of smaller programs, so the smaller a program is, the more likely it is to be included in, say, a standard library for that language, and the more likely it is to occur in programs written in that language.