Turing machine
A Turing machine is a mathematical model of computation that defines an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed. The Turing machine was invented in 1936 by Alan Turing, who called it an "a-machine" (automatic machine). With this model, Turing was able to answer two questions in the negative:
known for
Wikipage disambiguates
1-bit computing1000 Blank White Cards19361936 in science1936 in the United Kingdom1937 in science2-EXPTIMEA-machineAC0AI-completeAIXIANTICA New Kind of ScienceA Universe of ConsciousnessAbstract machineAbstract state machineAckermann functionActor modelActual infinityAdian–Rabin theoremAdvice (complexity)Alan_TuringAlgorithmAlgorithm characterizationsAlgorithmic learning theoryAlonzo ChurchAnalysis of algorithmsAntoine DanchinArbitrary-precision arithmeticAreas of mathematicsArnold SchönhageAsynchronous cellular automatonAutomata-based programmingAutomata-based programming (Shalyto's approach)Automata theoryBPP (complexity)Beatrice WorsleyBekenstein boundBerry paradoxBinary combinatory logic
Link from a Wikipage to another Wikipage
primaryTopic
Turing machine
A Turing machine is a mathematical model of computation that defines an abstract machine that manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed. The Turing machine was invented in 1936 by Alan Turing, who called it an "a-machine" (automatic machine). With this model, Turing was able to answer two questions in the negative:
has abstract
A Máquina de Turing é um dispo ...... odelo de computador universal.
@pt
A Turing machine is a mathemat ...... of finite memory are ignored.
@en
Eine Turingmaschine ist ein ma ...... atiken definierbaren Sprachen.
@de
En Turingmaskin är en teoretis ...... inom den matematiska logiken.
@sv
En informatique théorique, une ...... ng (ils sont Turing-complets).
@fr
In de informatica is de turing ...... worden dus niet echt gebouwd.
@nl
In informatica una macchina di ...... uabili con macchine di Turing.
@it
La màquina de Turing és un mod ...... n la teoria de la complexitat.
@ca
Maszyna Turinga – stworzony pr ...... ć traktowana jako jej program.
@pl
Mesin Turing adalah model komp ...... si pita ke kiri atau ke kanan.
@in
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,025,733,987
Link from a Wikipage to another Wikipage
id
p/t094460
@en
title
Turing machine
@en
wikiPageUsesTemplate
subject
hypernym
comment
A Máquina de Turing é um dispo ...... r qualquer computador digital.
@pt
A Turing machine is a mathemat ...... two questions in the negative:
@en
Eine Turingmaschine ist ein ma ...... atiken definierbaren Sprachen.
@de
En Turingmaskin är en teoretis ...... kan tänkas som programmerbar.
@sv
En informatique théorique, une ...... hmique et de la calculabilité.
@fr
In de informatica is de turing ...... cheidungsproblem" uit 1936-37.
@nl
In informatica una macchina di ...... gere e/o scrivere dei simboli.
@it
La màquina de Turing és un mod ...... una màquina no podia resoldre.
@ca
Maszyna Turinga – stworzony pr ...... inga może być traktowana jako
@pl
Mesin Turing adalah model komp ...... bisa dilakukan oleh komputer."
@in
label
Macchina di Turing
@it
Machine de Turing
@fr
Maszyna Turinga
@pl
Maŝino de Turing
@eo
Mesin Turing
@in
Màquina de Turing
@ca
Máquina de Turing
@es
Máquina de Turing
@pt
Turing machine
@en
Turingen makina
@eu