Universal Limits on Computation · HackerPapers discussions

Universal Limits on Computation — mentioned by dang

Sun, 28 Jun 2015 18:27:19 GMT

Ok, we changed the url from http://arxiv.org/pdf/astro-ph/0404510v2.pdf.

Paper and discussion history. A mention is not an endorsement.

Universal Limits on Computation — mentioned by Sniffnoy

Sun, 28 Jun 2015 17:31:29 GMT

A note -- if you're linking to arXiv, it's better to link to the abstract (http://arxiv.org/abs/astro-ph/0404510, or http://arxiv.org/abs/astro-ph/0404510v2 for this specific version) rather than directly to the PDF. From the abstract, one can easily click through to the PDF; not so the reverse. And the abstract allows one to do things like see different versions of the paper, search for other things by the same authors, etc. Thank you!

Paper and discussion history. A mention is not an endorsement.

Universal Limits on Computation — HN submission

Sun, 28 Jun 2015 09:54:03 GMT

Universal Limits on Computation (2004) [pdf]

26 points; 9 discussion replies on HN. Paper and source history. A submission is not an endorsement.

Universal Limits on Computation — mentioned by Steuard

Mon, 30 Sep 2013 03:05:53 GMT

The remarkable thing that this explanation doesn't really explore in depth is that the maximum information (~entropy) contained in a region scales according to its boundary area rather than to its volume. That means that "maximum information per unit volume" drops precipitously with size.[1] Just for example, this allows you to calculate an ultimate limit on Moore's law of only ~800 years, for any possible computer functioning within the bounds of the observable universe. As sketched below[1], the observable universe can hold only about 10^123 bits of information. Processors currently contain…

Paper and discussion history. A mention is not an endorsement.

Universal Limits on Computation — mentioned by phreeza

Tue, 13 Jul 2010 01:13:26 GMT

And for extra credit: Universal Limits on Computation http://arxiv.org/abs/astro-ph/0404510

Paper and discussion history. A mention is not an endorsement.