/John Pavlus

How The Slowest Computer Programs Illuminate Math’s Fundamental Limits 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