Curtis-Trudel, Andre E (2022) Mathematical Explanation in Computer Science. In: UNSPECIFIED.
|
Text
limitative-psa-2022.pdf Download (163kB) | Preview |
Abstract
This note scouts a broad class of explanations of central importance to contemporary computer science. These explanations, which I call limitative explanations, explain why certain problems cannot be solved computationally. Limitative explanations are philosophically rich, but have not received the attention they deserve. The primary goals of this note are to isolate limitative explanations and provide a preliminary account of what makes them explanatory. On the account I favour, limitative explanations are best understood as non-causal mathematical explanations which depend on highly idealized models of computation.
Export/Citation: | EndNote | BibTeX | Dublin Core | ASCII/Text Citation (Chicago) | HTML Citation | OpenURL |
Social Networking: |
Item Type: | Conference or Workshop Item (UNSPECIFIED) | ||||||
---|---|---|---|---|---|---|---|
Creators: |
|
||||||
Keywords: | Computation, explanation, idealization | ||||||
Subjects: | Specific Sciences > Computation/Information Specific Sciences > Computer Science General Issues > Explanation |
||||||
Depositing User: | Andre E Curtis-Trudel | ||||||
Date Deposited: | 29 Jul 2022 14:59 | ||||||
Last Modified: | 29 Jul 2022 14:59 | ||||||
Item ID: | 20976 | ||||||
Subjects: | Specific Sciences > Computation/Information Specific Sciences > Computer Science General Issues > Explanation |
||||||
Date: | 27 July 2022 | ||||||
URI: | https://philsci-archive.pitt.edu/id/eprint/20976 |
Monthly Views for the past 3 years
Monthly Downloads for the past 3 years
Plum Analytics
Actions (login required)
View Item |