Why computational complexity may set impenetrable barriers for epistemic reductionism

2Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Herzog, M. H., Doerig, A., & Sachse, C. (2023). Why computational complexity may set impenetrable barriers for epistemic reductionism. Synthese, 202(5). https://doi.org/10.1007/s11229-023-04366-1

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free