6 févr. 1936 - Turing Machine

Description:

A Turing machine is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules. Its more abstract meaning is a mathematical logic machine that can be seen as the ultimate powerful logical machine equivalent to any finite logical mathematical process. Proposed by Alan Turing, father of Computer Science.

1.This is today taught to all computer science undergraduates in a Theory of Computation class.

2. Turing machines always served as great theoretical abstract models of computing devices on which one can easily analyze aspects of computation (at least much more easier than can be done with real-world machines). And since anything that can be computed by a real machine can also be computed by a Turing machine, limitations that hold on Turing machines also provably apply to our real-world machines.

3.These models gave rise to a lot of theoretical analyses that resulted in a profound understanding of aspects of 'computability'.

Ajouté au bande de temps:

Date: