Abstract
In recent years two different axiomatic characterizations of the intuitive concept of effective calculability have been proposed, one by Sieg and the other by Dershowitz and Gurevich. Analyzing them from the perspective of Carnapian explication, I argue that these two characterizations explicate the intuitive notion of effective calculability in two different ways. I will trace back these two ways to Turing's and Kolmogorov's informal analyses of the intuitive notion of calculability and to their respective outputs: the notion of computorability and the notion of algorithmability. I will then argue that, in order to adequately capture the conceptual differences between these two notions, the classical two-step picture of explication is not enough. I will present a more fine-grained three-step version of Carnapian explication, showing how with its help the difference between these two notions can be better understood and explained.
Dokumententyp: | Zeitschriftenartikel |
---|---|
Fakultät: | Philosophie, Wissenschaftstheorie und Religionswissenschaft |
Themengebiete: | 100 Philosophie und Psychologie > 100 Philosophie |
ISSN: | 1879-4912 |
Sprache: | Englisch |
Dokumenten ID: | 97644 |
Datum der Veröffentlichung auf Open Access LMU: | 05. Jun. 2023, 15:26 |
Letzte Änderungen: | 05. Jun. 2023, 15:26 |