On Algorithmic Unsolvability (original) (raw)

404 Accesses

Abstract

Many computational problems are algorithmically unsolvable. How well this fundamental assertion of computability theory is based— that is the main question considered in the paper from a programmer’s view.

Preview

Unable to display preview. Download preview PDF.

References

A. A. Markov, N. M. Nagorny. _Algorithms theory_— Moscow, 1996 (in Russian)
Google Scholar
E. Mendelson. _Introduction to mathematical logic_— Princeton etc.: van NostrandCompany, inc. (Russian translation:-Moscow, 1976)
Google Scholar

Download references

Author information

Authors and Affiliations

Russian Academy of Sciences, Institute of Applied Astronomy, 8, Zhdanovskaya Str., 197110, St.Petersburg, Russia
Svyatoslav S. Lavrov

Authors

Svyatoslav S. Lavrov

Editor information

Editors and Affiliations

Informatics and Mathematical Modelling, Technical University of Denmark, Bldg.322, 106-108, Richard Petersens Plads, 2800, Lyngby, Denmark
Dines Bjørner
Computer Science Department, Technical University of Munich, Arcisstr.21, 80290, Munich, Germany
Manfred Broy
A.P.Ershov Institute of Informatics Systems, Acad.Lavrentjev ave.,6, 630090, Novosibirsk, Russia
Alexandre V. Zamulin

Rights and permissions

Copyright information

About this paper

Cite this paper

Lavrov, S.S. (2001). On Algorithmic Unsolvability. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2\_4

Download citation

.RIS
.ENW
.BIB
DOI: https://doi.org/10.1007/3-540-45575-2\_4
Published: 18 December 2001
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43075-9
Online ISBN: 978-3-540-45575-2
eBook Packages: Springer Book Archive

Keywords

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.