Skip to content

Booksellers & Trade Customers: Sign up for online bulk buying at trade.atlanticbooks.com for wholesale discounts

Booksellers: Create Account on our B2B Portal for wholesale discounts

The Foundations of Computability Theory

by Borut Robič
Save 35% Save 35%
Current price ₹4,407.00
Original price ₹6,779.00
Original price ₹6,779.00
Original price ₹6,779.00
(-35%)
₹4,407.00
Current price ₹4,407.00

Imported Edition - Ships in 12-14 Days

Free Shipping in India on orders above Rs. 500

Request Bulk Quantity Quote
+91
Book cover type: Paperback
  • ISBN13: 9783662516010
  • Binding: Paperback
  • Subject: N/A
  • Publisher: Springer
  • Publisher Imprint: Springer
  • Publication Date:
  • Pages: 331
  • Original Price: EUR 59.99
  • Language: English
  • Edition: Softcover Repri
  • Item Weight: 532 grams
  • BISAC Subject(s): Logic, Computer Science, and Data Science / General

From the Back Cover

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.

Prof. Borut Robič 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. Robič coauthored the book "Processor Architecture: From Dataflow to Superscalar and Beyond" (Springer 1999).

Trusted for over 49 years

Family Owned Company

Secure Payment

All Major Credit Cards/Debit Cards/UPI & More Accepted

New & Authentic Products

India's Largest Distributor

Need Support?

Whatsapp Us