## 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 | More concepts for author | |
---|---|---|---|

Dennett, Daniel | Turing-Machine | Dennett, Daniel | |

Genz, H. | Turing-Machine | Genz, H. | |

Putnam, Hilary | Turing-Machine | Putnam, Hilary | |

Searle, John R. | Turing-Machine | Searle, John R. | |

Ed. Martin Schulz, access date 2017-10-23 |