Skip to main content
Log in

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

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Literatur

  • H. Hermes, Entscheidungsprobleme in Mathematik und Logik, 1955, Aschendorffsche Verlagsbuchhandlung, Münster.

    Google Scholar 

  • S. C. Kleene, Introduction to Metamathematics, 1952, North-Holland Publishing CO., Amsterdam u. Groningen.

    Google Scholar 

  • D. König, Theorie der endlichen und unendlichen Graphen, 1936, Akademische Verlags-G.m.b.H., Leipzig.

    Google Scholar 

  • A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London. Math. Soc.,42, 1937, S. 230–265.

    Google Scholar 

  • H. Wang, [1], A variant to Turing's theory of computing machines, Journal of the Association for Computing Machinery,4, 1957, S. 63–92.

    Google Scholar 

  • H. Wang, [2], Universal Turing Machines: An Exercise in Coding. Zeitschr. f. math. Logik und Grundlagen d. Math.,3, 1957, S. 69–80.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Oberschelp, W. Varianten von Turingmaschinen. Arch math Logik 4, 53–62 (1958). https://doi.org/10.1007/BF01977114

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01977114

Navigation