🚰 This post is a continuation of “Halt, Quasihalt, Recur”. 🚰| Something Something Programming
The goal of the Busy Beaver contest is to find n-state k-color Turing machine programs that run for as long as possible before halting. It’s basically an optimization problem: what is the longest finite computation that can squeezed out of a program of a certain length? Or from the flip-side: how much description can be packed into a program of a certain length?| Something Something Programming