Ask the Chatbot Games & Quizzes History & Society Science & Tech Biographies Animals & Nature Geography & Travel Arts & Culture ProCon Money Videos
Turing computability
References
Britannica AI Icon

Turing computability

Written by
The Information Architects of Encyclopaedia Britannica

The Information Architects maintain a master list of the topics included in the corpus of  Encyclopædia Britannica, and create and manage the relationships between them.
The Information Architects of Encyclopaedia Britannica
Last updated

Quick Summary

Turing computability, introduced by Alan M. Turing in 1936, is a theoretical model of computation. It uses an abstract machine, the Turing machine, to define what it means for a problem to be solvable by an algorithm. This machine consists of an infinite tape, a read/write head, and a set of instructions. It can perform basic operations like reading, writing, and moving along the tape.

The concept of Turing computability is fundamental to computer science and helps determine if a problem can be solved algorithmically. It also underlies the study of computational complexity, which measures the resources an algorithm needs to run. The Turing machine's design influenced the development of all modern digital computers.512

Summary created from Britannica articles using AI. AI can make mistakes, so verify using Britannica articles.
5 Britannica Sources
  1. Turing machine
  2. history of artificial intelligence (AI) - Theoretical work
  3. history of logic - The Turing machine
  4. algorithm
  5. computational complexity

Ask Britannica AI about this topic

Britannica doesn't have a full article on this topic, so we've curated a list of our relevant coverage.