Skip to main content
SpringerLink
Log in

Universal Turing machines (UTM) and Jones-Matiyasevich-masking

  • Section III: Automata And Machines
  • Conference paper
  • First Online:
Logic and Machines: Decision Problems and Complexity (LaM 1983)

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

Included in the following conference series:

  • 179 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

  • DAVIS (1973) Hilbert's tenth problem is unsolvable. Amer. Math. Monthly 80 (1973) 233–269.

    Google Scholar 

  • SINGMASTER (1974) Notes on binomial coefficients I-III. J. London Math. Soc. 8 No 3, (1974) 545–560.

    Google Scholar 

  • MATIYASEVICH (1975) A new proof of the theorem on exponential diophantine representations of enumerable sets. J. Soviet Math. 14 (1980), 1475–1486; Result announced 1975.

    Google Scholar 

  • GREGUŠOVÁ/KOREC (1979) Small universal Minsky machines, Mathem. Foundations of Computer Science 1979. Lecture Notes in Computer Science 74. Berlin-Heidelberg-New York, 1979.

    Google Scholar 

  • JONES/MATIYASEVICH (1980) Direct translation of register machines into exponential diophantine equations, Preprint 1980, available in the Report on the 1st GTI-workshop Lutz Priese (Ed.) Paderborn March 1983.

    Google Scholar 

  • JONES/MATIYASEVICH (1981) Exponential diophantine representation of recursively enumerable sets, Proceedings of the Herbrand colloquium '81. Amsterdam-New York-Oxford 1982.

    Google Scholar 

  • JONES (1982) Universal diophantine equation, J. Symbolic Logic 47 (1982) 549–571.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Seminar für Logik und Grundlagenforschung der Universität Bonn, Germany

    G. Hasenjaeger

Authors
  1. G. Hasenjaeger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

E. Börger G. Hasenjaeger D. Rödding

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hasenjaeger, G. (1984). Universal Turing machines (UTM) and Jones-Matiyasevich-masking. In: Börger, E., Hasenjaeger, G., Rödding, D. (eds) Logic and Machines: Decision Problems and Complexity. LaM 1983. Lecture Notes in Computer Science, vol 171. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13331-3_44

Download citation

  • DOI: https://doi.org/10.1007/3-540-13331-3_44

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13331-5

  • Online ISBN: 978-3-540-38856-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation