<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>DonHopkins</author><text>Also check out the &amp;quot;Moveable Feast Machine&amp;quot;, Robust-first Computing, and this Distributed City Generation example:&lt;p&gt;&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=21858577&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=21858577&lt;/a&gt;&lt;p&gt;DonHopkins on Oct 26, 2017 | parent | favorite | on: Cryptography with Cellular Automata (1985) [pdf]&lt;p&gt;A &amp;quot;Moveable Feast Machine&amp;quot; is a &amp;quot;Robust First&amp;quot; asynchronous distributed fault tolerant cellular-automata-like computer architecture. It&amp;#x27;s similar to a Cellular Automata, but it different in several important ways, for the sake of &amp;quot;Robust First Computing&amp;quot;. These differences give some insight into what CA really are, and what their limitations are.&lt;p&gt;Cellular Automata are synchronous and deterministic, and can only modify the current cell: all cells are evaluated at once (so the evaluation order doesn&amp;#x27;t matter), so it&amp;#x27;s necessary to double buffer the &amp;quot;before&amp;quot; and &amp;quot;after&amp;quot; cells, and the rule can only change the value of the current (center) cell. Moveable Feast Machines are like asynchronous non-deterministic cellular automata with large windows that can modify adjacent cells.&lt;p&gt;Here&amp;#x27;s a great example with an amazing demo and explanation, and some stuff I posted about it earlier:&lt;p&gt;&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=14236973&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;news.ycombinator.com&amp;#x2F;item?id=14236973&lt;/a&gt;&lt;p&gt;Robust-first Computing: Distributed City Generation:&lt;p&gt;&lt;a href=&quot;https:&amp;#x2F;&amp;#x2F;www.youtube.com&amp;#x2F;watch?v=XkSXERxucPc&quot; rel=&quot;nofollow&quot;&gt;https:&amp;#x2F;&amp;#x2F;www.youtube.com&amp;#x2F;watch?v=XkSXERxucPc&lt;/a&gt;</text><parent_chain></parent_chain></comment><story><title>Growing Neural Cellular Automata: A Differentiable Model of Morphogenesis</title><url>https://distill.pub/2020/growing-ca/?/</url></story>
<instructions>Your goal is to analyze the following comment and estimate how highly it will be upvoted by the Hacker News community.</instructions><comment><author>eyvindn</author><text>One of the authors here.&lt;p&gt;Feel free to ask any questions!&lt;p&gt;We encourage you to play with the attached Colab with which you can train models from scratch in &amp;lt;30min.</text><parent_chain></parent_chain></comment><story><title>Growing Neural Cellular Automata: A Differentiable Model of Morphogenesis</title><url>https://distill.pub/2020/growing-ca/?/</url></story>