Deterministic chaos and computational complexity: The case of methodological complexity reductions [Book Review]

Abstract

Some problems rarely discussed in traditional philosophy of science are mentioned: The empirical sciences using mathematico-quantitative theoretical models are frequently confronted with several types of computational problems posing primarily methodological limitations on explanatory and prognostic matters. Such limitations may arise from the appearances of deterministic chaos and high computational complexity in general. In many cases, however, scientists circumvent such limitations by utilizing reductional approximations or complexity reductions for intractable problem formulations, thus constructing new models which are computationally tractable. Such activities are compared with reduction types established in philosophy of science

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,856

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
46 (#250,558)

6 months
1 (#386,016)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Effective Complexity: In Which Sense is It Informative?Esteban Céspedes & Miguel Fuentes - 2020 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 51 (3):359-374.
Zwischen Berechenbarkeit Und Nichtberechenbarkeit. Die Thematisierung der Berechenbarkeit in der Aktuellen Physik Komplexer Systeme.Jan C. Schmidt - 2003 - Journal for General Philosophy of Science / Zeitschrift für Allgemeine Wissenschaftstheorie 34 (1):99-131.

Add more citations