Skip to main content
SpringerLink
Log in
Book cover

Algorithms in Modern Mathematics and Computer Science pp 441–443Cite as

What should we do having proved a decision problem to be unsolvable?

  • Conference paper
  • First Online:

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

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

Author information

Authors and Affiliations

  1. Leningrad Branch Steklov Inst.of Mathematics, 27 Fontanka, 191011, Leningrad, USSR

    Yuri Matijasevič

Authors
  1. Yuri Matijasevič
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Andrei P. Ershov Donald E. Knuth

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Matijasevič, Y. (1981). What should we do having proved a decision problem to be unsolvable?. In: Ershov, A.P., Knuth, D.E. (eds) Algorithms in Modern Mathematics and Computer Science. Lecture Notes in Computer Science, vol 122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-11157-3_41

Download citation

  • DOI: https://doi.org/10.1007/3-540-11157-3_41

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-11157-3

  • Online ISBN: 978-3-540-38621-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation