Recursion theory deals with the fundamental concepts on what subsets of natural numbers (or other famous countable domains) 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.

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.

This book is intended as an introductory textbook in Computability Theory and Complexity Theory, with an emphasis on Formal Languages. Its target audience is Computer Science and Math students with some background in programming, data structures, and discrete math, such as a sophomore in a Computer Science program. ...

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 mathematical theory that is to reflect parts of our physical or intellectual experience.

The author's goal as an educator and author is to build a bridge between computability and complexity theory and other areas of computer science, especially programming.

This text is essentially consisting of two parts, Classical Computability Theory and Generalized Computability Theory.