The British mathematician and pioneer of computing Alan Turing published a paper in 1936 which described a Universal Machine, a theoretical model of a computer processor that would later become known ...

The legendary computer scientist outlined the foundations for many of the technologies we use today ...

However, there's a problem with this, which I can't resolve. Anyone who's done a computing machinery course will have heard of the Halting Problem, or Self Applicability, or some variant thereof.

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.

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 man who helped crack the Enigma code has been honoured with his very own Google doodle. Alan Turing, known as the father of modern computing, was born 100 years ago today. He helped develop the ...

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

Over 70 years ago, Alan Turing's "imitation game" revolutionized how we assess machine intelligence, shifting focus from abstract thought to conversational ability. This simple test, where a machine ...

Artificially intelligent programs such as Xiaoice, a humanlike “companion” chatbot popular in China, can trick people into thinking they have minds and feelings of their own. (Yan Cong for The ...