## Philosophy Lexicon of Arguments | |||

| |||

Calculability: here, we are concerned with the question whether certain operations can be performed in principle by means of a procedure or whether questions can be answered by a method. In particular, we are concerned with the calculation of mathematical functions in finite time. The question of whether a problem can be calculated is only useful relative to a model. See also complex/complexity, Turing machine, decidability, decision theory, decision problem, holding problem, models, algorithms, completeness, incompleteness, Church-Turing Thesis, Turing-Machine._____________ 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 | |
---|---|---|---|

Church, Alonzo | Calculability | Church, Alonzo | |

Herbrand, J. | Calculability | Herbrand, J. | |

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