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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Turing and the Primes (2016) [pdf]

25 点作者 pncnmnp7 个月前

2 条评论

johnklos7 个月前
I can&#x27;t think about the Pilot ACE without thinking about the not much later Jupiter Ace, which was named after the Pilot.<p>Interestingly, the first more challenging program I wrote as a child was a prime counting program. Although I wanted a Jupiter Ace because I wanted to learn Forth, instead I had a Sinclair ZX80 with 8K ROM (and later a T&#x2F;S 1000). With the speed of Sinclair BASIC, it&#x27;d&#x27;ve taken multiple years to count the first million primes, something that I use as a benchmark these days and which takes less than a second on an Apple ARM CPU.<p>I remember collecting counts to compare ln(x) with pi(x) and imagining how wonderful it&#x27;d be to have powerful computers that could give me the answers I wanted in seconds and minutes instead of days, weeks, months or years. I like to imagine Turing had imagined the same thing now and then :)
srbhr7 个月前
Talking about primes,(2^136279841)-1 is the New Largest Known Prime Number. Discovered 21st Oct (Today).<p>Ref. <a href="https:&#x2F;&#x2F;www.mersenne.org&#x2F;" rel="nofollow">https:&#x2F;&#x2F;www.mersenne.org&#x2F;</a>
评论 #41907426 未加载