Robust-first computing: Demon Horde Sort (full version)
3 人推荐 · 跨 6 个月 · 2015–2023
中文导读
Dave Ackley 在其自研的 Movable Feast Machine 模拟器中展示「恶魔部落排序（Demon Horde Sort）」的完整实况：一种把随机性与物理故障容忍写进底层的超强韧排序架构。
为什么 HN 推它
想要领略「强韧优先计算（Robust-first Computing）」魅力的绝佳入口，跳出传统易碎图灵机的思维定势，探讨去中心化与硬件容错的新可能。
「这思路虽然极其硬核小众，但它所揭示的计算机底层特性却无比重要。」HN 网友原话：it's certainly esoteric, but has some extremely important properties.
英文原摘要（HackerTube / Claude 整理）
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.
HN readers recommend it as the best introduction to robust-first computing, where randomness and fault tolerance are built into the architecture.
HN 上的提及
Cited for the simulation's shape as a simplified representation of a membrane.
Another interesting related field is Dave Ackley's Robustness-First Computing model[1]
describes an inherently robust sorting machine, like "sorting gas
it's certainly esoteric, but has some extremely important properties.
Here's a great example with an amazing demo and explanation