<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Ultimate physical limits to computation · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/quant-ph_9908043/</link><description>Collected HN comments and submissions linking this paper.</description><language>en</language><lastBuildDate>Mon, 02 Nov 2026 11:16:22 GMT</lastBuildDate><atom:link href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/feed.xml" rel="self" type="application/rss+xml" /><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=49951259</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:49951259</guid><pubDate>Sun, 04 Oct 2026 06:35:07 GMT</pubDate><description>&lt;p&gt;Ultimate Physical Limits of Computation (2000)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=44456795</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:44456795</guid><pubDate>Thu, 03 Jul 2025 16:36:19 GMT</pubDate><description>&lt;p&gt;Physical Limits to Computation (2000)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=34453157</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:34453157</guid><pubDate>Fri, 20 Jan 2023 13:56:49 GMT</pubDate><description>&lt;p&gt;Physical Limits to Computation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=33765680</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:33765680</guid><pubDate>Sun, 27 Nov 2022 19:13:03 GMT</pubDate><description>&lt;p&gt;Ultimate physical limits to computation (2000) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by adrianN</title><link>https://news.ycombinator.com/item?id=33139419</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:33139419</guid><pubDate>Sun, 09 Oct 2022 09:38:34 GMT</pubDate><description>&lt;p&gt;Maybe read https://arxiv.org/pdf/quant-ph/9908043.pdf before you think about computers operating on 2*140 objects and try to be less aggressive in your comments.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by reincarnate0x14</title><link>https://news.ycombinator.com/item?id=30446582</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:30446582</guid><pubDate>Wed, 23 Feb 2022 21:16:56 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;d be curious if anyone with understanding of memory transistor density has an idea of what sort of physical footprint and power requirements 128-bit addressable memory would look like, because I&amp;#x27;m having a hard time picturing even a distributed, shared virtual memory space realistically exceeding 16 exabytes. It looks like the Fugaku ARM cluster with 158,000 nodes uses &amp;lt; 5 PiB for 40 MW. As an aside, man does reading something from @sgi.com on USENET take me back to a better time. Title should probably note [1995] [0] https://www.fujitsu.com/global/about/innovation/fugaku/speci... [1] Also…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by Isinlor</title><link>https://news.ycombinator.com/item?id=27427975</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:27427975</guid><pubDate>Mon, 07 Jun 2021 22:20:27 GMT</pubDate><description>&lt;p&gt;In the Perfect Imperfection by Jacek Dukaj [0] has something called &amp;quot;Remy&amp;#x27;s curve&amp;quot; [1]. On the curve you can find: - Ultimate Computer is the computer using the best hardware as allowed by the physical constants of our universe. See also physics of computation. - Inclusions are in essence &amp;#x27;pocket universes&amp;#x27;. They are created for specific entities to run hardware in a dedicated universe with physical constants different from ours, allowing for better performance than those in our universe - Ultimate Inclusion is the inclusion with the best possible set of physical constants in the entire…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by adrianN</title><link>https://news.ycombinator.com/item?id=25744142</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:25744142</guid><pubDate>Tue, 12 Jan 2021 09:02:22 GMT</pubDate><description>&lt;p&gt;We have some upper bounds on what is physically possible: https://arxiv.org/abs/quant-ph/9908043&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by messe</title><link>https://news.ycombinator.com/item?id=23643589</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:23643589</guid><pubDate>Thu, 25 Jun 2020 18:02:02 GMT</pubDate><description>&lt;p&gt;An interesting paper in somewhat the opposite direction, but still building on Landauer&amp;#x27;s work is &amp;quot;Ultimate physical limits to computation&amp;quot;: https://arxiv.org/abs/quant-ph/9908043 The end of the abstract: &amp;gt; [...] quantitative bounds are put to the computational power of an `ultimate laptop&amp;#x27; with a mass of one kilogram confined to a volume of one liter.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=21111906</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:21111906</guid><pubDate>Mon, 30 Sep 2019 05:00:09 GMT</pubDate><description>&lt;p&gt;Ultimate Physical Limits to Computation (2000)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by kragen</title><link>https://news.ycombinator.com/item?id=20553756</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:20553756</guid><pubDate>Mon, 29 Jul 2019 12:21:47 GMT</pubDate><description>&lt;p&gt;It seems likely that Moore’s Law will someday be resurrected, perhaps in a weaker form, but I wouldn&amp;#x27;t bet heavily on any particular invention being the one that resurrects it. I say it seems likely because Landauer&amp;#x27;s limit works out to about 0.003 attojoules per bit erasure at room temperature, while current top-efficiency processors use on the order of 100–200 picojoules per instruction — say, about 1 picojoule per bit erasure. So we&amp;#x27;re about 10 orders of magnitude from Landauer&amp;#x27;s limit, even before we switch to reversible computation, or drop Landauer&amp;#x27;s limit by a factor of 75 by operating…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=16460672</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:16460672</guid><pubDate>Sun, 25 Feb 2018 19:28:02 GMT</pubDate><description>&lt;p&gt;Ultimate physical limits to computation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;5 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=16364661</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:16364661</guid><pubDate>Tue, 13 Feb 2018 04:06:00 GMT</pubDate><description>&lt;p&gt;Ultimate physical limits to computation, Seth Lloyd (2000)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by dvt</title><link>https://news.ycombinator.com/item?id=16227427</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:16227427</guid><pubDate>Wed, 24 Jan 2018 23:44:47 GMT</pubDate><description>&lt;p&gt;A very famous and popular paper that&amp;#x27;s often cited when debating the simulation hypothesis. I&amp;#x27;m squarely in the &amp;quot;not a simulation&amp;quot; camp for a few reasons. 1) Limits of computation. First, we need to find out whether or not the universe is computable. To me, it doesn&amp;#x27;t seem like it is[1] due to &amp;quot;funky&amp;quot; phenomena like quantum effects. 2) Consistency. It doesn&amp;#x27;t seem that a simulation ought to be as consistent as our universe appears to be. In fact, if there was a hyper-advanced society making simulations out there, the great majority of simulations would be failed attempts or bug-addled…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by tambourine_man</title><link>https://news.ycombinator.com/item?id=12295148</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:12295148</guid><pubDate>Tue, 16 Aug 2016 02:34:28 GMT</pubDate><description>&lt;p&gt;http://arxiv.org/pdf/quant-ph/9908043.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by kanzure</title><link>https://news.ycombinator.com/item?id=11917866</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:11917866</guid><pubDate>Thu, 16 Jun 2016 18:16:39 GMT</pubDate><description>&lt;p&gt;see also: &amp;quot;Ultimate physical limits to computation&amp;quot; http://arxiv.org/pdf/quant-ph/9908043v3.pdf &amp;quot;Limits on fundamental limits to computation&amp;quot; http://arxiv.org/pdf/1408.3821v2 &amp;quot;The physics of information processing superobjects: daily life among the Jupiter brains&amp;quot; http://diyhpl.us/~bryan/papers2/The%20physics%20of%20informa...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by jere</title><link>https://news.ycombinator.com/item?id=11549904</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:11549904</guid><pubDate>Fri, 22 Apr 2016 15:30:53 GMT</pubDate><description>&lt;p&gt;I&amp;#x27;ve always found the idea of the universe being a simulation rather silly. There are estimated to be 10^80 particles in the observable universe. Assuming our universe is being simulated on an earth sized computer (this is mind bogglingly ridiculous to me) and that the simulation meets Bremermann&amp;#x27;s limit (also ridiculous, since we&amp;#x27;re 40 orders of magnitude away according to this http://arxiv.org/pdf/quant-ph/9908043v3.pdf), then it would take on the order of a whole earth day to simulate a single time step. Of course, perhaps the host universe doesn&amp;#x27;t have the same limitations. Such…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by sevenless</title><link>https://news.ycombinator.com/item?id=11549589</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:11549589</guid><pubDate>Fri, 22 Apr 2016 14:49:06 GMT</pubDate><description>&lt;p&gt;This is an entertaining read: Ultimate Limits to Computation http://arxiv.org/abs/quant-ph/9908043&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by scottlocklin</title><link>https://news.ycombinator.com/item?id=9794975</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:9794975</guid><pubDate>Sun, 28 Jun 2015 20:32:25 GMT</pubDate><description>&lt;p&gt;I liked Seth Lloyd&amp;#x27;s earlier paper better: http://arxiv.org/abs/quant-ph/9908043&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by Sniffnoy</title><link>https://news.ycombinator.com/item?id=9635206</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:9635206</guid><pubDate>Sun, 31 May 2015 19:21:55 GMT</pubDate><description>&lt;p&gt;A note -- if you&amp;#x27;re linking to arXiv, it&amp;#x27;s better to link to the abstract (http://arxiv.org/abs/quant-ph/9908043, or http://arxiv.org/abs/quant-ph/9908043v3 for this particular 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!&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=9633951</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:9633951</guid><pubDate>Sun, 31 May 2015 12:30:08 GMT</pubDate><description>&lt;p&gt;Physical Limits to Computation (2000) [pdf]&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;40 points; 21 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=8720469</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:8720469</guid><pubDate>Tue, 09 Dec 2014 01:51:14 GMT</pubDate><description>&lt;p&gt;Ultimate physical limits to computation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;1 point; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by pbsd</title><link>https://news.ycombinator.com/item?id=7799002</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:7799002</guid><pubDate>Mon, 26 May 2014 07:23:23 GMT</pubDate><description>&lt;p&gt;There is another more fundamental limit, credited to Margolus and Levitin [1], which puts the maximum speed of a (quantum) gate at 2E / h operations per second for a system of energy E and Planck constant h. Given the energy of the sun quoted in the article, this puts the upper limit of bit flips per second at 2^193. Seth Lloyd&amp;#x27;s &amp;#x27;Ultimate physical limits to computation&amp;#x27; [2] goes into further detail on this subject. However, the notion of zero energy dissipation (scalable quantum computers will likely need error correction, which implies bit erasure) on any real system is ludicrous, and I…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by achille</title><link>https://news.ycombinator.com/item?id=7269268</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:7269268</guid><pubDate>Thu, 20 Feb 2014 06:37:40 GMT</pubDate><description>&lt;p&gt;Read this in the past and there&amp;#x27;s a few things that bother me * It&amp;#x27;s impossible to simulate a universe of our current resolution, because it would take more matter than the original universe. * You can&amp;#x27;t just simulate &amp;#x27;observable areas&amp;#x27;. Everything needs to be simulated. * An infinite loop does not end, even in an infinitely powerful computer * A fun calculation from the ZFS folks: To fully populate a 128bit filesystem (ie permute all combinations) you a lot of energy. So much energy you could boil the world&amp;#x27;s oceans, See: * [1] Physical Limits of Computation…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by tobiasu</title><link>https://news.ycombinator.com/item?id=5881330</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:5881330</guid><pubDate>Fri, 14 Jun 2013 17:55:43 GMT</pubDate><description>&lt;p&gt;http://arxiv.org/pdf/quant-ph/9908043.pdf&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by anateus</title><link>https://news.ycombinator.com/item?id=4653924</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:4653924</guid><pubDate>Mon, 15 Oct 2012 05:39:54 GMT</pubDate><description>&lt;p&gt;Programming the Universe by Seth Lloyd (physics professor at MIT who likes to call himself a &amp;quot;quantum mechanic&amp;quot;). Here&amp;#x27;s a relevant paper by Lloyd titled &amp;quot;Ultimate physical limits to computation&amp;quot;: http://arxiv.org/abs/quant-ph/9908043v3&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by nullc</title><link>https://news.ycombinator.com/item?id=3691332</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:3691332</guid><pubDate>Sun, 11 Mar 2012 21:25:53 GMT</pubDate><description>&lt;p&gt;It uses energy to do so— just like a heat pump can heat your home with greater output than electrical input, but not no electrical input. The more exciting detail is that computation itself doesn&amp;#x27;t increase entropy, at least not if reversible computing is use. Only errors or, rather, their correction do... So things may be more rosy than you might guess: http://arxiv.org/abs/quant-ph/9908043&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=2789291</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:2789291</guid><pubDate>Thu, 21 Jul 2011 13:01:25 GMT</pubDate><description>&lt;p&gt;Ultimate physical limits to computation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;7 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by sigil</title><link>https://news.ycombinator.com/item?id=2480406</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:2480406</guid><pubDate>Mon, 25 Apr 2011 04:13:31 GMT</pubDate><description>&lt;p&gt;&amp;gt; Suppose that there is a network that is never partitioned, and machines connected to that network that never fail. In that case consistency and availability should be perfect. You mean, in that case tolerance to partition and availability should be perfect. &amp;gt; Perhaps someday we may be able to say that the odds of enough partitions or machine failures to make the system unavailable are lower than the odds of you getting struck by lightning, at which point you will have for practical purposes defeated the constraints of the CAP theorem. So this is the really interesting question. All the CAP…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by adrianN</title><link>https://news.ycombinator.com/item?id=2265543</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:2265543</guid><pubDate>Sat, 26 Feb 2011 14:05:51 GMT</pubDate><description>&lt;p&gt;The Ultimate Physical Limits of Computation: http://arxiv.org/pdf/quant-ph/9908043&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by gwern</title><link>https://news.ycombinator.com/item?id=2116012</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:2116012</guid><pubDate>Tue, 18 Jan 2011 15:06:31 GMT</pubDate><description>&lt;p&gt;Hm. It appears Blogspot ate my comments. So I guess I&amp;#x27;ll just paste it here. --- &amp;gt; The &amp;quot;for a time&amp;quot; bit is crucial. There is as Feynman said &amp;quot;plenty of room at the bottom&amp;quot; but it is by no means infinite given actually demonstrated physics. That means all growth curves that look exponential or more in the short run turn over and become S-curves or similar in the long run, unless we discover physics that we do not now know, as information and data processing under physics as we know it are limited by the number of particles we have access to, and that in turn can only increase in the long run…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — mentioned by dschobel</title><link>https://news.ycombinator.com/item?id=1924514</link><guid isPermaLink="false">urn:hackerpapers:mention:quant-ph_9908043:1924514</guid><pubDate>Sat, 20 Nov 2010 14:09:35 GMT</pubDate><description>&lt;p&gt;Agreed. Unfortunately the Nature article is behind a paywall but the original paper is available on arxiv: http://arxiv.org/abs/quant-ph/9908043&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=1444432</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:1444432</guid><pubDate>Sat, 19 Jun 2010 10:08:49 GMT</pubDate><description>&lt;p&gt;What&amp;#x27;s the power of an &amp;quot;ultimate laptop&amp;quot; (of 1kg mass in 1L volume)&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 1 discussion reply on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item><item><title>Ultimate physical limits to computation — HN submission</title><link>https://news.ycombinator.com/item?id=227260</link><guid isPermaLink="false">urn:hackerpapers:submission:quant-ph_9908043:227260</guid><pubDate>Wed, 25 Jun 2008 06:43:23 GMT</pubDate><description>&lt;p&gt;Nature: The Ultimate Physical Limits of Computation&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;2 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/quant-ph_9908043/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>quant-ph</category></item></channel></rss>
