A computable expression of closure to efficient causation

Matteo Mossio (1) , Giuseppe Longo , John Stewart (2)

1 IHPST - Institut d'Histoire et de Philosophie des Sciences et des Techniques
2 COSTECH - Connaissance Organisation et Systèmes TECHniques

In this paper, we propose a mathematical expression of closure to efficient causation in terms of lambda-calculus; we argue that this opens up the perspective of developing principled computer simulations of systems closed to efficient causation in an appropriate programming language. An important implication of our formulation is that, by exhibiting an expression in lambda-calculus, which is a paradigmatic formalism for computability and programming, we show that there are no conceptual or principled problems in realizing a computer simulation or model of closure to efficient causation. We conclude with a brief discussion of the question whether closure to efficient causation captures all relevant properties of living systems. We suggest that it might not be the case, and that more complex definitions could indeed create crucial some obstacles to computability.

Mots clés: R) systems; (M; Impredicativity; Computability; λ-calculus; Robert Rosen; Closure to efficient causation

Domaines: Histoire, Philosophie et Sociologie des sciences

Matteo Mossio, Giuseppe Longo, John Stewart. A computable expression of closure to efficient causation. Journal of Theoretical Biology, 2009, 257 (3), pp.489-498. ⟨10.1016/j.jtbi.2008.12.012⟩. ⟨halshs-00791132⟩