The Foundations of Computability Theory

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 theo...

Full description

Saved in:
Bibliographic Details
Main Author: Robic��, Borut
Corporate Author: SpringerLink (Online service)
Format: Electronic Book
Language:English
Published: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
Edition:1st ed. 2015
Subjects:
Tags: Add Tag
No Tags, Be the first to tag this record!
LEADER 03451nam a22004455i 4500
001 8f4dceb2-180e-4f20-be21-5c9f60ead801
005 20230618000000.0
008 150907s2015^^^^gw^|^^^^o^^^^||||^0|eng^d
020 |a 9783662448076 
020 |a 9783662448083 
024 7 |a 10.1007/978-3-662-44808-3  |2 doi 
035 |a (WaSeSS)ssj0001584254 
040 |d WaSeSS 
050 4 |a QA75.5-76.95 
072 7 |a COM014000  |2 bisacsh 
072 7 |a COM031000  |2 bisacsh 
072 7 |a UY  |2 bicssc 
072 7 |a UYA  |2 bicssc 
082 0 4 |a 004.0151  |2 23 
100 1 |a Robic��, Borut 
245 1 4 |a The Foundations of Computability Theory  |h [electronic resource] /  |c by Borut Robi�� 
250 |a 1st ed. 2015 
260 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2015 
300 |a 1 online resource (XX, 331 p. 109 illus.)  |b online resource 
347 |a text file  |b PDF  |2 rda 
505 0 |a 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 |a 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 |a Computer science  |x Mathematics 
650 0 |a Computer science 
650 0 |a Computers 
650 1 4 |a Computer Science 
650 2 4 |a Computational Mathematics and Numerical Analysis 
650 2 4 |a Mathematics of Computing 
650 2 4 |a Theory of Computation 
655 7 |a Electronic books  |2 lcgft 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9783662448076 
999 1 0 |i 8f4dceb2-180e-4f20-be21-5c9f60ead801  |l 006693189  |s US-NCD  |m foundations_of_computability_theory___________________________________elect2015____201sprina________________________________________robic��__borut_____________________e 
999 1 1 |l 006693189  |s ISIL:US-NCD  |t BKS  |a DUKIR  |x ITNET  |p UNLOANABLE