A computable expression of closure to efficient causation

DOI10.1016/J.JTBI.2008.12.012MaRDI QIDQ1617623zbMATH OpenOpenAlexWikidataFDO

Authors R. Smith

Publication date 8 November 2018

Published in Journal of Theoretical Biology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jtbi.2008.12.012

zbMATH Keywords

\(\lambda\)-calculuscomputability(M, R) systemsclosure to efficient causationimpredicativityRobert Rosen

Mathematics Subject Classification ID

General biology and biomathematics (92B05) Combinatory logic and lambda calculus (03B40) Functional programming and lambda calculus (68N18) Abstract and axiomatic computability and recursion theory (03D75)

Recommendations

• Closure to efficient causation, computability and artificial life
• Computational versus causal complexity
• scientific article; zbMATH DE number 4072938
• scientific article; zbMATH DE number 1900859
• scientific article; zbMATH DE number 1405574

Cites work

• scientific article; zbMATH DE number 3859115 (Why is no real title available?)
• scientific article; zbMATH DE number 5382519 (Why is no real title available?)
• scientific article; zbMATH DE number 42735 (Why is no real title available?)
• scientific article; zbMATH DE number 42059 (Why is no real title available?)
• scientific article; zbMATH DE number 49833 (Why is no real title available?)
• scientific article; zbMATH DE number 1229489 (Why is no real title available?)
• scientific article; zbMATH DE number 3993540 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• A category-theoretic characterization of functional completeness
• A construction of non-well-founded sets within Martin-Löf's type theory
• A semantic basis for Quest
• A set of postulates for the foundation of logic. II
• An abstract cell model that describes the self-organization of cell function in living systems
• Autopoietic and \((\boldsymbol{M,R})\) systems
• Constructive natural deduction and its ‘ω-set’ interpretation
• EXTENDED CRITICAL SITUATIONS: THE PHYSICAL SINGULARITY OF LIFE PHENOMENA
• Effectively given domains and lambda-calculus models
• METABOLIC NETWORKS FROM (ℳ, ℛ) SYSTEMS AND AUTOPOIESIS PERSPECTIVE
• On the dynamical realization of \((\mathbf M, \mathbf R)\)-systems
• Organizational invariance and metabolic closure: analysis in terms of \((M, R)\) systems
• Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
• Shadowing in dynamical systems
• The lambda calculus. Its syntax and semantics. Rev. ed.
• The mathematics of computing between logic and physics
• The system \({\mathcal F}\) of variable types, fifteen years later
• ``The arrival of the fittest: Toward a theory of biological organization

Cited in

(7)

• Incomputability in physics and biology
• The reflection of life: functional entailment and imminence in relational biology, by A. H. Louie
• Rosen's (M,R) system as an X-machine
• FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
• From \textit{L'homme machine} to metabolic closure: steps towards understanding life
• Closure to efficient causation, computability and artificial life
• Distant causation in \(\mathcal C+\)

This page was built for publication: A computable expression of closure to efficient causation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1617623)