Mathematical Explanation in Computer Science

André CURTIS-TRUDEL

doi:10.1017/psa.2023.26

Mathematical Explanation in Computer Science

André CURTIS-TRUDEL^*

^*Corresponding author for this work

Lingnan University

Research output: Journal Publications › Journal Article (refereed) › peer-review

Abstract

This note scouts a broad but underexplored class of explanations found in 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 a kind of non-causal mathematical explanation which depend on highly idealized models of computation.

Original language	English
Journal	Philosophy of Science
DOIs	https://doi.org/10.1017/psa.2023.26
Publication status	E-pub ahead of print - 16 Feb 2023

Bibliographical note

Thanks to Soyeong An, Zoe Ashton, Chris Pincock, Lisa Shabel, Richard Samuels, Stewart Shapiro, John Symons, and audiences at Western University and the Method, Theory, and Reality workshop for questions and discussion. Work on this paper was partially supported by a Senior Research Fellowship award from the Research Grants Council of the Hong Kong SAR, China (‘Philosophy of Contemporary and Future Science’, Project no. SRFS2122-3H01).

Access to Document

10.1017/psa.2023.26

https://www.cambridge.org/core/product/identifier/S0031824823000260/type/journal_article

Philosophy of Contemporary and Future Science
ROWBOTTOM, D. P.
Research Grants Council (HKSAR)
1/01/22 → 31/12/26
Project: Grant Research

Cite this

@article{1060af2fbefd48638a96a7cfa5989f01,

title = "Mathematical Explanation in Computer Science",

abstract = "This note scouts a broad but underexplored class of explanations found in 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 a kind of non-causal mathematical explanation which depend on highly idealized models of computation.",

author = "Andr{\'e} CURTIS-TRUDEL",

note = "Thanks to Soyeong An, Zoe Ashton, Chris Pincock, Lisa Shabel, Richard Samuels, Stewart Shapiro, John Symons, and audiences at Western University and the Method, Theory, and Reality workshop for questions and discussion. Work on this paper was partially supported by a Senior Research Fellowship award from the Research Grants Council of the Hong Kong SAR, China ({\textquoteleft}Philosophy of Contemporary and Future Science{\textquoteright}, Project no. SRFS2122-3H01).",

year = "2023",

month = feb,

day = "16",

doi = "10.1017/psa.2023.26",

language = "English",

journal = "Philosophy of Science",

issn = "0031-8248",

publisher = "University of Chicago",

}

TY - JOUR

T1 - Mathematical Explanation in Computer Science

AU - CURTIS-TRUDEL, André

N1 - Thanks to Soyeong An, Zoe Ashton, Chris Pincock, Lisa Shabel, Richard Samuels, Stewart Shapiro, John Symons, and audiences at Western University and the Method, Theory, and Reality workshop for questions and discussion. Work on this paper was partially supported by a Senior Research Fellowship award from the Research Grants Council of the Hong Kong SAR, China (‘Philosophy of Contemporary and Future Science’, Project no. SRFS2122-3H01).

PY - 2023/2/16

Y1 - 2023/2/16

N2 - This note scouts a broad but underexplored class of explanations found in 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 a kind of non-causal mathematical explanation which depend on highly idealized models of computation.

AB - This note scouts a broad but underexplored class of explanations found in 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 a kind of non-causal mathematical explanation which depend on highly idealized models of computation.

U2 - 10.1017/psa.2023.26

DO - 10.1017/psa.2023.26

M3 - Journal Article (refereed)

SN - 0031-8248

JO - Philosophy of Science

JF - Philosophy of Science

ER -

Mathematical Explanation in Computer Science

Abstract

Bibliographical note

Access to Document

Fingerprint

Projects

Philosophy of Contemporary and Future Science

Cite this