TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

Memcomputing NP-complete problems in polynomial time using polynomial resources

1 pointsby efmalmost 10 years ago

1 comment

gus_massaalmost 10 years ago
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>