I recently submitted a link about "Robust First Computing". It didn't get any response, but I'll repeat the link and description here, since it's certainly esoteric, but has some extremely important properties.<p>Robust-First Computing: Distributed City Generation
<a href="https://www.youtube.com/watch?v=XkSXERxucPc" rel="nofollow">https://www.youtube.com/watch?v=XkSXERxucPc</a><p>A Movable Feast Machine [1] is a "Robust First" asynchronous distributed fault tolerant cellular-automata-like computer architecture.<p>The video "Distributed City Generation" [2] demonstrates how you can program a set of Movable Feast Machine rules that build a self-healing city that fills all available space with urban sprawl, and even repairs itself after disasters!<p>The paper "Local Routing in a new Indefinitely Scalable Architecture" [2] by Trent Small explains how those rules work, how the city streets adaptively learn how to route the cars to nearby buildings they desire to find, and illustrated the advantages of "Robust First" computing:<p>Abstract: Local routing is a problem which most of us face on a daily basis as we move around the cities we live in. This study proposes several routing methods based on road signs in a procedurally generated city which does not assume knowledge of global city structure and shows its overall efficiency in a variety of dense city environments. We show that techniques such as Intersection-Canalization allow for this method to be feasible for routing information arbitrarily on an architecture with limited resources.<p>This talk "Robust-first computing: Demon Horde Sort" [4] by Dave Ackley describes an inherently robust sorting machine, like "sorting gas", implemented with the open source Movable Feast Machine simulator, available on github [5].<p>A Movable Feast Machine is similar in many ways to traditional cellular automata, except for a few important differences that are necessary for infinitely scalable, robust first computing.<p>First, the rules are applied to cells in random order, instead of all at once sequentially (which requires double buffering). Many rule application events may execute in parallel, as long as their "light cones" or cells visible to the executing rules do not overlap.<p>Second, the "light cone" of a rules, aka the "neighborhood" in cellular automata terms, is larger than typical cellular automata, so the rule can see other cells several steps away.<p>Third, the rules have write access to all of the cells in the light cone, not just the one in the center like cellular automata rules. So they can swap cells around to enable mobile machines, which is quite difficult in cellular automata rules like John von Neumann's classic 29 state CA. [6] [7]<p>Forth, diffusion is built in. A rule may move the particle to another empty cell, or swap it with another particle in a different cell. And most rules automatically move the particle into a randomly chosen adjacent cell, by default. So the particles behave like gas moving with brownian motion, unless biased by "smart" rules like Maxwell's Demon, like the "sorting gas" described in the Demon Hoard Sort video.<p>In this video "Robust-first computing: Announcing ULAM at ECAL 2015" [8], David Ackley explains why "Robust First" computing and computing architectures like Movable Feast Machines are so incredibly important for scaling up incredibly parallel hardware.<p>I think this is incredibly important stuff in the long term, because we've hit the wall with determinism, and the demos are so mind blowing and visually breathtaking, that I want to try programming some of my own Movable Feast Machine systems!<p>[1] <a href="http://movablefeastmachine.org/" rel="nofollow">http://movablefeastmachine.org/</a><p>[2] <a href="https://www.youtube.com/watch?v=XkSXERxucPc" rel="nofollow">https://www.youtube.com/watch?v=XkSXERxucPc</a><p>[3] <a href="http://www.cs.unm.edu/~ackley/papers/paper_tsmall1_11_24.pdf" rel="nofollow">http://www.cs.unm.edu/~ackley/papers/paper_tsmall1_11_24.pdf</a><p>[4] <a href="https://www.youtube.com/watch?v=helScS3coAE" rel="nofollow">https://www.youtube.com/watch?v=helScS3coAE</a><p>[5] <a href="https://github.com/DaveAckley/MFM" rel="nofollow">https://github.com/DaveAckley/MFM</a><p>[6] <a href="https://en.wikipedia.org/wiki/Von_Neumann_cellular_automaton" rel="nofollow">https://en.wikipedia.org/wiki/Von_Neumann_cellular_automaton</a><p>[7] <a href="https://en.wikipedia.org/wiki/Von_Neumann_universal_constructor" rel="nofollow">https://en.wikipedia.org/wiki/Von_Neumann_universal_construc...</a><p>[8] <a href="https://www.youtube.com/watch?v=aR7o8GPgSLk" rel="nofollow">https://www.youtube.com/watch?v=aR7o8GPgSLk</a>