hackertube.io

Robust-first computing: Demon Horde Sort (full version)

Dave Ackley · demo · Watch on YouTube

Computer architecture & CPUsAlgorithms & data structuresCreative coding & generative art

What it is

Dave Ackley demonstrates the Demon Horde Sort, an inherently robust sorting machine running in his Movable Feast Machine simulator. This is the uncut version with all details and side thoughts.

Why Hacker News recommends it

HN readers recommend it as the best introduction to robust-first computing, where randomness and fault tolerance are built into the architecture.

  • 3 people recommended it
  • 6 different months
  • 2 strong recommendations
  • first 2015, last 2023

What HN commenters said

  1. “describes an inherently robust sorting machine, like "sorting gas”

    Talk on an inherently robust sorting machine in the Movable Feast Machine simulator.

    DonHopkins, 2017-05 · Strong recommendation · in “Robust-First Computing: Distributed City Generation (2015) [video]”

  2. “Another interesting related field is Dave Ackley's Robustness-First Computing model[1]”

    Ackley's robustness-first model with randomness built into each cell.

    Kapura, 2015-12 · Recommendation · in “It Probably Works: Probabilistic algorithms are all around us”

  3. “I think this video explained the general idea quite well”

    Explains the general idea of asynchronous cellular automata on tiles.

    camel-cdr, 2023-01 · Recommendation · in “Artificial Life Creation T-0 and Launching”

Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.

Topics: movable feast machine, robustness, cellular automata, spatial computing, sorting

Also recommended by the same people