Philosophy Dictionary of ArgumentsHome
| |||
|
| |||
| 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 | Concept | Summary/Quotes | Sources |
|---|---|---|---|
|
Gregory Chaitin on Decidability - Dictionary of Arguments
Genz II 217 Calculability/Chaitin: Thesis: Mathematics and physics are connected. If physics should lead to a non-calculable number, we would have to change our concept of calculability. >Calculability, >Non-calculability, >Decisions, >Decidability, >Decision theory, >Decision-making process, >Decision problem, >Mathematics, >Physics._____________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. Translations: Dictionary of Arguments The note [Concept/Author], [Author1]Vs[Author2] or [Author]Vs[term] resp. "problem:"/"solution:", "old:"/"new:" and "thesis:" is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition. |
Gz I H. Genz Gedankenexperimente Weinheim 1999 Gz II Henning Genz Wie die Naturgesetze Wirklichkeit schaffen. Über Physik und Realität München 2002 |
||
> Counter arguments against Chaitin
> Counter arguments in relation to Decidability
Ed. Martin Schulz, access date 2024-04-16