How The Slowest Computer Programs Illuminate Math’s Fundamental Limits
- John Pavlus tl;dr: "The goal of the “busy beaver” game is to find the longest-running computer program." This is relevant to Turing machines. "The busy beaver game asks: given a certain number of rules, what’s the maximum number of steps that a Turing machine can take before halting?"featured in #220
Why Databases Use Ordered Indexes But Programming Uses Hash Tables
- Evan Jones tl;dr: Discussion on the lower level differences between hash maps and b-trees, when to use them, and why.featured in #165
Why Is Quicksort Better Than Other Sorting Algorithms In Practice?
- Alejandro Malleafeatured in #124