Turing machine

Show Summary Details

Quick Reference

A theoretical machine which operates according to extremely simple rules, invented by Turing with the aim of obtaining a mathematically precise definition of what is ‘computable’. It has been generally agreed that the machine can calculate or compute anything for which there is an ‘effective’ algorithm. The resulting understanding of computability has been shown to be equivalent to other attempts at defining the concept.

Subjects: Computing.

Reference entries

See all related reference entries in Oxford Index »

Users without a subscription are not able to see the full content. Please, subscribe or login to access all content.