On Saturday, British mathematician Alan Turing would have turned 100 years old. It is barely fathomable to think that none of the computing power surrounding us today was around when he was born. But ...

Do computers think? Some experts say yes, some say no. —Time magazine, Jan. 23, 1950 How do we tell whether a machine thinks? Much of today’s discussion of the matter starts with British computer ...

Turing machines are widely believed to be universal, in the sense that any computation done by any system can also be done by a Turing machine. In a new article, researchers present their work ...

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 ...