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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. A. Markov, N. M. Nagorny. Algorithms theory— Moscow, 1996 (in Russian)
E. Mendelson. Introduction to mathematical logic— Princeton etc.: van NostrandCompany, inc. (Russian translation:-Moscow, 1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
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
DOI: https://doi.org/10.1007/3-540-45575-2_4
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43075-9
Online ISBN: 978-3-540-45575-2
eBook Packages: Springer Book Archive