Alan Turing was one of the most influential British figures of the 20th century. In 1936, Turing invented the computer as part of his attempt to solve a fiendish puzzle known as the ...

One of the problems with a classic Turing machine is the tape must be infinitely long. [Mark’s] Turing Ring still doesn’t have an infinite tape, but it does make it circular to save space. That along ...

Author's rendition of a basic Turing test set-up. Sitting in between two agents (one human and one machine), a person needs to interact with both agents and determine (correctly) which is a machine.

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

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