David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
Minds and Machines 19 (4):465-475 (2009)
In Darwin’s Dangerous Idea, Daniel Dennett claims that evolution is algorithmic. On Dennett’s analysis, evolutionary processes are trivially algorithmic because he assumes that all natural processes are algorithmic. I will argue that there are more robust ways to understand algorithmic processes that make the claim that evolution is algorithmic empirical and not conceptual. While laws of nature can be seen as compression algorithms of information about the world, it does not follow logically that they are implemented as algorithms by physical processes. For that to be true, the processes have to be part of computational systems. The basic difference between mere simulation and real computing is having proper causal structure. I will show what kind of requirements this poses for natural evolutionary processes if they are to be computational.
|Keywords||physical computation algorithmic process evolution algorithmic information theory Dennett simulation|
|Categories||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
Daniel C. Dennett & Jon Hodge (1997). Darwin's Dangerous Idea: Evolution and the Meanings of Life. British Journal for the Philosophy of Science 48 (3):435-438.
Robert C. Cummins (1975). Functional Analysis. Journal of Philosophy 72 (November):741-64.
Larry Wright (1973/1994). Functions. Philosophical Review 82 (2):139-168.
Citations of this work BETA
No citations found.
Similar books and articles
Paco Calvo & John Symons, Radical Embodiment and Morphological Computation: Against the Autonomy of (Some) Special Sciences.
Nir Fresco (2013). Information Processing as an Account of Concrete Digital Computation. Philosophy and Technology 26 (1):31-60.
Wayne Aitken & Jeffrey A. Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
Jeffrey Barrett (2007). Stability and Paradox in Algorithmic Logic. Journal of Philosophical Logic 36 (1):61 - 95.
W. J. (2003). Algorithmic Randomness in Empirical Data. Studies in History and Philosophy of Science Part A 34 (3):633-646.
Marcin Miłkowski (2007). Is Computationalism Trivial? In Gordana Dodig Crnkovic & Susan Stuart (eds.), Computation, Information, Cognition: The Nexus and the Liminal. Cambridge Scholars Press
Michiel Van Lambalgen (1989). Algorithmic Information Theory. Journal of Symbolic Logic 54 (4):1389 - 1400.
Oron Shagrir (1997). Two Dogmas of Computationalism. Minds and Machines 7 (3):321-44.
Added to index2009-11-20
Total downloads129 ( #16,096 of 1,725,256 )
Recent downloads (6 months)25 ( #37,964 of 1,725,256 )
How can I increase my downloads?