<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/1709.00268/</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/1709.00268/feed.xml" rel="self" type="application/rss+xml" /><item><title>Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity — mentioned by carapace</title><link>https://news.ycombinator.com/item?id=23448906</link><guid isPermaLink="false">urn:hackerpapers:mention:1709.00268:23448906</guid><pubDate>Sun, 07 Jun 2020 17:23:22 GMT</pubDate><description>&lt;p&gt;ORT (Only Read Title) and abstract so far but it reminds me: Cf. &amp;quot;Life as Evolving Software, Greg Chaitin at PPGC UFRGS&amp;quot; https://www.youtube.com/watch?v=RlYS_GiAnK8 &amp;gt; Few people remember Turing&amp;#x27;s work on pattern formation in biology (morphogenesis), but Turing&amp;#x27;s famous 1936 paper On Computable Numbers exerted an immense influence on the birth of molecular biology indirectly, through the work of John von Neumann on self-reproducing automata, which influenced Sydney Brenner who in turn influenced Francis Crick, the Crick of Watson and Crick, the discoverers of the molecular structure of DNA.…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1709.00268/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity — mentioned by carapace</title><link>https://news.ycombinator.com/item?id=18571878</link><guid isPermaLink="false">urn:hackerpapers:mention:1709.00268:18571878</guid><pubDate>Fri, 30 Nov 2018 19:29:53 GMT</pubDate><description>&lt;p&gt;Cf. &amp;quot;Life as Evolving Software, Greg Chaitin at PPGC UFRGS&amp;quot; https://www.youtube.com/watch?v=RlYS_GiAnK8 &amp;gt; Few people remember Turing&amp;#x27;s work on pattern formation in biology (morphogenesis), but Turing&amp;#x27;s famous 1936 paper On Computable Numbers exerted an immense influence on the birth of molecular biology indirectly, through the work of John von Neumann on self-reproducing automata, which influenced Sydney Brenner who in turn influenced Francis Crick, the Crick of Watson and Crick, the discoverers of the molecular structure of DNA. Furthermore, von Neumann&amp;#x27;s application of Turing&amp;#x27;s ideas to…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1709.00268/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity — HN submission</title><link>https://news.ycombinator.com/item?id=17737292</link><guid isPermaLink="false">urn:hackerpapers:submission:1709.00268:17737292</guid><pubDate>Fri, 10 Aug 2018 22:56:20 GMT</pubDate><description>&lt;p&gt;Algorithmically probable mutations reproduce aspects of evolution&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/1709.00268/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item><item><title>Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity — mentioned by carapace</title><link>https://news.ycombinator.com/item?id=17734380</link><guid isPermaLink="false">urn:hackerpapers:mention:1709.00268:17734380</guid><pubDate>Fri, 10 Aug 2018 15:45:53 GMT</pubDate><description>&lt;p&gt;If you like this see also [1], and Joy as well as Iota and Jot[2] (programming languages). And maybe &amp;quot;Algorithmically probable mutations reproduce aspects of evolution such as convergence rate, genetic memory, and modularity&amp;quot;: https://arxiv.org/abs/1709.00268v8 &amp;gt; In the context of his Metabiology programme, Gregory Chaitin, a founder of the theory of algorithmic information, introduced a theoretical computational model that evolves ‘organisms’ relative to their environment considerably faster than classical random mutation. While theoretically sound, the ideas had not been tested and further…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/1709.00268/"&gt;Paper and discussion history&lt;/a&gt;. A mention is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
