Borut Robic

The Foundations of Computability Theory (eBook, PDF)

• Format: PDF

Produktbeschreibung

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.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer-Verlag GmbH
• Seitenzahl: 331
• Erscheinungstermin: 14. September 2015
• Englisch
• ISBN-13: 9783662448083
• Artikelnr.: 43837748

Autorenporträt

Prof. Borut Robic received his Ph.D. in Computer Science from the University of Ljubljana in 1993. He is a member of the Faculty of Computer and Information Science of the University of Ljubljana where he leads the Laboratory for Algorithms and Data Structures. He has had guest professorships, fellowships and collaborations with the University of Cambridge, the University of Augsburg, the University of Grenoble, and the Jozef Stefan Institute in Ljubljana. His research interests and teaching experience address algorithms; computability and computational complexity theory; parallel, distributed and grid computing; operating systems; and processor architectures. Prof. Robic coauthored the book "Processor Architecture: From Dataflow to Superscalar and Beyond" (Springer 1999).

Inhaltsangabe

Part I, The Roots of Computability Theory.- Introduction.- The Foundational Crisis of Mathematics.- Formalism.- Hilbert's Attempt at Recovery.- Part II, Classicial Computability Theory.- The Quest for a Formalization.- The Turing Machine.- The First Basic Results.- Incomputable Problems.- Methods of Proving Incomputability.- Part III, Relative Computability.- 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.- Part IV, Back to the Roots.- Computability (Church-Turing) Thesis Revisited.- Further Reading.- App. A, Mathematical Background.- App. B, Notation Index.- Glossary.- References.- Index.

Rezensionen

"The book incorporates many historical, philosophical, and practical concerns closely related to the definitions and core results of the subject. In addition, the book covers enough ground to be able to discuss the finite injury priority method. ... The tone is friendly and accessible, and a reader can learn some of the fundamental aspects of computability theory and its history without getting bogged down in technical details." (Joseph R. Mileti, Mathematical Reviews, September, 2016)

"For the prepared, this is a wonderful blending of history and philosophy, foundations and computation, math and the mystery of the incomplete, undecidable, unknowable, incomputable. ... a willing reader will be happy." (Benjamin Wells, ACM Computing Reviews, April, 2016)

"The main purpose of this book is to provide the reader with a clear and deep understanding of the foundations of computability theory. This goal is fully achieved, because the book is well-written and its reading is very pleasant. ... It is a good textbook for undergraduate or beginning graduate students in computer science or mathematics, and I suggest to use it." (Patrizio Cintioli, zbMATH 1339.03001, 2016)