### Some articles on *turing*:

Multi-track

... This will prove that a two-track

**Turing**Machine - Proof of Equivalency To Standard**Turing**Machine... This will prove that a two-track

**Turing**machine is equivalent to a standard**Turing**machine ... This can be generalized to a n-track**Turing**machine ... Let M= be standard**Turing**machine that accepts L ...**Turing**Test (disambiguation)

... The

**Turing**test is a way of considering the question of whether machines can think, proposed by Alan

**Turing**... The

**Turing**Test may also refer to The

**Turing**Test (Doctor Who), a Doctor Who novel featuring Alan

**Turing**as a character The

**Turing**Test, a chamber opera composed by Julian ...

Computer Game Bot

... The Computer Game Bot

**Turing**Test... The Computer Game Bot

**Turing**Test is a variant of the**Turing**Test, where a human judge viewing and interacting with a virtual world must distinguish between other humans ...Super-recursive Algorithm - Relation To The Church–

... The Church–

**Turing**Thesis... The Church–

**Turing**thesis in recursion theory relies on a particular definition of the term algorithm ... in recursion theory, Burgin argues that super-recursive algorithms, such as inductive**Turing**machines disprove the Church–**Turing**thesis ...The Annotated

... The Annotated

**Turing**... The Annotated

**Turing**A Guided Tour Through Alan**Turing**’s Historic Paper on Computability and the**Turing**Machine is a book by Charles Petzold, published in 2008 by John Wiley Sons, Inc ... Petzold annotates Alan**Turing**'s paper "On Computable Numbers, with an Application to the Entscheidungsproblem" ... The book takes readers sentence by sentence through**Turing**'s paper, providing explanations, further examples, corrections, and biographical information ...