A computable expression of closure to efficient causation
From MaRDI portal
Publication:1617623
DOI10.1016/j.jtbi.2008.12.012zbMath1400.92008OpenAlexW2071145099WikidataQ51853989 ScholiaQ51853989MaRDI QIDQ1617623
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
\(\lambda\)-calculuscomputability(M, R) systemsclosure to efficient causationimpredicativityRobert Rosen
Functional programming and lambda calculus (68N18) General biology and biomathematics (92B05) Combinatory logic and lambda calculus (03B40) Abstract and axiomatic computability and recursion theory (03D75)
Related Items (5)
The reflection of life: functional entailment and imminence in relational biology, by A. H. Louie ⋮ Incomputability in Physics and Biology ⋮ Closure to efficient causation, computability and artificial life ⋮ From \textit{L'homme machine} to metabolic closure: steps towards understanding life ⋮ Rosen's \((M,R)\) system as an X-machine
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The lambda calculus. Its syntax and semantics. Rev. ed.
- A category-theoretic characterization of functional completeness
- Set-theoretical models of lambda-calculus: theories, expansions, isomorphisms
- The system \({\mathcal F}\) of variable types, fifteen years later
- ``The arrival of the fittest: Toward a theory of biological organization
- Shadowing in dynamical systems
- A set of postulates for the foundation of logic. II
- Autopoietic and \((\boldsymbol{M,R})\) systems
- Organizational invariance and metabolic closure: analysis in terms of \((M, R)\) systems
- An abstract cell model that describes the self-organization of cell function in living systems
- On the dynamical realization of \((\mathbf M, \mathbf R)\)-systems
- EXTENDED CRITICAL SITUATIONS: THE PHYSICAL SINGULARITY OF LIFE PHENOMENA
- Effectively given domains and lambda-calculus models
- A construction of non-well-founded sets within Martin-Löf's type theory
- Constructive natural deduction and its ‘ω-set’ interpretation
- A semantic basis for Quest
- METABOLIC NETWORKS FROM (ℳ, ℛ) SYSTEMS AND AUTOPOIESIS PERSPECTIVE
This page was built for publication: A computable expression of closure to efficient causation