<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1405.6903/</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/1405.6903/feed.xml" rel="self" type="application/rss+xml" /><item><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton — mentioned by cute_boi</title><link>https://news.ycombinator.com/item?id=48822131</link><guid isPermaLink="false">urn:hackerpapers:mention:1405.6903:48822131</guid><pubDate>Tue, 07 Jul 2026 19:03:23 GMT</pubDate><description>&lt;p&gt;No need stupid moving texts. CS231n: Convolutional Neural Networks for Visual Recognition - https://cs231n.github.io/ The Unreasonable Effectiveness of Recurrent Neural Networks - https://karpathy.github.io/2015/05/21/rnn-effectiveness/ Understanding LSTM Networks - https://colah.github.io/posts/2015-08-Understanding-LSTMs/ ImageNet Classification with Deep Convolutional Neural Networks - https://papers.nips.cc/paper/2012/hash/c399862d3b9d6b76c8436... Deep Residual Learning for Image Recognition - https://arxiv.org/abs/1512.03385 Multi-Scale Context Aggregation by Dilated Convolutions…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1405.6903/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item><item><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton — mentioned by gooob</title><link>https://news.ycombinator.com/item?id=48822006</link><guid isPermaLink="false">urn:hackerpapers:mention:1405.6903:48822006</guid><pubDate>Tue, 07 Jul 2026 18:54:32 GMT</pubDate><description>&lt;p&gt;https://colah.github.io/posts/2015-08-Understanding-LSTMs/ https://papers.nips.cc/paper/2012/hash/c399862d3b9d6b76c8436... https://papers.nips.cc/paper_files/paper/2012/file/c399862d3... https://arxiv.org/pdf/1512.03385 https://arxiv.org/pdf/1511.07122 https://arxiv.org/pdf/1603.05027 https://arxiv.org/pdf/1409.2329 https://arxiv.org/pdf/1512.02595 https://arxiv.org/pdf/1409.0473 https://arxiv.org/pdf/1506.03134 https://arxiv.org/pdf/1706.03762 https://nlp.seas.harvard.edu/annotated-transformer/ https://arxiv.org/pdf/1410.5401 https://arxiv.org/pdf/1706.01427 https://arxiv.org/pdf/1806.01822…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1405.6903/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item><item><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton — mentioned by gsf_emergency</title><link>https://news.ycombinator.com/item?id=43688816</link><guid isPermaLink="false">urn:hackerpapers:mention:1405.6903:43688816</guid><pubDate>Tue, 15 Apr 2025 03:49:01 GMT</pubDate><description>&lt;p&gt;By Jeeves, it&amp;#x27;s rentropy!! Sean and Stephen are absolutely thoughtful popularizers, but complexity, not entropy, is what they are truly interested in talking about. Although it doesn&amp;#x27;t make complexity less scary, here&amp;#x27;s something Sean&amp;#x27;s been working on for more than a decade. The paper seems to be more accessible to the layman than he thinks.. https://arxiv.org/abs/1405.6903 https://scottaaronson.blog/?p=762 [When practitioners say &amp;quot;entropy&amp;quot;, they mean RELATIVE ENTROPY, which is another can of worms.. rentropy is the one that is observer dependent: &amp;quot;That&amp;#x27;s Relative as in Relativity&amp;quot;. Entropy…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1405.6903/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item><item><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton — mentioned by gsf_emergency_2</title><link>https://news.ycombinator.com/item?id=43678784</link><guid isPermaLink="false">urn:hackerpapers:mention:1405.6903:43678784</guid><pubDate>Mon, 14 Apr 2025 07:07:24 GMT</pubDate><description>&lt;p&gt;Sean Carroll today&amp;#x27;s go-to person for GR has been working at popularizing these ideas (for more than 10 years(!)) https://arxiv.org/abs/1405.6903 &amp;gt;For example, our universe lacked complex structures at the Big Bang and will also lack them after black holes evaporate and particles are dispersed. See my comment below for link to Scott&amp;#x27;s preview.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1405.6903/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item><item><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton — mentioned by is_true</title><link>https://news.ycombinator.com/item?id=40398434</link><guid isPermaLink="false">urn:hackerpapers:mention:1405.6903:40398434</guid><pubDate>Sat, 18 May 2024 12:26:29 GMT</pubDate><description>&lt;p&gt;a backup just in case https://nlp.seas.harvard.edu/annotated-transformer/ https://scottaaronson.blog/?p=762 https://karpathy.github.io/2015/05/21/rnn-effectiveness/ https://colah.github.io/posts/2015-08-Understanding-LSTMs/ https://arxiv.org/pdf/1409.2329.pdf https://www.cs.toronto.edu/~hinton/absps/colt93.pdf https://arxiv.org/pdf/1506.03134.pdf https://proceedings.neurips.cc/paper_files/paper/2012/file/c... https://arxiv.org/pdf/1511.06391.pdf https://arxiv.org/pdf/1811.06965.pdf https://arxiv.org/pdf/1512.03385.pdf https://arxiv.org/pdf/1511.07122.pdf https://arxiv.org/pdf/1704.01212.pdf…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1405.6903/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item><item><title>Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton — HN submission</title><link>https://news.ycombinator.com/item?id=23479496</link><guid isPermaLink="false">urn:hackerpapers:submission:1405.6903:23479496</guid><pubDate>Wed, 10 Jun 2020 17:10:04 GMT</pubDate><description>&lt;p&gt;Quantifying the Rise and Fall of Complexity in Closed Systems&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/1405.6903/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cond-mat.stat-mech</category></item></channel></rss>
