The Leading eBooks Store Online
for Kindle Fire, Apple, Android, Nook, Kobo, PC, Mac, BlackBerry ...
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.
Visual Basic in Easy Steps 2011 US$ 14.99 193 pages
Using Google Maps and Google Earth 2011 US$ 19.99 360 pages
A Practical Guide to Linux Commands, Editors, and Shell Programming, 3e 2012 US$ 39.99 1224 pages
HTML and CSS 2011 US$ 29.99 514 pages