Metabolic analyzer

An apparatus is described for the measurement of metabolic rate and breathing dynamics in which inhaled and exhaled breath are sensed by sealed, piston-displacement type spirometers. These spirometers electrically measure the volume of inhaled and exhaled breath. A mass spectrometer analyzes simultaneously for oxygen, carbon dioxide, nitrogen and water vapor. Computation circuits are responsive to the outputs of the spirometers, mass spectrometer, temperature, pressure and timing signals and compute oxygen consumption, carbon dioxide production, minute volume and respiratory exchange ratio. A selective indicator provides for read-out of these data at predetermined cyclic intervals

Computing Substrates and Life

Alive matter distinguishes itself from inanimate matter by actively maintaining a high degree of inhomogenous organisation. Information processing is quintessential to this capability. The present paper inquires into the degree to which the information processing aspect of living systems can be abstracted from the physical medium of its implementation. Information processing serving to sustain the complex organisation of a living system faces both the harsh reality of real-time requirements and severe constraints on energy and material that can be expended on the task. This issue is of interest for the potential scope of Artificial Life and its interaction with Synthetic Biology. It is pertinent also for information technology. With regard to the latter aspect, the use of a living cell in a robot control architecture is considered

Computing Persistent Homology within Coq/SSReflect

Persistent homology is one of the most active branches of Computational Algebraic Topology with applications in several contexts such as optical character recognition or analysis of point cloud data. In this paper, we report on the formal development of certified programs to compute persistent Betti numbers, an instrumental tool of persistent homology, using the Coq proof assistant together with the SSReflect extension. To this aim it has been necessary to formalize the underlying mathematical theory of these algorithms. This is another example showing that interactive theorem provers have reached a point where they are mature enough to tackle the formalization of nontrivial mathematical theories