Abstract
Rosen’s identification of abstract biological systems, called (M,R)-systems, with sequential machines is formally characterized. It is then shown that the determination of environmental alterations of (M,R)-systems from a knowledge of the response sequence and the structure of the system, which we call behavioral reversibility, can be interpreted as information-losslessness of sequential machines. Applying this relationship, necessary conditions for behavioral reversibility are derived. It is further shown that, similar to Rosen’s work on structural reversibility, (M,R)-systems are behaviorally reversible only if the number of physically realizable mappings are restricted.
Similar content being viewed by others
References
Ginsburg, S. 1962.An Introduction to Mathematical Machine Theory. Reading: Addison-Wesley Publishing Co., Inc.
Huffman, D. A. 1959. “Canonical Forms for Information-lossless Finite-state Machines.”Trans. I.R.E., Circuit Theory, CT-6 (Special Supplement), 41–59.
Rosen, R. 1958. “The Representation of Biological Systems from the Standpoint of the Theory of Categories.”Bull. Math. Biophysics,20, 317–342.
— 1964a. “Abstract Biological Systems as Sequential Machines.”,26, 103–111.
— 1964b. “Abstract Biological Systems as Sequential Machines. Strong Connectedness and Reversibility.”,27, 239–246.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Demetrius, L.A. Abstract biological systems as sequential machines: Behavioral reversibility. Bulletin of Mathematical Biophysics 28, 153–160 (1966). https://doi.org/10.1007/BF02476989
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02476989