Consists of three consecutive parts: 1. Basic Concepts of Computability. 2. Traditional Recursion Theory. 3. Unified Type 2 theory of constructivity and computability on Baire's space including a general the- ory of representations.
In addition, they appear in algorithms analysis and in the bulk of discrete mathematics taught to computer scientists. This book is devoted to the background of these methods.
The contents of this volume are application oriented. The volume contains a de tailed presentation of 19 applications of CP-nets, covering a broad range of ap plication areas.