20% off all books with the code: BOOKS
  • check 10+ million books
  • check New arrivals every day
  • check Trusted by 1M+ customers
  • check Great prices & discounts
  • check Shipping across Europe

Computability, Enumerability, Unsolvability -

English
2009-04-18
€117.36 €146.70

-20% with code BOOKS

In stock at our supplier

Shipping in 15-21 days

30-day return policy

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. The topics range over computable functions, enumerable sets, ... Full description

You May Also Like

Description

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. The topics range over computable functions, enumerable sets, degree structures, complexity, subrecursiveness, domains and inductive inference. A number of the articles contain introductory and background material which it is hoped will make this volume an invaluable resource.

More Information

Publisher Cambridge University Press
Release year 2009
Cover type Softcover
EAN 9780521557368
Write Your Own Review
You're reviewing: Computability, Enumerability, Unsolvability
Your Rating:

Goodreads Reviews

€117.36 €146.70