The Foundations of Computability Theory (Record no. 52860)
[ view plain ]
| 000 -LEADER | |
|---|---|
| fixed length control field | 03385nam a22005055i 4500 |
| 001 - CONTROL NUMBER | |
| control field | 978-3-662-44808-3 |
| 005 - DATE AND TIME OF LATEST TRANSACTION | |
| control field | 20200420221255.0 |
| 008 - FIXED-LENGTH DATA ELEMENTS--GENERAL INFORMATION | |
| fixed length control field | 150907s2015 gw | s |||| 0|eng d |
| 020 ## - INTERNATIONAL STANDARD BOOK NUMBER | |
| ISBN | 9783662448083 |
| -- | 978-3-662-44808-3 |
| 082 04 - CLASSIFICATION NUMBER | |
| Call Number | 004.0151 |
| 100 1# - AUTHOR NAME | |
| Author | Robič, Borut. |
| 245 14 - TITLE STATEMENT | |
| Title | The Foundations of Computability Theory |
| 250 ## - EDITION STATEMENT | |
| Edition statement | 1st ed. 2015. |
| 300 ## - PHYSICAL DESCRIPTION | |
| Number of Pages | XX, 331 p. 109 illus. |
| 505 0# - FORMATTED CONTENTS NOTE | |
| Remark 2 | Introduction -- The Foundational Crisis of Mathematics -- Formalism -- Hilbert's Attempt at Recovery -- The Quest for a Formalization -- The Turing Machine -- The First Basic Results -- Incomputable Problems -- Methods of Proving the Incomputability -- Computation with External Help -- Degrees of Unsolvability -- The Turing Hierarchy of Unsolvability -- The Class D of Degrees of Unsolvability -- C.E. Degrees and the Priority Method -- The Arithmetical Hierarchy -- Further Reading -- App. A, Mathematical Background -- References -- Index. |
| 520 ## - SUMMARY, ETC. | |
| Summary, etc | This book offers an original and informative view of the development of fundamental concepts of computability theory. The treatment is put into historical context, emphasizing the motivation for ideas as well as their logical and formal development. In Part I the author introduces computability theory, with chapters on the foundational crisis of mathematics in the early twentieth century, and formalism; in Part II he explains classical computability theory, with chapters on the quest for formalization, the Turing Machine, and early successes such as defining incomputable problems, c.e. (computably enumerable) sets, and developing methods for proving incomputability; in Part III he explains relative computability, with chapters on computation with external help, degrees of unsolvability, the Turing hierarchy of unsolvability, the class of degrees of unsolvability, c.e. degrees and the priority method, and the arithmetical hierarchy. This is a gentle introduction from the origins of computability theory up to current research, and it will be of value as a textbook and guide for advanced undergraduate and graduate students and researchers in the domains of computability theory and theoretical computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| General subdivision | Mathematics. |
| 856 40 - ELECTRONIC LOCATION AND ACCESS | |
| Uniform Resource Identifier | http://dx.doi.org/10.1007/978-3-662-44808-3 |
| 942 ## - ADDED ENTRY ELEMENTS (KOHA) | |
| Koha item type | eBooks |
| 264 #1 - | |
| -- | Berlin, Heidelberg : |
| -- | Springer Berlin Heidelberg : |
| -- | Imprint: Springer, |
| -- | 2015. |
| 336 ## - | |
| -- | text |
| -- | txt |
| -- | rdacontent |
| 337 ## - | |
| -- | computer |
| -- | c |
| -- | rdamedia |
| 338 ## - | |
| -- | online resource |
| -- | cr |
| -- | rdacarrier |
| 347 ## - | |
| -- | text file |
| -- | |
| -- | rda |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computers. |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer science |
| 650 #0 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer mathematics. |
| 650 14 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computer Science. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Theory of Computation. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Mathematics of Computing. |
| 650 24 - SUBJECT ADDED ENTRY--SUBJECT 1 | |
| -- | Computational Mathematics and Numerical Analysis. |
| 912 ## - | |
| -- | ZDB-2-SCS |
No items available.