Skip to main content
Springer Nature Link
Log in

Über eine minimale universelle Turing-Maschine

  • Vorträge (In Alphabetischer Reihenfolge)
  • Conference paper
  • First Online:
Theoretical Computer Science 4th GI Conference

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 67))

  • 163 Accesses

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P.C.Fischer. On Formalisms for Turing Machines. J.ACM, 12(65), pp. 570–580.

    Google Scholar 

  2. G. Hasenjäger. Unveröffentlicher Vortrag, WWU, Münster, 1973.

    Google Scholar 

  3. Ph.K.Hooper. Some Small, Multitape Universal Turing Machines. Comp. Laboratory Harvard University, 1963.

    Google Scholar 

  4. H. Kleine Büning. Über Probleme bei homogener Parkettierung von Z×Z durch Mealy-Automaten bei normierter Verwendung. Dissertation, WWU, Münster, 1977.

    Google Scholar 

  5. H.Kleine Büning und Th.Ottmann. Kleine universelle mehrdimensionale Turingmaschinen. Elek.Inf.Kyb.,13(77),pp.179–201.

    Google Scholar 

  6. F.K. Mahn. Über die Strukturunabhängigkeit des Begriffes der primitiv-rekursiven Funktion. Dissertation, WWU, Münster, 1965.

    Google Scholar 

  7. M.L.Minsky. Size and Structure of Universal Turing Machines Using TAG Systems. Proc. 5th Symp. in Apl. Math.,(62),AMS,pp.229–238.

    Google Scholar 

  8. L. Priese. Über einfache unentscheidbare Probleme: Computational und constructional universelle asynchrone Räume. Dissertation, WWU, Münster, 1974.

    Google Scholar 

  9. L.Priese. Towards a Precise Characterization of the Complexity of Universal and Non-Universal Turing Machines. Erscheint in: SIAM J.on Computing.

    Google Scholar 

  10. C.E. Shannon. A Universal Turing Machine With Two Internal States. In: Automata Studies, Princeton University Press, Princeton, 1956,pp. 157–166.

    Google Scholar 

  11. K.Wagner. Universelle Turing-Maschinen mit n-dimensionalem Band. Elek.Inf.Kyb.,9(73),pp.423–431.

    Google Scholar 

  12. S.Watanabe. 5-Symbol 8-State and 5-Symbol 6-State Turing Machines. J.ACM,8(61),pp.476–584.

    Google Scholar 

Download references

Authors
  1. Lutz Priese
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

K. Weihrauch

Rights and permissions

Reprints and permissions

Copyright information

© 1979 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Priese, L. (1979). Über eine minimale universelle Turing-Maschine. In: Weihrauch, K. (eds) Theoretical Computer Science 4th GI Conference. Lecture Notes in Computer Science, vol 67. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-09118-1_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-09118-1_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09118-9

  • Online ISBN: 978-3-540-35517-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation