Why computational complexity may set impenetrable barriers for epistemic reductionism

Details

Ressource 1Download: Herzog & Doerig & Sachse (2023) - Why computational complexity may set impenetrable barriers for epistemic reductionism.pdf (920.04 [Ko])
State: Public
Version: Final published version
License: CC BY 4.0
Serval ID
serval:BIB_140F40A0C1B1
Type
Article: article from journal or magazin.
Collection
Publications
Institution
Title
Why computational complexity may set impenetrable barriers for epistemic reductionism
Journal
Synthese
Author(s)
Herzog Michael H., Doerig Adrien, Sachse Christian
ISSN
0039-7857 (print)
1573-0964 (electronic)
Publication state
Published
Issued date
24/10/2023
Peer-reviewed
Oui
Volume
202
Number
5
Language
english
Abstract
According to physicalism, everything is physical or metaphysically connected to the physical. If physicalism were true, it seems that we should – in principle – be able to reduce the descriptions and explanations of special sciences to physical ones, for example, explaining biological regularities, via chemistry, by the laws of particle physics. The multiple realization of the property types of the special sciences is often seen to be an obstacle to such epistemic reductions. Here, we introduce another, new argument against epistemic reduction. Based on mathematical complexity, we show that, under certain conditions, there can be “complexity barriers” that make epistemic reduction – in principle – unachievable even if physicalism were true.
Keywords
General Social Sciences, Philosophy
Web of science
Open Access
Yes
Funding(s)
University of Lausanne
Create date
31/01/2024 9:08
Last modification date
08/02/2024 8:16
Usage data