Understanding observed complex systems – the hard complexity problem
| Abstract | bruce@edmonds.name http://bruce.edmonds.name Abstract. Two kinds of problem are distinguished: the first of finding processes which produce complex outcomes from the interaction of simple parts, and the second of finding which process resulted in an observed complex outcome. The former I call the easy complexity problem and the later the hard complexity problem. It is often assumed that progress with the easy problem will aid process with the hard problem. However this assumes that the “reverse engineering” problem, of determining the process from the outcomes is feasible. Taking a couple of simple models of reverse engineering, I show that this task is infeasible in the general case. Hence it cannot be assumed that reverse engineering is possible, and hence that most of the time progress on the easy problem will not help with the hard problem unless there are special properties of a particular set of processes that make it feasible. Assuming that complexity science is not merely an academic “game” and given the analysis of this paper, some criteria for the kinds of paper that have a reasonable chance of being eventually useful for understanding observed complex systems are outlined. Many complexity papers do not fare well against these critieria. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesJacek Hawranek & Jan Zygmunt (1981). On the Degree of Complexity of Sentential Logics. A Couple of Examples. Studia Logica 40 (2):141 - 153.
Carlos Gershenson & Francis Heylighen (2004). How Can We Think the Complex? In [Book Chapter] (Unpublished).
Claus Emmeche (1997). Aspects of Complexity in Life and Science. Philosophica 59.
Marcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. The Bulletin of Symbolic Logic 13:281--282.
Richard M. Burian (1997). Comments on Complexity and Experimentation in Biology. Philosophy of Science 64 (4):291.
W. Bentley MacLeod (1998). Is Multi-Tasking Complex? Behavioral and Brain Sciences 21 (6):840-841.
Analytics
Monthly downloads |
Added to index2009-10-01Total downloads27 ( #45,835 of 549,252 )Recent downloads (6 months)0How can I increase my downloads? |
My notes
Discussion
