|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. |
DennettVsPenrose: Penrose 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. The note [Author1]Vs[Author2] or [Author]Vs[term] is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition.
Darwin’s Dangerous Idea, New York 1995
Darwins gefährliches Erbe Hamburg 1997
Kinds of Minds, New York 1996
Spielarten des Geistes Gütersloh 1999
"COG: Steps towards consciousness in robots"
Bewusstein, Thomas Metzinger, Paderborn/München/Wien/Zürich 1996
"Animal Consciousness. What Matters and Why?", in: D. C. Dennett, Brainchildren. Essays on Designing Minds, Cambridge/MA 1998, pp. 337-350
Der Geist der Tiere, D Perler/M. Wild, Frankfurt/M. 2005