<?xml version="1.0" encoding="UTF-8"?>
<feed xmlns="http://www.w3.org/2005/Atom">
  <title>Popular Articles | mostdiscussed.com</title>
  <link rel="alternate" type="text/html" href="https://www.mostdiscussed.com/feed/popular"/>
  <link rel="self" type="application/atom+xml" href="http://localhost/feed"/>
  <id>https://www.mostdiscussed.com/feed/popular</id>
  <updated>2026-05-05T06:26:31+00:00</updated>
  <subtitle>The most popular articles. Keep exploring.</subtitle>
  <entry>
    <title type="html"><![CDATA[Wikipedia Has Cancer]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/User:Guy_Macon/Wikipedia_has_Cancer"/>
    <id>https://en.wikipedia.org/wiki/User:Guy_Macon/Wikipedia_has_Cancer</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[Alternative Title: <i>Just because you have some money, that doesn't mean that you have to spend it</i>.
<p>In biology, the hallmarks of an aggressive cancer include limitless multiplication of ordinarily beneficial cells, even when the body signals that further multiplication is no longer needed. The Wikipedia page on the wheat and chessboard problem explains that nothing can keep growing forever. In biology, the unwanted growth usually terminates with the death of the host. Ever-increasing spending can often lead to the same undesirable result in organizations.</p><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=14287235'>Wikimedia Foundation spending</a> 1054 Upvotes | 406 Comments<br><a href='https://news.ycombinator.com/item?id=21699011'>Wikipedia Has Cancer (2017)</a> 528 Upvotes | 310 Comments<br><a href='https://news.ycombinator.com/item?id=15429067'>Wikimedia Foundation's runaway spending growth</a> 150 Upvotes | 121 Comments<br><a href='https://news.ycombinator.com/item?id=40093801'>Wikipedia Has Cancer</a> 110 Upvotes | 52 Comments<br><a href='https://news.ycombinator.com/item?id=33405257'>Wikipedia Has Cancer</a> 42 Upvotes | 15 Comments<br><a href='https://news.ycombinator.com/item?id=26498031'>Wikipedia has Cancer (Wikipedia costs growth over time)</a> 41 Upvotes | 6 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Timeline of the far future]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Timeline_of_the_far_future"/>
    <id>https://en.wikipedia.org/wiki/Timeline_of_the_far_future</id>
    <updated>2020-03-20T18:22:26+00:00</updated>
    <summary type="html"><![CDATA[<p class="mw-empty-elt">
</p>


<p>While the future can never be predicted with absolute certainty, present understanding in various scientific fields allows for the prediction of some far-future events, if only in the broadest outline. These fields include astrophysics, which has revealed how planets and stars form, interact, and die; particle physics, which has revealed how matter behaves at the smallest scales; evolutionary biology, which predicts how life will evolve over time; and plate tectonics, which shows how continents shift over millennia.
</p><p>All projections of the future of Earth, the Solar System, and the universe must account for the second law of thermodynamics, which states that entropy, or a loss of the energy available to do work, must rise over time. Stars will eventually exhaust their supply of hydrogen fuel and burn out. Close encounters between astronomical objects gravitationally fling planets from their star systems, and star systems from galaxies.</p><p>Physicists expect that matter itself will eventually come under the influence of radioactive decay, as even the most stable materials break apart into subatomic particles. Current data suggest that the universe has a flat geometry (or very close to flat), and thus will not collapse in on itself after a finite time, and the infinite future allows for the occurrence of a number of massively improbable events, such as the formation of Boltzmann brains.</p><p>The timelines displayed here cover events from the beginning of the 11th millennium
to the furthest reaches of future time. A number of alternative future events are listed to account for questions still unresolved, such as whether humans will become extinct, whether protons decay, and whether the Earth survives when the Sun expands to become a red giant.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Physics'>Physics</a> | <a href='https://www.mostdiscussed.com/topic/Lists'>Lists</a> | <a href='https://www.mostdiscussed.com/topic/Statistics'>Statistics</a> | <a href='https://www.mostdiscussed.com/topic/Astronomy'>Astronomy</a> | <a href='https://www.mostdiscussed.com/topic/Time'>Time</a> | <a href='https://www.mostdiscussed.com/topic/Futures studies'>Futures studies</a> | <a href='https://www.mostdiscussed.com/topic/Geology'>Geology</a> | <a href='https://www.mostdiscussed.com/topic/Extinction'>Extinction</a> | <a href='https://www.mostdiscussed.com/topic/Solar System'>Solar System</a> | <a href='https://www.mostdiscussed.com/topic/Astronomy/Solar System'>Astronomy/Solar System</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=17559822'>Timeline of the far future</a> 696 Upvotes | 258 Comments<br><a href='https://news.ycombinator.com/item?id=23212805'>Timeline of the Far Future</a> 168 Upvotes | 112 Comments<br><a href='https://news.ycombinator.com/item?id=3936320'>Timeline of the far future</a> 294 Upvotes | 88 Comments<br><a href='https://news.ycombinator.com/item?id=43966466'>Timeline of the Far Future</a> 15 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=38995674'>Timeline of the Far Future</a> 16 Upvotes | 1 Comments<br><a href='https://news.ycombinator.com/item?id=13187111'>Timeline of the far future</a> 12 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Illegal prime]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Illegal_prime"/>
    <id>https://en.wikipedia.org/wiki/Illegal_prime</id>
    <updated>2020-03-20T18:22:26+00:00</updated>
    <summary type="html"><![CDATA[<p>An <b>illegal prime</b> is a prime number that represents information whose possession or distribution is forbidden in some legal jurisdictions. One of the first illegal primes was found in 2001. When interpreted in a particular way, it describes a computer program that bypasses the digital rights management scheme used on DVDs.  Distribution of such a program in the United States is illegal under the Digital Millennium Copyright Act. An illegal prime is a kind of illegal number.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Computing'>Computing</a> | <a href='https://www.mostdiscussed.com/topic/Mathematics'>Mathematics</a> | <a href='https://www.mostdiscussed.com/topic/Crime'>Crime</a> | <a href='https://www.mostdiscussed.com/topic/Cryptography'>Cryptography</a> | <a href='https://www.mostdiscussed.com/topic/Cryptography/Computer science'>Cryptography/Computer science</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=16938908'>Illegal prime</a> 267 Upvotes | 192 Comments<br><a href='https://news.ycombinator.com/item?id=26776949'>Illegal Prime Numbers</a> 218 Upvotes | 107 Comments<br><a href='https://news.ycombinator.com/item?id=1045150'>Illegal prime</a> 152 Upvotes | 76 Comments<br><a href='https://news.ycombinator.com/item?id=6568660'>Illegal Prime Numbers</a> 178 Upvotes | 58 Comments<br><a href='https://news.ycombinator.com/item?id=8107782'>Illegal prime number</a> 59 Upvotes | 30 Comments<br><a href='https://news.ycombinator.com/item?id=13015778'>Illegal prime</a> 39 Upvotes | 26 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Jevons Paradox]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Jevons_paradox"/>
    <id>https://en.wikipedia.org/wiki/Jevons_paradox</id>
    <updated>2020-03-20T18:22:26+00:00</updated>
    <summary type="html"><![CDATA[<p class="mw-empty-elt">

</p>

<p>In economics, the <b>Jevons paradox</b> (<span></span>; sometimes <b>Jevons effect</b>) occurs when technological progress or government policy increases the efficiency with which a resource is used (reducing the amount necessary for any one use), but the rate of consumption of that resource rises due to increasing demand. The Jevons paradox is perhaps the most widely known paradox in environmental economics. However, governments and environmentalists generally assume that efficiency gains will lower resource consumption, ignoring the possibility of the paradox arising.</p><p>In 1865, the English economist William Stanley Jevons observed that technological improvements that increased the efficiency of coal-use led to the increased consumption of coal in a wide range of industries. He argued that, contrary to common intuition, technological progress could not be relied upon to reduce fuel consumption.</p><p>The issue has been re-examined by modern economists studying consumption rebound effects from improved energy efficiency. In addition to reducing the amount needed for a given use, improved efficiency also lowers the relative cost of using a resource, which increases the quantity demanded. This counteracts (to some extent) the reduction in use from improved efficiency. Additionally, improved efficiency increases real incomes and accelerates economic growth, further increasing the demand for resources.  The Jevons paradox occurs when the effect from increased demand predominates, and improved efficiency increases the speed at which resources are used.</p><p>Considerable debate exists about the size of the rebound in energy efficiency and the relevance of the Jevons paradox to energy conservation. Some dismiss the paradox, while others worry that it may be self-defeating to pursue sustainability by increasing energy efficiency. Some environmental economists have proposed that efficiency gains be coupled with conservation policies that keep the cost of use the same (or higher) to avoid the Jevons paradox. Conservation policies that increase cost of use (such as cap and trade or green taxes) can be used to control the rebound effect.</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Environment'>Environment</a> | <a href='https://www.mostdiscussed.com/topic/Economics'>Economics</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=42863808'>Jevons Paradox</a> 196 Upvotes | 159 Comments<br><a href='https://news.ycombinator.com/item?id=29899297'>Jevons Paradox</a> 113 Upvotes | 90 Comments<br><a href='https://news.ycombinator.com/item?id=38130060'>Jevons Paradox</a> 98 Upvotes | 81 Comments<br><a href='https://news.ycombinator.com/item?id=16451575'>Jevons Paradox</a> 95 Upvotes | 44 Comments<br><a href='https://news.ycombinator.com/item?id=16785183'>Jevons paradox</a> 45 Upvotes | 28 Comments<br><a href='https://news.ycombinator.com/item?id=1128381'>Jevons paradox</a> 16 Upvotes | 2 Comments<br><a href='https://news.ycombinator.com/item?id=35968561'>Jevons Paradox</a> 12 Upvotes | 1 Comments<br><a href='https://news.ycombinator.com/item?id=42846473'>Jevons Paradox</a> 12 Upvotes | 1 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Day of the Programmer]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Day_of_the_Programmer"/>
    <id>https://en.wikipedia.org/wiki/Day_of_the_Programmer</id>
    <updated>2020-03-20T21:32:51+00:00</updated>
    <summary type="html"><![CDATA[<p>The <b>Day of the Programmer</b> is an international professional day that is celebrated on the 256th (hexadecimal 100th, or the 2<sup>8</sup>th) day of each year (September 13 during common years and on September 12 in leap years). It is officially recognized in Russia.</p><p>The number 256 (2<sup>8</sup>) was chosen because it is the number of distinct values that can be represented with a byte, a value well known to programmers. 256 is also the highest power of two that is less than 365, the number of days in a common year.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Computing'>Computing</a> | <a href='https://www.mostdiscussed.com/topic/Time'>Time</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=2990108'>Programmers' Day</a> 417 Upvotes | 84 Comments<br><a href='https://news.ycombinator.com/item?id=6378415'>Happy Programmers' Day</a> 245 Upvotes | 65 Comments<br><a href='https://news.ycombinator.com/item?id=1686133'>Today is Programmer's Day</a> 240 Upvotes | 38 Comments<br><a href='https://news.ycombinator.com/item?id=24453416'>Happy Programmers' Day to all devs in HN</a> 51 Upvotes | 15 Comments<br><a href='https://news.ycombinator.com/item?id=6351509'>Programmer's Day - 13 September</a> 20 Upvotes | 11 Comments<br><a href='https://news.ycombinator.com/item?id=12480629'>Day of the Programmer</a> 10 Upvotes | 2 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Room 641A]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Room_641A"/>
    <id>https://en.wikipedia.org/wiki/Room_641A</id>
    <updated>2020-03-20T21:32:51+00:00</updated>
    <summary type="html"><![CDATA[<p><span></span>
</p>

<p><b>Room 641A</b> is a telecommunication interception facility operated by AT&amp;T for the U.S. National Security Agency, as part of its warrantless surveillance program as authorized by the Patriot Act. The facility commenced operations in 2003 and its purpose was publicly revealed in 2006.</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/United States/U.S. Government'>United States/U.S. Government</a> | <a href='https://www.mostdiscussed.com/topic/United States'>United States</a> | <a href='https://www.mostdiscussed.com/topic/Mass surveillance'>Mass surveillance</a> | <a href='https://www.mostdiscussed.com/topic/Espionage'>Espionage</a> | <a href='https://www.mostdiscussed.com/topic/California'>California</a> | <a href='https://www.mostdiscussed.com/topic/California/San Francisco Bay Area'>California/San Francisco Bay Area</a> | <a href='https://www.mostdiscussed.com/topic/Telecommunications'>Telecommunications</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=12515724'>Room 641A</a> 207 Upvotes | 75 Comments<br><a href='https://news.ycombinator.com/item?id=23350120'>Room 641A</a> 333 Upvotes | 70 Comments<br><a href='https://news.ycombinator.com/item?id=5847166'>Room 641A</a> 248 Upvotes | 44 Comments<br><a href='https://news.ycombinator.com/item?id=41507188'>Room 641A</a> 51 Upvotes | 5 Comments<br><a href='https://news.ycombinator.com/item?id=32984515'>Room 641A</a> 29 Upvotes | 2 Comments<br><a href='https://news.ycombinator.com/item?id=47374643'>Room 641A</a> 12 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Year 2038 Problem]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Year_2038_problem"/>
    <id>https://en.wikipedia.org/wiki/Year_2038_problem</id>
    <updated>2020-03-19T18:24:22+00:00</updated>
    <summary type="html"><![CDATA[<p>The <b>Year 2038 problem</b> (also called Y2038 or Y2k38 or Unix Y2K) relates to representing time in many digital systems as the number of seconds passed since 00:00:00 UTC on 1 January 1970 and storing it as a signed 32-bit integer. Such implementations cannot encode times after 03:14:07 UTC on 19 January 2038. Similar to the Y2K problem, the Year 2038 problem is caused by insufficient capacity used to represent time.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Computing'>Computing</a> | <a href='https://www.mostdiscussed.com/topic/Computing/Software'>Computing/Software</a> | <a href='https://www.mostdiscussed.com/topic/Computing/Computer science'>Computing/Computer science</a> | <a href='https://www.mostdiscussed.com/topic/Time'>Time</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=5644292'>Year 2038 problem</a> 194 Upvotes | 108 Comments<br><a href='https://news.ycombinator.com/item?id=7766171'>Year 2038 problem</a> 45 Upvotes | 27 Comments<br><a href='https://news.ycombinator.com/item?id=18432889'>Year 2038 problem</a> 22 Upvotes | 9 Comments<br><a href='https://news.ycombinator.com/item?id=44099031'>Year 2038 Problem</a> 22 Upvotes | 7 Comments<br><a href='https://news.ycombinator.com/item?id=17839405'>Year 2038 problem</a> 15 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=41785359'>Year 2038 problem of Unix time</a> 14 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=14694191'>The Year 2038 Problem</a> 12 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=33767612'>Year 2038 Problem</a> 27 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=32565852'>Year 2038 Problem</a> 24 Upvotes | 2 Comments<br><a href='https://news.ycombinator.com/item?id=18799000'>We are now half-way between the Y2K and the Year 2038 problem</a> 17 Upvotes | 0 Comments<br><a href='https://news.ycombinator.com/item?id=6525952'>Year 2038 Problem</a> 12 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Buffalo_buffalo_Buffalo_buffalo_buffalo_buffalo_Buffalo_buffalo"/>
    <id>https://en.wikipedia.org/wiki/Buffalo_buffalo_Buffalo_buffalo_buffalo_buffalo_Buffalo_buffalo</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p class="mw-empty-elt">
</p>

<p>"<b>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</b>" is a grammatically correct sentence in American English, often presented as an example of how homonyms and homophones can be used to create complicated linguistic constructs through lexical ambiguity. It has been discussed in literature in various forms since 1967, when it appeared in Dmitri Borgmann's <i>Beyond Language: Adventures in Word and Thought</i>.
</p><p>The sentence employs three distinct meanings of the word <i>buffalo</i>:
</p>
<ul><li>as a proper noun to refer to a specific place named Buffalo, the city of Buffalo, New York, being the most notable;</li>
<li>as a verb (uncommon in regular usage) <i>to buffalo</i>, meaning "to bully, harass, or intimidate" or "to baffle"; and</li>
<li>as a noun to refer to the animal, bison (often called <i>buffalo</i> in North America). The plural is also <i>buffalo</i>.</li></ul><p>An expanded form of the sentence which preserves the original word order is: "Buffalo bison, that other Buffalo bison bully, also bully Buffalo bison."
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Linguistics'>Linguistics</a> | <a href='https://www.mostdiscussed.com/topic/New York (state)'>New York (state)</a> | <a href='https://www.mostdiscussed.com/topic/New York (state)/Western New York'>New York (state)/Western New York</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=37425842'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 178 Upvotes | 95 Comments<br><a href='https://news.ycombinator.com/item?id=1097258'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 174 Upvotes | 69 Comments<br><a href='https://news.ycombinator.com/item?id=22288372'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 29 Upvotes | 19 Comments<br><a href='https://news.ycombinator.com/item?id=11654975'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 52 Upvotes | 17 Comments<br><a href='https://news.ycombinator.com/item?id=18391960'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 18 Upvotes | 6 Comments<br><a href='https://news.ycombinator.com/item?id=36036855'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 19 Upvotes | 5 Comments<br><a href='https://news.ycombinator.com/item?id=36460256'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 17 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=43213767'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 19 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=47394684'>Buffalo buffalo Buffalo buffalo buffalo buffalo Buffalo buffalo</a> 14 Upvotes | 3 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Simpson's Paradox]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Simpson%27s_paradox"/>
    <id>https://en.wikipedia.org/wiki/Simpson%27s_paradox</id>
    <updated>2020-03-19T18:24:22+00:00</updated>
    <summary type="html"><![CDATA[<p><b>Simpson's paradox</b>, which goes by several names, is a phenomenon in probability and statistics, in which a trend appears in several different groups of data but disappears or reverses when these groups are combined. This result is often encountered in social-science and medical-science statistics and is particularly problematic when frequency data is unduly given causal interpretations. The paradox can be resolved when causal relations are appropriately addressed in the statistical modeling.</p><p>Simpson's paradox has been used as an exemplar to illustrate to the non-specialist or public audience the kind of misleading results mis-applied statistics can generate. Martin Gardner wrote a popular account of Simpson's paradox in his March 1976 Mathematical Games column in <i>Scientific American</i>.</p><p>Edward H. Simpson first described this phenomenon in a technical paper in 1951, but the statisticians Karl Pearson et al., in 1899, and Udny Yule, in 1903, had mentioned similar effects earlier. The name <i>Simpson's paradox</i> was introduced by Colin R. Blyth in 1972.</p><p>It is also referred to as or <b>Simpson's reversal</b>, <b>Yule–Simpson effect</b>, <b>amalgamation paradox</b>, or <b>reversal paradox</b>.</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Mathematics'>Mathematics</a> | <a href='https://www.mostdiscussed.com/topic/Statistics'>Statistics</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=39673754'>Simpson's Paradox</a> 365 Upvotes | 106 Comments<br><a href='https://news.ycombinator.com/item?id=2822455'>Simpson's paradox</a> 174 Upvotes | 34 Comments<br><a href='https://news.ycombinator.com/item?id=791821'>Simpson's paradox: why mistrust seemingly simple statistics</a> 152 Upvotes | 17 Comments<br><a href='https://news.ycombinator.com/item?id=30230206'>Simpson’s Paradox</a> 11 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=16007052'>Simpson's paradox</a> 10 Upvotes | 0 Comments<br><a href='https://news.ycombinator.com/item?id=48002240'>Simpson's Paradox</a> 10 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Boltzmann Brain]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Boltzmann_brain"/>
    <id>https://en.wikipedia.org/wiki/Boltzmann_brain</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p>The <b>Boltzmann brain</b> argument suggests that it is more likely for a single brain to spontaneously and briefly form in a void (complete with a false memory of having existed in our universe) than it is for our universe to have come about in the way modern science thinks it actually did. It was first proposed as a <i>reductio ad absurdum</i> response to Ludwig Boltzmann's early explanation for the low-entropy state of our universe.</p><p>In this physics thought experiment, a Boltzmann brain is a fully formed brain, complete with memories of a full human life in our universe, that arises due to extremely rare random fluctuations out of a state of thermodynamic equilibrium. Theoretically over a period of time on the order of hundreds of billions of years, by sheer chance atoms in a void could spontaneously come together in such a way as to assemble a functioning human brain. Like any brain in such circumstances, it would almost immediately stop functioning and begin to deteriorate.</p><p>The idea is ironically named after the Austrian physicist Ludwig Boltzmann (1844–1906), who in 1896 published a theory that tried to account for the fact that we find ourselves in a universe that is not as chaotic as the budding field of thermodynamics seemed to predict. He offered several explanations, one of them being that the universe, even one that is fully random (or at thermal equilibrium), would spontaneously fluctuate to a more ordered (or low-entropy) state. One criticism of this "Boltzmann universe" hypothesis is that the most common thermal fluctuations are as close to equilibrium overall as possible; thus, by any reasonable criterion, actual humans in the actual universe would be vastly less likely than "Boltzmann brains" existing alone in an empty universe.
</p><p>Boltzmann brains gained new relevance around 2002, when some cosmologists started to become concerned that, in many existing theories about the Universe, human brains in the current Universe appear to be vastly outnumbered by Boltzmann brains in the future Universe who, by chance, have exactly the same perceptions that we do; this leads to the conclusion that statistically we ourselves are likely to be Boltzmann brains. Such a <i>reductio ad absurdum</i> argument is sometimes used to argue against certain theories of the Universe. When applied to more recent theories about the multiverse, Boltzmann brain arguments are part of the unsolved measure problem of cosmology. Boltzmann brains remain a thought experiment; physicists do not believe that we are actually Boltzmann brains, but rather use the thought experiment as a tool for evaluating competing scientific theories.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Physics'>Physics</a> | <a href='https://www.mostdiscussed.com/topic/Philosophy'>Philosophy</a> | <a href='https://www.mostdiscussed.com/topic/Philosophy/Metaphysics'>Philosophy/Metaphysics</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=42374027'>Boltzmann brain</a> 148 Upvotes | 150 Comments<br><a href='https://news.ycombinator.com/item?id=22079253'>Boltzmann Brain</a> 238 Upvotes | 149 Comments<br><a href='https://news.ycombinator.com/item?id=6999074'>Boltzmann brain</a> 59 Upvotes | 18 Comments<br><a href='https://news.ycombinator.com/item?id=12152658'>Boltzmann Brain</a> 58 Upvotes | 17 Comments<br><a href='https://news.ycombinator.com/item?id=27775602'>Boltzmann Brain</a> 18 Upvotes | 0 Comments<br><a href='https://news.ycombinator.com/item?id=34590288'>Boltzmann Brain</a> 15 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Inventors killed by their own inventions]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/List_of_inventors_killed_by_their_own_inventions"/>
    <id>https://en.wikipedia.org/wiki/List_of_inventors_killed_by_their_own_inventions</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p class="mw-empty-elt">
</p>

<p>This is a list of inventors whose deaths were in some manner caused by or related to a product, process, procedure, or other innovation that they invented or designed.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Death'>Death</a> | <a href='https://www.mostdiscussed.com/topic/Lists'>Lists</a> | <a href='https://www.mostdiscussed.com/topic/Invention'>Invention</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=20112207'>Inventors killed by their own inventions</a> 273 Upvotes | 149 Comments<br><a href='https://news.ycombinator.com/item?id=800243'>List of Inventors Killed By Their Own Inventions</a> 109 Upvotes | 59 Comments<br><a href='https://news.ycombinator.com/item?id=13211574'>Inventors killed by their own inventions</a> 67 Upvotes | 27 Comments<br><a href='https://news.ycombinator.com/item?id=26055861'>List of Inventors Killed by Their Own Inventions</a> 73 Upvotes | 22 Comments<br><a href='https://news.ycombinator.com/item?id=20102965'>List of inventors killed by their own inventions</a> 16 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=5299212'>List of inventors killed by their own inventions</a> 25 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[List of Lists of Lists]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/List_of_lists_of_lists"/>
    <id>https://en.wikipedia.org/wiki/List_of_lists_of_lists</id>
    <updated>2020-03-19T21:35:12+00:00</updated>
    <summary type="html"><![CDATA[<p>This is a <b>list of other articles that are lists of list articles</b> on the English Wikipedia.  In other words, each of the articles linked here is an index to multiple lists on a topic.  Some of the linked articles are themselves lists of lists of lists. This article is also a list of lists, and also a list itself.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Lists'>Lists</a> | <a href='https://www.mostdiscussed.com/topic/Libraries'>Libraries</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=3542366'>Wikipedia's list of lists of lists</a> 195 Upvotes | 50 Comments<br><a href='https://news.ycombinator.com/item?id=28615670'>List of Lists of Lists</a> 114 Upvotes | 20 Comments<br><a href='https://news.ycombinator.com/item?id=16988081'>Wikipedia: List of lists of lists</a> 112 Upvotes | 16 Comments<br><a href='https://news.ycombinator.com/item?id=21384134'>List of Lists of Lists</a> 18 Upvotes | 7 Comments<br><a href='https://news.ycombinator.com/item?id=12181233'>List of lists of lists</a> 16 Upvotes | 5 Comments<br><a href='https://news.ycombinator.com/item?id=23633972'>List of Lists of Lists – Wikipedia</a> 14 Upvotes | 5 Comments<br><a href='https://news.ycombinator.com/item?id=24886292'>List of Lists of Lists</a> 16 Upvotes | 1 Comments<br><a href='https://news.ycombinator.com/item?id=27835605'>List of Lists of Lists</a> 13 Upvotes | 1 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[The Thing]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/The_Thing_(listening_device)"/>
    <id>https://en.wikipedia.org/wiki/The_Thing_(listening_device)</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p><b>The Thing</b>, also known as <b>the Great Seal bug</b>, was one of the first covert listening devices (or "bugs") to use passive techniques to transmit an audio signal. It was concealed inside a gift given by the Soviet Union to W. Averell Harriman, the United States Ambassador to the Soviet Union, on August 4, 1945. Because it was passive, needing electromagnetic energy from an outside source to become energized and activate, it is considered a predecessor of Radio-Frequency Identification (RFID) technology.</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Espionage'>Espionage</a> | <a href='https://www.mostdiscussed.com/topic/Military history'>Military history</a> | <a href='https://www.mostdiscussed.com/topic/Military history/Military science, technology, and theory'>Military history/Military science, technology, and theory</a> | <a href='https://www.mostdiscussed.com/topic/Military history/Intelligence'>Military history/Intelligence</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=20157116'>The Thing</a> 599 Upvotes | 104 Comments<br><a href='https://news.ycombinator.com/item?id=2284628'>Thing (listening device)</a> 49 Upvotes | 8 Comments<br><a href='https://news.ycombinator.com/item?id=27676518'>The Thing (Listening Device)</a> 14 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=8171230'>Great Seal bug</a> 10 Upvotes | 1 Comments<br><a href='https://news.ycombinator.com/item?id=34952653'>The Thing</a> 12 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Non-English-based programming languages]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Non-English-based_programming_languages"/>
    <id>https://en.wikipedia.org/wiki/Non-English-based_programming_languages</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p><b>Non-English-based programming languages</b> are programming languages that do not use keywords taken from or inspired by English vocabulary.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Computing'>Computing</a> | <a href='https://www.mostdiscussed.com/topic/Computer science'>Computer science</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=20319434'>Non-English-based programming languages</a> 262 Upvotes | 222 Comments<br><a href='https://news.ycombinator.com/item?id=6315913'>Non-English-based programming languages</a> 77 Upvotes | 75 Comments<br><a href='https://news.ycombinator.com/item?id=524758'>Non-English-based programming languages</a> 30 Upvotes | 23 Comments<br><a href='https://news.ycombinator.com/item?id=11961223'>Non-English-based programming languages</a> 57 Upvotes | 18 Comments<br><a href='https://news.ycombinator.com/item?id=28822707'>Non-English-Based Programming Languages</a> 10 Upvotes | 6 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Project Cybersyn (1971)]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Project_Cybersyn"/>
    <id>https://en.wikipedia.org/wiki/Project_Cybersyn</id>
    <updated>2020-03-20T21:32:51+00:00</updated>
    <summary type="html"><![CDATA[<p><b>Project Cybersyn</b> was a Chilean project from 1971–1973 during the presidency of Salvador Allende aimed at constructing a distributed decision support system to aid in the management of the national economy. The project consisted of four modules: an economic simulator, custom software to check factory performance, an operations room, and a national network of telex machines that were linked to one mainframe computer.</p><p>Project Cybersyn was based on viable system model theory approach to organizational design, and featured innovative technology for its time: it included a network of telex machines (<i>Cybernet</i>) in state-run enterprises that would transmit and receive information with the government in Santiago. Information from the field would be fed into statistical modeling software (<i>Cyberstride</i>) that would monitor production indicators, such as raw material supplies or high rates of worker absenteeism, in "almost" real time, alerting the workers in the first case and, in abnormal situations, if those parameters fell outside acceptable ranges by a very large degree, also the central government. The information would also be input into economic simulation software (<i>CHECO</i>, for CHilean ECOnomic simulator) that the government could use to forecast the possible outcome of economic decisions. Finally, a sophisticated operations room (<i>Opsroom</i>) would provide a space where managers could see relevant economic data, formulate feasible responses to emergencies, and transmit advice and directives to enterprises and factories in alarm situations by using the telex network.
</p><p>The principal architect of the system was British operations research scientist Stafford Beer, and the system embodied his notions of organisational cybernetics in industrial management. One of its main objectives was to devolve decision-making power within industrial enterprises to their workforce in order to develop self-regulation of factories.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Computing'>Computing</a> | <a href='https://www.mostdiscussed.com/topic/Economics'>Economics</a> | <a href='https://www.mostdiscussed.com/topic/Systems'>Systems</a> | <a href='https://www.mostdiscussed.com/topic/Systems/Cybernetics'>Systems/Cybernetics</a> | <a href='https://www.mostdiscussed.com/topic/Chile'>Chile</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=24764727'>Project Cybersyn</a> 212 Upvotes | 114 Comments<br><a href='https://news.ycombinator.com/item?id=7398245'>Project Cybersyn (1971)</a> 70 Upvotes | 36 Comments<br><a href='https://news.ycombinator.com/item?id=1190508'>Project Cybersyn: real-time computer control of a planned economy (1970-1973)</a> 56 Upvotes | 33 Comments<br><a href='https://news.ycombinator.com/item?id=46681156'>Project Cybersyn</a> 20 Upvotes | 10 Comments<br><a href='https://news.ycombinator.com/item?id=3054018'>Computer-controlled socialist economy gets destroyed on 9/11... 1973</a> 12 Upvotes | 8 Comments<br><a href='https://news.ycombinator.com/item?id=46076047'>Project Cybersyn</a> 17 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=1639149'>Project Cybersyn</a> 12 Upvotes | 3 Comments<br><a href='https://news.ycombinator.com/item?id=45305384'>Project Cybersyn (1971)</a> 11 Upvotes | 1 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Goiânia radiation accident]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Goi%C3%A2nia_accident"/>
    <id>https://en.wikipedia.org/wiki/Goi%C3%A2nia_accident</id>
    <updated>2020-03-20T21:32:51+00:00</updated>
    <summary type="html"><![CDATA[<p>The <b>Goiânia accident</b> <small></small><span title="Representation in the International Phonetic Alphabet (IPA)">[ɡojˈjɐniɐ]</span> was a radioactive contamination accident that occurred on September 13, 1987, in Goiânia, in the Brazilian state of Goiás, after a forgotten radiotherapy source was taken from an abandoned hospital site in the city. It was subsequently handled by many people, resulting in four deaths. About 112,000 people were examined for radioactive contamination and 249 of them were found to have been contaminated.</p><p>In the cleanup operation, topsoil had to be removed from several sites, and several hundred houses were demolished. All the objects from within those houses, including personal possessions, were seized and incinerated. <i>Time</i> magazine has identified the accident as one of the world's "worst nuclear disasters" and the International Atomic Energy Agency called it "one of the world's worst radiological incidents".</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Environment'>Environment</a> | <a href='https://www.mostdiscussed.com/topic/Occupational Safety and Health'>Occupational Safety and Health</a> | <a href='https://www.mostdiscussed.com/topic/Brazil'>Brazil</a> | <a href='https://www.mostdiscussed.com/topic/Brazil/History of Brazil'>Brazil/History of Brazil</a> | <a href='https://www.mostdiscussed.com/topic/Science Policy'>Science Policy</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=34609730'>Goiânia Accident</a> 298 Upvotes | 185 Comments<br><a href='https://news.ycombinator.com/item?id=29127586'>The Goiânia Accident (1987)</a> 205 Upvotes | 121 Comments<br><a href='https://news.ycombinator.com/item?id=6181011'>Goiânia radiation accident</a> 14 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=23664402'>Goiânia Accident</a> 21 Upvotes | 2 Comments<br><a href='https://news.ycombinator.com/item?id=45046458'>Goiânia Accident</a> 14 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Moravec's Paradox]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Moravec%27s_paradox"/>
    <id>https://en.wikipedia.org/wiki/Moravec%27s_paradox</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p><b>Moravec's paradox</b> is the observation by artificial intelligence and robotics researchers that, contrary to traditional assumptions, reasoning (which is high-level in humans) requires very little computation, but sensorimotor skills (comparatively low-level in humans) require enormous computational resources. The principle was articulated by Hans Moravec, Rodney Brooks, Marvin Minsky and others in the 1980s. As Moravec writes, "it is comparatively easy to make computers exhibit adult level performance on intelligence tests or playing checkers, and difficult or impossible to give them the skills of a one-year-old when it comes to perception and mobility".</p><p>Similarly, Minsky emphasized that the most difficult human skills to reverse engineer are those that are <i>unconscious</i>. "In general, we're least aware of what our minds do best", he wrote, and added "we're more aware of simple processes that don't work well than of complex ones that work flawlessly".</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Computer science'>Computer science</a> | <a href='https://www.mostdiscussed.com/topic/Philosophy'>Philosophy</a> | <a href='https://www.mostdiscussed.com/topic/Philosophy/Logic'>Philosophy/Logic</a> | <a href='https://www.mostdiscussed.com/topic/Philosophy/Philosophy of science'>Philosophy/Philosophy of science</a> | <a href='https://www.mostdiscussed.com/topic/Philosophy/Philosophy of mind'>Philosophy/Philosophy of mind</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=20701480'>Moravec's Paradox</a> 155 Upvotes | 87 Comments<br><a href='https://news.ycombinator.com/item?id=4923299'>Moravec's paradox</a> 188 Upvotes | 43 Comments<br><a href='https://news.ycombinator.com/item?id=16891191'>Moravec's paradox</a> 30 Upvotes | 6 Comments<br><a href='https://news.ycombinator.com/item?id=36270601'>Moravec's Paradox</a> 13 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=11048941'>Moravec's paradox</a> 30 Upvotes | 4 Comments<br><a href='https://news.ycombinator.com/item?id=32087053'>Moravec's Paradox</a> 18 Upvotes | 0 Comments<br><a href='https://news.ycombinator.com/item?id=8006105'>Moravec's paradox</a> 17 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Two Envelopes Problem]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Two_envelopes_problem"/>
    <id>https://en.wikipedia.org/wiki/Two_envelopes_problem</id>
    <updated>2020-03-20T21:32:51+00:00</updated>
    <summary type="html"><![CDATA[<p>The <b>two envelopes problem</b>, also known as the <b>exchange paradox</b>, is a brain teaser, puzzle, or paradox in logic, probability, and recreational mathematics. It is of special interest in decision theory, and for the Bayesian interpretation of probability theory. Historically, it arose as a variant of the necktie paradox.
The problem typically is introduced by formulating a hypothetical challenge of the following type: 
</p>
<p>It seems obvious that there is no point in switching envelopes as the situation is symmetric. However, because you stand to gain twice as much money if you switch while risking only a loss of half of what you currently have, it is possible to argue that it is more beneficial to switch. The problem is to show what is wrong with this argument.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Military history/Early Muslim military history'>Military history/Early Muslim military history</a> | <a href='https://www.mostdiscussed.com/topic/Games'>Games</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=31558583'>Two Envelopes Problem</a> 249 Upvotes | 300 Comments<br><a href='https://news.ycombinator.com/item?id=6387044'>Two envelopes problem</a> 42 Upvotes | 88 Comments<br><a href='https://news.ycombinator.com/item?id=1582219'>Two Envelopes Problem</a> 112 Upvotes | 88 Comments<br><a href='https://news.ycombinator.com/item?id=6709973'>Two envelopes problem</a> 11 Upvotes | 1 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Langton's Ant]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Langton%27s_ant"/>
    <id>https://en.wikipedia.org/wiki/Langton%27s_ant</id>
    <updated>2020-03-19T21:46:24+00:00</updated>
    <summary type="html"><![CDATA[<p class="mw-empty-elt">
</p>


<p><b>Langton's ant</b> is a two-dimensional universal Turing machine with a very simple set of rules but complex emergent behavior. It was invented by Chris Langton in 1986 and runs on a square lattice of black and white cells. The universality of Langton's ant was proven in 2000. The idea has been generalized in several different ways, such as turmites which add more colors and more states.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Mathematics'>Mathematics</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=8265482'>Langton's ant</a> 118 Upvotes | 42 Comments<br><a href='https://news.ycombinator.com/item?id=20123626'>Langton's Ant</a> 115 Upvotes | 25 Comments<br><a href='https://news.ycombinator.com/item?id=35975080'>Langton’s ant</a> 102 Upvotes | 23 Comments<br><a href='https://news.ycombinator.com/item?id=2230459'>Langton's ant</a> 176 Upvotes | 20 Comments<br><a href='https://news.ycombinator.com/item?id=32674536'>Langton's Ant</a> 14 Upvotes | 0 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
  <entry>
    <title type="html"><![CDATA[Potato Paradox]]></title>
    <link rel="alternate" type="text/html" href="https://en.wikipedia.org/wiki/Potato_paradox"/>
    <id>https://en.wikipedia.org/wiki/Potato_paradox</id>
    <updated>2020-03-19T21:38:22+00:00</updated>
    <summary type="html"><![CDATA[<p>The <b>potato paradox</b> is a mathematical calculation that has a counter-intuitive result. <i>The Universal Book of Mathematics</i> states the problem as follows:
</p>
<blockquote class="templatequote"><p>Fred brings home 100 kg of potatoes, which (being purely mathematical potatoes) consist of 99% water. He then leaves them outside overnight so that they consist of 98% water. What is their new weight? The surprising answer is 50 kg.</p></blockquote>
<p>In Quine's classification of paradoxes, the potato paradox is a veridical paradox.
</p><br>Topics:<br><a href='https://www.mostdiscussed.com/topic/Mathematics'>Mathematics</a><br><br>Discussions:<br><a href='https://news.ycombinator.com/item?id=9894237'>Potato paradox</a> 559 Upvotes | 132 Comments<br><a href='https://news.ycombinator.com/item?id=17744020'>Potato paradox</a> 232 Upvotes | 77 Comments<br><a href='https://news.ycombinator.com/item?id=33768543'>Potato Paradox</a> 35 Upvotes | 14 Comments<br>]]></summary>
    <author>
      <name>Most Discussed 📖</name>
    </author>
  </entry>
</feed>