Close Bookish App

Bookish AppRead more and better

Download
Google 4.6
★★★★★
Google reviews
Computability, Enumerability, Unsolvability: Directions in Recursion Theory
Computability, Enumerability, Unsolvability: Directions in Recursion Theory

Book Details

The fundamental ideas concerning computation and recursion naturally find their place at the interface between logic and theoretical computer science. The contributions in this book, by leaders in the field, provide a picture of current ideas and methods in the ongoing investigations into the pure mathematical foundations of computability theory.
Read more

  • ISBN13 9780521557368
  • ISBN10 0521557364
  • Pages 356
  • Published 1996
  • Fecha de publicación 11/01/1996
  • Language German, French
Read more

Reviews and ratings

Be the first to rate it!

Have you read Computability, Enumerability, Unsolvability: Directions in Recursion Theory?

Computability, Enumerability, Unsolvability: Directions in Recursion Theory

Computability, Enumerability, Unsolvability: Directions in Recursion Theory (German, French)

  • By
  • 9780521557368 (ISBN)
62,98€ 66,30€ -5%
Shipping Free
Not available
62,98€ 66,30€ -5%
Shipping Free
Not available
  • Visa
  • Mastercard
  • Klarna
  • Bizum
  • American Express
  • Paypal
  • Google Pay
  • Apple Pay
Free returns Info
Thank you for shopping at real bookstores! Thank you for shopping at real bookstores!

Exclusive promotions, discounts, and news in our newsletter

Talk to your bookseller
Do you need help finding a book?
Do you want a personal recommendation?

Whatsapp