Making Progress on Beavers, AI, and Math
by Jonathan Kujawa Nearly two years ago we talked at 3QD about the Busy Beaver problem [1]. Since then, the beavers have been busy. As discussed in that essay, the Busy Beaver problem measures how complicated a computation might be. It does so by measuring how long a Turing might run before stopping. A Turing machine…