The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, Sony Reader ...
Computability, Enumerability, Unsolvability
Directions in Recursion Theory
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 from this author
The Extreme Searcher's Internet Handbook 2013 US$ 19.99 345 pages
The New Digital Age 2013 US$ 11.99 336 pages
Steve Jobs 2011 US$ 14.57 448 pages
Successful Business Intelligence: Unlock the Value of BI & Big Data, Second Edition 2013 US$ 40.00 337 pages