Equation or Algorithm: Differences and Choosing Between Them

Acta Biotheoretica 59 (1):67-79 (2010)
  Copy   BIBTEX

Abstract

The issue of whether formal reasoning or a computing-intensive approach is the most efficient manner to address scientific questions is the subject of some considerable debate and pertains not only to the nature of the phenomena and processes investigated by scientists, but also the nature of the equation and algorithm objects they use. Although algorithms and equations both rely on a common background of mathematical language and logic, they nevertheless possess some critical differences. They do not refer to the same level of symbolization, as equations are based on integrated concepts in a denotational manner, while algorithms specifically break down a complex problem into more elementary operations, in an operational manner. They may therefore be considered as suited to the representation of different phenomena. Specifically, algorithms are by nature sufficient to represent weak emergent phenomena, but not strong emergent patterns, while equations can do both. Finally, the choice between equations and algorithms are by nature sufficient to represent weak emergent phenomena, but not strong emergent patterns, while equations behave conversely. We propose a simplified classification of scientific issues for which both equation- and/or algorithm-based approaches can be envisaged, and discuss their respective pros and cons. We further discuss the complementary and sometimes conflicting uses of equations and algorithms in a context of ecological theory of metapopulation dynamics. We finally propose both conceptual and practical guidelines for choosing between the alternative approaches

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,907

External links

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

Through your library

Similar books and articles

How to think about algorithms.Jeff Edmonds - 2008 - New York: Cambridge University Press.
A note on the logic of signed equations.Stephen L. Bloom - 1982 - Studia Logica 41 (1):75 - 81.
Is there an ethics of algorithms?Martin Peterson - 2011 - Ethics and Information Technology 13 (3):251-260.

Analytics

Added to PP
2010-11-17

Downloads
35 (#469,136)

6 months
6 (#582,229)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Outlines of a theory of structural explanations.Philippe Huneman - 2018 - Philosophical Studies 175 (3):665-702.
Mapping an expanding territory: computer simulations in evolutionary biology.Philippe Huneman - 2014 - History and Philosophy of the Life Sciences 36 (1):60-89.

Add more citations

References found in this work

On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.
Philosophy of mathematics: structure and ontology.Stewart Shapiro - 1997 - New York: Oxford University Press.
Philosophy of Mathematics: Structure and Ontology.Stewart Shapiro - 2000 - Philosophical Quarterly 50 (198):120-123.

View all 21 references / Add more references