Skip to main content

On Turing Machines with Modifications

  • Conference paper
  • 308 Accesses

Part of the book series: Lecture Notes in Biomathematics ((LNBM,volume 4))

Abstract

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.

Some of the results mentioned in this paper are based on research supported by the Bundesminister für Forschung und Technologie (No. NT - 187)

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Davis, M.: Computability and Unsolvability, McGraw-Hill, New York, 1958.

    MATH  Google Scholar 

  • Minsky, M.: Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, New Jersey, 1.967.

    MATH  Google Scholar 

  • Arbib, M.A.: Theories of Abstract Automata, Prentice-Hall, Englewood Cliffs, New Jersey, 1969.

    MATH  Google Scholar 

  • 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 

  • Salomaa, A.: On finite automata with a time-variant structure, Information and Control 13, 85–98 (1968).

    Article  MATH  MathSciNet  Google Scholar 

  • Vollmar, R.: On Turing machines with a variable structure, Arbeitsberichte des interdisziplinären Modells DORA, Nr. D1–3, Erlangen, 1972.

    Google Scholar 

  • Vollmar, R.: Über Turing-Maschinen mit variablem Speicher, Elektronische Informationsverarbeitung und Kybernetik 9 ,3–13 (1973).

    MATH  MathSciNet  Google Scholar 

  • 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 

  • Smith III, A.R.: Simple computation-universal cellular spaces, Journal of the ACM 18 ,339–353 (1971).

    Article  MATH  Google Scholar 

  • Müller, H.: Stackautomaten in Labyrinthen, Archiv für Math. Logik und Grundlagenforschung 14, 127–134 (1971).

    Article  MATH  Google Scholar 

  • Höllerer, W.O.: Über zellulare Netze mit variabler Struktur, Arbeitsberichte des interdisziplinären Modells DORA

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1974 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Vollmar, R. (1974). On Turing Machines with Modifications. In: Conrad, M., Güttinger, W., Dal Cin, M. (eds) Physics and Mathematics of the Nervous System. Lecture Notes in Biomathematics, vol 4. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80885-2_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80885-2_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-07014-6

  • Online ISBN: 978-3-642-80885-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics