Computability and Randomness
by Andre Nies
Publisher: Oxford University Press 2008
Number of pages: 447
Covering the basics as well as recent research results, this book provides a very readable introduction to the exciting interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
Download or read it online for free here:
by Wilfried Sieg - Carnegie Mellon University
Computability is the basic theoretical concept for computer science, artificial intelligence and cognitive science. This essay discusses, at its heart, methodological issues that are central to any theory that is to reflect parts of our experience.
by James Hein - Portland State University
Programming experiments designed to help learning of discrete mathematics, logic, and computability. Most of the experiments are short and to the point, just like traditional homework problems, so that they reflect the daily classroom work.
by Frank Stephan - National University of Singapore
Recursion theory deals with the fundamental concepts on what subsets of natural numbers could be defined effectively and how complex the so defined sets are. This text gives an overview on the basic results and proof methods in recursion theory.
This book is intended as an introductory textbook in Computability Theory and Complexity Theory, with an emphasis on Formal Languages. Its target audience is CS and Math students with some background in programming and data structures.