David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
email@example.com 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)|
No categories specified
(categorize this paper)
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library||
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
Jacek Hawranek & Jan Zygmunt (1981). On the Degree of Complexity of Sentential Logics. A Couple of Examples. Studia Logica 40 (2):141 - 153.
W. Bentley MacLeod (1998). Is Multi-Tasking Complex? Behavioral and Brain Sciences 21 (6):840-841.
Richard M. Burian (1997). Comments on Complexity and Experimentation in Biology. Philosophy of Science 64 (4):291.
Marcin Mostowski & Jakub Szymanik (2007). Computational Complexity of Some Ramsey Quantifiers in Finite Models. Bulletin of Symbolic Logic 13:281--282.
Carlos Maldonado, The Study of Complex Systems and the Question Concerning the Philosophy of Knowledge.
Claus Emmeche (1997). Aspects of Complexity in Life and Science. Philosophica 59.
Carlos Gershenson & Francis Heylighen (2004). How Can We Think the Complex? In [Book Chapter] (Unpublished).
Added to index2009-10-01
Total downloads29 ( #63,451 of 1,100,145 )
Recent downloads (6 months)2 ( #190,012 of 1,100,145 )
How can I increase my downloads?