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

科技回声

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

GitHubTwitter

首页

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

资源链接

HackerNews API原版 HackerNewsNext.js

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

Memcomputing NP-complete problems in polynomial time using polynomial resources

1 点作者 efm将近 10 年前

1 comment

gus_massa将近 10 年前
Previous discussion from another source: <a href="https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=8652475" rel="nofollow">https:&#x2F;&#x2F;news.ycombinator.com&#x2F;item?id=8652475</a> (87 points, 237 days ago, 64 comments)<p>I&#x27;ll copy a part of the first comment:<p>&gt; <i>The idea that having variables which can take on an infinite range of real-valued values fascinates some people. But you can&#x27;t, not really. Resolution is limited by noise. Noise is inescapable, since electrons are discrete. Infinite resolution is impossible in a granular universe. Real numbers are a convenient fiction which cannot be realized in hardware. (&quot;God created the integers; all else is the work of man.&quot; - Kronecker)</i>