Philosophy Lexicon of Arguments

Decidability: a question, for example, whether a property applies to an object or not, is decidable if a result can be achieved within a finite time. For this decision process, an algorithm is chosen as a basis. See also halting problem, algorithms, procedures, decision theory.

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
Genz II 217
Berechenbarkeit/Chaitin: These: Mathematik und Physik stehen in einer Verbindung. Sollte die Physik auf eine nicht berechenbare Zahl führen, müssten wir unsern Begriff von Berechenbarkeit ändern.

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.

Gz I
H. Genz
Gedankenexperimente Weinheim 1999

Henning Genz
Wie die Naturgesetze Wirklichkeit schaffen. Über Physik und Realität München 2002

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