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

2 Citations (Scopus)

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 favor, limitative explanations are a kind of non-causal mathematical explanation which depend on highly idealized models of computation.

Original language	English
Pages (from-to)	1079-1088
Number of pages	10
Journal	Philosophy of Science
Volume	90
Issue number	5
Early online date	16 Feb 2023
DOIs	https://doi.org/10.1017/psa.2023.26 https://doi.org/10.1017/psa.2023.26
Publication status	Published - 16 Dec 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.

Publisher Copyright: © The Author(s), 2023. Published by Cambridge University Press on behalf of the Philosophy of Science Association.

Funding

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.26Licence: CC BY
10.1017/psa.2023.26

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 favor, 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. Publisher Copyright: {\textcopyright} The Author(s), 2023. Published by Cambridge University Press on behalf of the Philosophy of Science Association.",

year = "2023",

month = dec,

day = "16",

doi = "10.1017/psa.2023.26",

language = "English",

volume = "90",

pages = "1079--1088",

journal = "Philosophy of Science",

issn = "0031-8248",

publisher = "Cambridge University Press",

number = "5",

}

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. Publisher Copyright: © The Author(s), 2023. Published by Cambridge University Press on behalf of the Philosophy of Science Association.

PY - 2023/12/16

Y1 - 2023/12/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 favor, 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 favor, limitative explanations are a kind of non-causal mathematical explanation which depend on highly idealized models of computation.

UR - http://www.scopus.com/inward/record.url?scp=85173965748&partnerID=8YFLogxK

U2 - 10.1017/psa.2023.26

DO - 10.1017/psa.2023.26

M3 - Journal Article (refereed)

SN - 0031-8248

VL - 90

SP - 1079

EP - 1088

JO - Philosophy of Science

JF - Philosophy of Science

IS - 5

ER -

Mathematical Explanation in Computer Science

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Philosophy of Contemporary and Future Science

Cite this

Mathematical Explanation in Computer Science

Abstract

Bibliographical note

Funding

Access to Document

Other files and links

Fingerprint

Projects

Philosophy of Contemporary and Future Science

Cite this