<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction · HackerPapers discussions</title><link>https://hackerpaper.kaipfister.de/p/2406.19108/</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/2406.19108/feed.xml" rel="self" type="application/rss+xml" /><item><title>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by a2x</title><link>https://news.ycombinator.com/item?id=49365615</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:49365615</guid><pubDate>Wed, 19 Aug 2026 18:48:14 GMT</pubDate><description>&lt;p&gt;Computational Life Reactor (CLR) is an interactive browser implementation by Alex Borger of the computational-life experiments studied by Agüera y Arcas and collaborators https://arxiv.org/abs/2406.19108. Random byte tapes are repeatedly paired and executed in the BFF language, allowing self-replicating programs to emerge without a fitness function or explicit selection process. CLR provides live population visualizations, frequency and compression measurements, and a step-by-step execution sampler. The simulation runs locally using WebAssembly and parallel browser workers. A great 12 minutes…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by lioeters</title><link>https://news.ycombinator.com/item?id=49153061</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:49153061</guid><pubDate>Mon, 03 Aug 2026 08:57:54 GMT</pubDate><description>&lt;p&gt;There have been experiments in &amp;quot;digital primordial soup&amp;quot;, where primitive programs are cultivated under conditions with evolutionary pressure. Computational Substrates: How Well-formed, Self-replicating Programs Emerge from Simple Interaction - https://arxiv.org/abs/2406.19108 Brainfuck, Forth, Subleq, and most recently Z80 assembly programs with mutations, interactions, and self-modification. Z80 has an LDIR instruction that copies a block of data from one location in memory to another, which allows the &amp;quot;organisms&amp;quot; to reach/discover reproduction quicker and more reliably in repeated…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by bob1029</title><link>https://news.ycombinator.com/item?id=48965744</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:48965744</guid><pubDate>Sun, 19 Jul 2026 07:32:21 GMT</pubDate><description>&lt;p&gt;See also: https://arxiv.org/abs/2406.19108 &amp;gt; We show that when random, non self-replicating programs are placed in an environment lacking any explicit fitness landscape, self-replicators tend to arise. We demonstrate how this occurs due to random interactions and self-modification, and can happen with and without background random mutations. We also show how increasingly complex dynamics continue to emerge following the rise of self-replicators.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by markisus</title><link>https://news.ycombinator.com/item?id=48963513</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:48963513</guid><pubDate>Sat, 18 Jul 2026 23:34:29 GMT</pubDate><description>&lt;p&gt;This is every cool research. Do you have any idea why the authors chose Z80 as the program language? I have seen other studies in the same spirit that use simpler toy languages like Brainfuck (https://arxiv.org/abs/2406.19108) and I wonder if you could get higher execution speed if you didn&amp;#x27;t have to execute so much emulator code. The programs/genomes are extremely tiny. I would be very interested to see what kind of hardware is needed to scale this approach up. How long until we can feed in giant corpuses of text and evolve these little organisms to predict the next letter?&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by bob1029</title><link>https://news.ycombinator.com/item?id=45945359</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:45945359</guid><pubDate>Sun, 16 Nov 2025 14:24:02 GMT</pubDate><description>&lt;p&gt;This paper? https://arxiv.org/abs/2406.19108 I&amp;#x27;ve read it many times. It introduced me to the idea of using self-modifying programs. I&amp;#x27;ve built several prototypes that use their exact instruction set, but I haven&amp;#x27;t found a way to guide the evolution in a desired direction yet. The self-modifying aspect can be quite destructive to the genome.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by bob1029</title><link>https://news.ycombinator.com/item?id=45782426</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:45782426</guid><pubDate>Sat, 01 Nov 2025 15:29:23 GMT</pubDate><description>&lt;p&gt;&amp;gt; The advent of large language models have made this type of content relatively easy to churn out on demand, and the majority of the review articles we receive are little more than annotated bibliographies, with no substantial discussion of open research issues. I have to agree with their justification. Since &amp;quot;Attention Is All You Need&amp;quot; (2017) I have seen maybe four papers with similar impact in the AI/ML space. The signal to noise ratio is really awful. If I had to pick a semi-related paper published since 2020 that I actually found interesting, it would have to be this one…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by bob1029</title><link>https://news.ycombinator.com/item?id=42395974</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:42395974</guid><pubDate>Thu, 12 Dec 2024 03:38:17 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2406.19108&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by bob1029</title><link>https://news.ycombinator.com/item?id=42141654</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:42141654</guid><pubDate>Thu, 14 Nov 2024 21:57:13 GMT</pubDate><description>&lt;p&gt;This sounds like something more up the alley of linear genetic programming. There are some very interesting experiments out there that utilize UTMs (BrainFuck, Forth, et. al.) [0,1,2]. I&amp;#x27;ve personally had some mild success getting these UTM variants to output their own children in a meta programming arrangement. The base program only has access to the valid instruction set of ~12 instructions per byte, while the task program has access to the full range of instructions and data per byte (256). By only training the base program, we reduce the search space by a very substantial factor. I think…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by bob1029</title><link>https://news.ycombinator.com/item?id=41628210</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:41628210</guid><pubDate>Mon, 23 Sep 2024 17:05:05 GMT</pubDate><description>&lt;p&gt;Brainfuck is largely a joke for most developers, but in certain kinds of research it is taken very seriously due to its ease of implementation. I think this is probably the most interesting paper involving it: https://arxiv.org/abs/2406.19108 &amp;gt; In this paper we take a step towards understanding how self-replicators arise by studying several computational substrates based on various simple programming languages and machine instruction sets.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by smusamashah</title><link>https://news.ycombinator.com/item?id=41328083</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:41328083</guid><pubDate>Fri, 23 Aug 2024 11:36:57 GMT</pubDate><description>&lt;p&gt;It&amp;#x27;s an implementation of Google&amp;#x27;s research https://arxiv.org/abs/2406.19108 Previous discussions: https://news.ycombinator.com/item?id=40820022 https://news.ycombinator.com/item?id=41080435 Since author hasn&amp;#x27;t setup a github.io link, you can try it using githack https://rawcdn.githack.com/znah/zff/3e58d9742681bc3358059052...&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by netcraft</title><link>https://news.ycombinator.com/item?id=41080736</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:41080736</guid><pubDate>Fri, 26 Jul 2024 17:59:41 GMT</pubDate><description>&lt;p&gt;previously: https://news.ycombinator.com/item?id=40820022 Link directly to the arxiv paper: https://arxiv.org/abs/2406.19108&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by raidicy</title><link>https://news.ycombinator.com/item?id=41080724</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:41080724</guid><pubDate>Fri, 26 Jul 2024 17:59:08 GMT</pubDate><description>&lt;p&gt;https://arxiv.org/abs/2406.19108 Here&amp;#x27;s a direct link to the paper. I have not read it yet but the abstract reminds me of a recent post discussing using brainfuck as a way to do program synthesis.&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — mentioned by Out_of_Characte</title><link>https://news.ycombinator.com/item?id=41035118</link><guid isPermaLink="false">urn:hackerpapers:mention:2406.19108:41035118</guid><pubDate>Mon, 22 Jul 2024 14:51:58 GMT</pubDate><description>&lt;p&gt;Synthetic and generated data might not be garbage. Consider random chess positions. Those are generated,yet there&amp;#x27;s an engine out there that has objectively a higher chance of winning from that position. There was also a paper on persistent computer programs after running random data iteratively over millions of cycles. This doesn&amp;#x27;t even have a &amp;#x27;goal&amp;#x27;. which by itself is very interesting because of how similar it feels to how organisms develop by the act of persisting after a few billion years. That is to say I largely agree with the premise that you can train and improve alot by absense of…&lt;/p&gt;&lt;p&gt;&lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — HN submission</title><link>https://news.ycombinator.com/item?id=40837692</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.19108:40837692</guid><pubDate>Sun, 30 Jun 2024 15:22:07 GMT</pubDate><description>&lt;p&gt;Computational Life: How Self-Replicating Programs Emerge from Simple Interaction&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;4 points; 0 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&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>Computational Life: How Well-formed, Self-replicating Programs Emerge from Simple Interaction — HN submission</title><link>https://news.ycombinator.com/item?id=40820022</link><guid isPermaLink="false">urn:hackerpapers:submission:2406.19108:40820022</guid><pubDate>Fri, 28 Jun 2024 12:36:00 GMT</pubDate><description>&lt;p&gt;Computational Life: How self-replicating programs emerge from simple interaction&lt;/p&gt;&lt;p&gt;&lt;/p&gt;&lt;p&gt;141 points; 17 discussion replies on HN. &lt;a href="https://hackerpaper.kaipfister.de/p/2406.19108/"&gt;Paper and source history&lt;/a&gt;. A submission is not an endorsement.&lt;/p&gt;</description><category>cs.NE</category></item></channel></rss>
