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

Alan Turing’s work laid the foundation for modern artificial intelligence, particularly through his concept of the Turing Test, which evaluates a machine’s ability to exhibit human-like behaviour.

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

The goal of the “busy beaver” game is to find the longest-running computer program. Its pursuit has surprising connections to some of the most profound questions and concepts in mathematics.