Philosophy Lexicon of Arguments

Turing-Machine: is a model by A.M. Turing (A.M. Turing, “On Computable Numbers, with an application to the decision-making problem”, Proceedings, London Mathematical Society, 230-265 (1936)), which reproduces the process of character manipulation according to simple rules and thus makes it possible to investigate. A Turing machine can, in principle, calculate everything which is calculable. See also model, formal language, system, computability, decidability, holding problem, Church Turing Thesis.

Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments.
Author Item Excerpt Meta data

Books on Amazon
I 623
DennettVsPenrose: he says that the brain is no Turing machine, but he does not say that the brain is not well reproduced by a Turing machine.

Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution.

Den I
D. Dennett
Darwins gefährliches Erbe Hamburg 1997

Den II
D. Dennett
Spielarten des Geistes Gütersloh 1999

> Counter arguments against Dennett

> Suggest your own contribution | > Suggest a correction | > Export as BibTeX Datei
Ed. Martin Schulz, access date 2017-06-23