Welcome to E-Books Directory
This page lists freely downloadable books.

 

e-books in this category

Computability TheoryComputability Theory
by Wilfried Sieg - Carnegie Mellon University , 2006
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.
(972 views)

Computability and ComplexityComputability and Complexity
- Wikibooks , 2010
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.
(1236 views)

Recursion TheoryRecursion Theory
by Frank Stephan - National University of Singapore , 2009
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.
(1715 views)

Computability and RandomnessComputability and Randomness
by Andre Nies - Oxford University Press , 2008
Covering the basics as well as recent research results, this book provides an introduction to the interface of computability and randomness for graduates and researchers in computability theory, theoretical computer science, and measure theory.
(2045 views)

Computability and Complexity from a Programming PerspectiveComputability and Complexity from a Programming Perspective
by Neil D. Jones - The MIT Press , 1997
The author builds a bridge between computability and complexity theory and other areas of computer science. Jones uses concepts familiar from programming languages to make computability and complexity more accessible to computer scientists.
(4203 views)

Prolog Experiments in Discrete Mathematics, Logic, and ComputabilityProlog Experiments in Discrete Mathematics, Logic, and Computability
by James Hein - Portland State University , 2009
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.
(8695 views)