SignalTubeHN

demo · HACKER NEWS RECOMMENDATION

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

Dave Ackley · 3 HN recommenders · 6 recommendation months

YouTube

Recommended by 3 Hacker News commenters across 6 months (2015–2023).

SignalTube analysis

Among 19 other demo videos tagged Computer architecture & CPUs, the mean is 1.3 distinct HN recommenders. This video has 3 distinct HN recommenders, about 2.4× that mean. Recommendations span 6 distinct months, longer than the peer average of 1.3 months. This is a data-derived comparison, not a human review or quality rating.

78% of its 9 labeled comments are marked as recommendations or strong recommendations. HN mention years are 2015–2023; those years describe discussion history, not upload date. Its verified runtime is 27 minutes 13 seconds. YouTube lists its publication date as 2013-01-31.

Channel / speaker
Dave Ackley
Verified runtime
27m 13s
YouTube upload date
2013-01-31
Hacker News mention years
2015–2023

SAME TOPIC AND FORMAT

Compare with related videos

19 peers

The comparison cohort uses other demo videos in Computer architecture & CPUs. “Shared recommenders” counts HN users who recommended both videos in the source graph.

VideoHN recommendersRecommendation monthsPositive label shareShared recommendersRuntimeUpload date
Robust-first computing: Demon Horde Sort (full version)Current video3678%—27m 13s2013-01-31
NaN Gates and Flip FLOPSdemo · suckerpinch7789%No recorded overlap19m 8s2019-04-01
Samsung SSD Awesomenessdemo · ssdawesome3375%No recorded overlap4m 13s2009-03-02
Living Computation: Robust-first programming in ULAMdemo · Dave Ackley2250%1 (33%)15m 3s2015-09-08

THREE SOURCE-BASED CONTEXT POINTS

Why Hacker News recommends it

9 mentions

Each note combines the dataset’s stance label and short rationale; comment bodies are not reproduced. Open the HN source for the original discussion.

The archive classifies this as a recommendation in “Artificial Life Creation T-0 and Launching”. Its short rationale: Explains the general idea of asynchronous cellular automata on tiles.

reference2020-03Original HN comment ↗

The archive classifies this as a contextual reference in “Self Replicating Computer Programs”. Its short rationale: Source where the commenter first learned of the movable feast machine.

The archive classifies this as a recommendation in “Can Programming Be Liberated from the von Neumann Style? (1977) [pdf]”. Its short rationale: Reposted explanation of robust-first computing with demo and talk links.