"Can machines think?" That's the core question legendary mathematician and computer scientist Alan Turing posed in October, 1950. Turing wanted to assess whether machines could imitate or exhibit ...

Here’s what you’ll learn when you read this story: The Busy Beaver number, or BB(n), represents a mathematical problem that tries to calculate the longest possible run-time of a Turing machine ...

Here we are in October, improbably enough, and while the leaves start to fall as the goblins begin to gather, Elliot and Dan took a break from the madness to talk about all the wonderful hacks that ...