Philosophy Dictionary of ArgumentsHome  
 
TuringMachine  Philosophy Dictionary of Arguments  
TuringMachine: is a model by A.M. Turing (A.M. Turing, “On Computable Numbers, with an application to the decisionmaking problem”, Proceedings, London Mathematical Society, 230265 (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  More concepts for author  

Dennett, Daniel  TuringMachine  Dennett, Daniel  
Genz, Hennig  TuringMachine  Genz, Hennig  
Putnam, Hilary  TuringMachine  Putnam, Hilary  
Searle, John R.  TuringMachine  Searle, John R.  
