Skip to main content
SpringerLink
Log in

Turings Arbeiten über Berechenbarkeit – eine Einführung und Lesehilfe

  • HAUPTBEITRAG
  • TURINGS ARBEITEN ÜBER BERECHENBARKEIT
  • Published:
Informatik-Spektrum Aims and scope

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

Access this article

Log in via an institution

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Church A (1936) An unsolvable problem of elementary number theory. Amer J Math 58:345–363

    Article  MathSciNet  Google Scholar 

  2. Church A (1936) A note on the Entscheidungsproblem. J Symb Log 1:40–41

    Article  MATH  Google Scholar 

  3. Copeland BJ (ed) (2004) The Essential Turing. Oxford Univ. Press, Oxford

  4. Davis M (1965) The Undecidable. Raven Press, Hewlett

    Google Scholar 

  5. Gandy RO (1995) The confluence of ideas in 1936. In: Herken R (ed) The Universal Turing Machine: a Half-Century Survey. Springer, Wien

    Google Scholar 

  6. Gandy RO, Yates CEM (eds) (2001) Collected Works of A.M. Turing, vol Mathematical Logic. North-Holland, Elsevier, Amsterdam

  7. Hilbert D, Ackermann W (1928) Grundzüge der theoretischen Logik. Springer, Berlin

    MATH  Google Scholar 

  8. Kleene SC (1936) λ-definability and recursiveness. Duke Math J 2:340–353

    Article  MathSciNet  Google Scholar 

  9. Post E (1936) Finite combinatory processes – formulation I. J Symb Log 1:103–105

    Article  MATH  Google Scholar 

  10. Turing AM (1936/37) On computable numbers, with an application to the Entscheidungsproblem. In: Proc Lond Math Soc, ser 2, 42:230–265. A correction, ibid. vol 43:544–546

  11. Turing AM (1939) Systems of logic based on ordinals. In: Proc Lond Math Soc, ser 2, 45:161–228

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Ulm, Deutschland

    Uwe Schöning

  2. Aachen, Deutschland

    Wolfgang Thomas

Authors
  1. Uwe Schöning
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Wolfgang Thomas
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Wolfgang Thomas.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Schöning, U., Thomas, W. Turings Arbeiten über Berechenbarkeit – eine Einführung und Lesehilfe. Informatik Spektrum 35, 253–260 (2012). https://doi.org/10.1007/s00287-012-0626-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00287-012-0626-3

Search

Navigation