On Turing Machines with Modifications

  • Roland Vollmar
Conference paper
Part of the Lecture Notes in Biomathematics book series (LNBM, volume 4)


After some informal definitions of Turing machines and their applications the importance of this concept for biological information processing will be mentioned. We shall see that Turing machines are very rough models. Therefore we shall try to build into this model “forgetfulness”—one of the phenomena observed in nature.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Davis, M.: Computability and Unsolvability, McGraw-Hill, New York, 1958.MATHGoogle Scholar
  2. Minsky, M.: Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, New Jersey, 1.967.MATHGoogle Scholar
  3. Arbib, M.A.: Theories of Abstract Automata, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.MATHGoogle Scholar
  4. Lofgren, L.: Self-repair as a computability concept in the theory of automata, Proc. of the Symp. on Math. Theory of Automata, Polytechnic Press, Brooklyn, N.Y., 1963, 205–222.Google Scholar
  5. Salomaa, A.: On finite automata with a time-variant structure, Information and Control 13, 85–98 (1968).CrossRefMATHMathSciNetGoogle Scholar
  6. Vollmar, R.: On Turing machines with a variable structure, Arbeitsberichte des interdisziplinären Modells DORA, Nr. D1–3, Erlangen, 1972.Google Scholar
  7. Vollmar, R.: Über Turing-Maschinen mit variablem Speicher, Elektronische Informationsverarbeitung und Kybernetik 9 ,3–13 (1973).MATHMathSciNetGoogle Scholar
  8. Material about cellular automata is contained e.g. in Burks, A.W. (Ed.): Essays on Cellular Automata, Univ. of Illinois Press, Urbana, 1970.Google Scholar
  9. Smith III, A.R.: Simple computation-universal cellular spaces, Journal of the ACM 18 ,339–353 (1971).CrossRefMATHGoogle Scholar
  10. Müller, H.: Stackautomaten in Labyrinthen, Archiv für Math. Logik und Grundlagenforschung 14, 127–134 (1971).CrossRefMATHGoogle Scholar
  11. Höllerer, W.O.: Über zellulare Netze mit variabler Struktur, Arbeitsberichte des interdisziplinären Modells DORAGoogle Scholar

Copyright information

© Springer-Verlag Berlin · Heidelberg 1974

Authors and Affiliations

  • Roland Vollmar
    • 1
  1. 1.Institut für Mathematische Maschinen und Datenverarbeitung (III)Universität Erlangen-NürnbergErlangenFed. Rep. Germany

Personalised recommendations