Energy cost evaluation of computing capabilities in biomolecular and artificial matter

  • R. Lahoz-Beltra
  • S. R. Hameroff
7. Biocomputing
Part of the Lecture Notes in Computer Science book series (LNCS, volume 929)


Propierties which define living systems at the molecular level include self-organization, communication, adaptive behavior and computation. Logic functions may implement these propierties in biomolecules and therefore may be essential to living systems. Several logic systems from Boolean to Spencer-Brown algebra have been suggested to be applicable to molecular computation. Boolean equations are commonly implemented on silicon chips on computer, but may also exist in nature. For example, the lac and arabinose operons in E. coli, some genetic networks of the metazoan genome, the self-assembly of proteins (i.e. viruses like T4 bacteriophage, cellular cytoskeletal elements, etc) display Boolean logic and show the capability for symbolic logic manipulation in biological connectionist systems. In biological systems logic operations are carried out in nonlinear devices or automata (i.e protein, gen, neuron, etc) producing an output that represent a logical function. Combination of logical functions is the substrate for biocomputation: an emergent propierty of biological systems. In the present article we introduce a method to evaluate the computational activity of automata in the context of biomolecular and artificial (cellular automata) matter. The method is illustrated in two different situations, in the cellular automata realm as well as in a model of finite state protein based computation.


Cellular Automaton Boolean Algebra Tobacco Mosaic Virus Turing Machine Molecular Computation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Spencer-Brown, G.: Laws of Form, George Allen and Unwin Ltd, London (1969) 1–141Google Scholar
  2. 2.
    Siatkowski, R.E. and Carter, F.L.: The chemical elements of logic, in Molecular Electronic Devices, F.L. Carter, R.E. Siatkowski and H. Wohltjen (eds.), Elsevier Science Publishers B.V., North-Holland (1988) 321–327Google Scholar
  3. 3.
    Stern, A. and Stern, V.: Fundamental logic, in Molecular Electronic Devices, F.L. Carter, R.E. Siatkowski and H. Wohltjen (eds.), Elsevier Science Publishers B.V., North-Holland (1988) 329–339Google Scholar
  4. 4.
    Milch, J.R.: Computers based on molecular implementations of cellular automata, in Molecular Electronic Devices, F.L. Carter, R.E. Siatkowski and H. Wohltjen (eds.), Elsevier Science Publishers B.V., North-Holland (1988) 303–317Google Scholar
  5. 5.
    Kauffman, SA.: Assessing the possible regulatory structures and dynamics of the metazoan genome, in Kinetic Logic, Lecture Notes in Biomathematics, R. Thomas (ed.), Springer, Berlin 29 (1979) 30–36Google Scholar
  6. 6.
    Kauffman, S.A.: The self-organization of dynamical order in the evolution of metazoan gene regulatiuon, in The Living State, R.K. Mishra (ed.), John Wiley (1984) 291–307Google Scholar
  7. 7.
    Lahoz-Beltra, R., Hameroff, S.R., Dayhoff, J.E.: Cytoskeletal logic: a model for molecular computation via Boolean operations in microtubules and microtubule-associated proteins, BioSystems 29 (1993) 1–23Google Scholar
  8. 8.
    Fodor V. and Pylyshyn, Z.: Connectionism and cognitive architecture: a critical analysis in connections and symbols, in A Cognition Special Issue, S. Pinker and J. Mehler (eds.), MIT Press, Cambridge, MA (1988) 3–71Google Scholar
  9. 9.
    Langton, C.G.: Studying artificial life with cellular automata, Physica D 22 (1986) 120–149.Google Scholar
  10. 10.
    Banks, E.R.: Universality in cellular automata, I.E.E.E. 11th Ann. Sym. Switching and Automata Theory, Santa Clara, California (1970) 194–214Google Scholar
  11. 11.
    Poundstone, W.: The recursive universe: cosmic complexity and the limits of scientific knowledge. Contemporary Books, Chicago (1985) 1–252Google Scholar
  12. 12.
    Keyes, R.W.: Communication in computation, International Journal of Theoretical Physics 21, Nos. 3–4 (1982) 263–273Google Scholar
  13. 13.
    Rietman, E.: Experiments in artificial neural networks, TAB Books, Advanced Technology Series (1988) 1–144Google Scholar
  14. 14.
    von Neumann, J.: Re-evaluation of self-reproducing automata, in The theory of self-reproducing automata, A.W. Burkes (ed.). University of Illinois Press, Urbana (1966)Google Scholar
  15. 15.
    Pattee, H.H.: Physical theories, automata, and the origin of life, in Natural Automata and Useful Simulations, H.H. Pattee, E.A. Edelsack, L. Fein, A.B. Callahan (eds.), Spartan Books, Washington (1966) 73–105Google Scholar
  16. 16.
    Conrad, M.: Molecular automata, in Lecture Notes in Biomathematics, Physics an mathematics of the Nervous System, M. Conrad, W. Guttinger and M. Dal Cin (eds.), Springer-Verlag, Heidelberg 4 (1974) 419–430Google Scholar
  17. 17.
    Hameroff, S.R., Dayhoff, J.E., Lahoz-Beltra, R., Samsonovich, A.V., Rasmussen, S.: Models for molecular computation: conformational automata in the cytoskeleton, IEEE Computer (special issue on Molecular Computing) 25, No. 11 (1992) 30–39Google Scholar
  18. 18.
    Lampton, C.: Nanotechnology playhouse, The Waite Group (1993) 1–181Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • R. Lahoz-Beltra
    • 1
  • S. R. Hameroff
    • 2
  1. 1.Laboratorio de Bioinformatica, Departamento de Matematica Aplicada, Facultad de BiologiaUniversidad ComplutenseMadridSpain
  2. 2.Advanced Biotechnology Laboratory, Department of AnesthesiologyUniversity of Arizona, Health Sciences CenterTucsonUSA

Personalised recommendations