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
Keywords deterministic chaos  computational complexity  effective complexity reduction
Categories (categorize this paper)
DOI 10.1023/A:1008376425565
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 45,629
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
42 ( #210,164 of 2,280,716 )

Recent downloads (6 months)
4 ( #316,679 of 2,280,716 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature