Why computational complexity may set impenetrable barriers for epistemic reductionism

Détails

Ressource 1Télécharger: Herzog & Doerig & Sachse (2023) - Why computational complexity may set impenetrable barriers for epistemic reductionism.pdf (920.04 [Ko])
Etat: Public
Version: Final published version
Licence: CC BY 4.0
ID Serval
serval:BIB_140F40A0C1B1
Type
Article: article d'un périodique ou d'un magazine.
Collection
Publications
Institution
Titre
Why computational complexity may set impenetrable barriers for epistemic reductionism
Périodique
Synthese
Auteur⸱e⸱s
Herzog Michael H., Doerig Adrien, Sachse Christian
ISSN
0039-7857 (print)
1573-0964 (electronic)
Statut éditorial
Publié
Date de publication
24/10/2023
Peer-reviewed
Oui
Volume
202
Numéro
5
Langue
anglais
Résumé
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.
Mots-clé
General Social Sciences, Philosophy
Web of science
Open Access
Oui
Financement(s)
Université de Lausanne
Création de la notice
31/01/2024 8:08
Dernière modification de la notice
08/02/2024 7:16
Données d'usage