Semantics with Applications...   Read Article.

This book is intended as a reference for professional cryptographers, presenting the techniques and algorithms of greatest interest to the current practitioner, along with the supporting motivation and background material. It also provides a comprehensive source from which to learn cryptography, serving both students and instructors. In addition, the...   Read Article.

Matroid Decomposition...   Read Article.

This book presents the final version of Chaitin's course on the limits of mathematical reasoning. This course uses algorithmic information theory to show that mathematics has serious limitations, and features a new more didactic approach to algorithmic information theory using LISP and Mathematica software. The thesis of the book is that the incompleteness...   Read Article.

this book is about computers, graphics, and learning, as opposed to computer graphics for learning. There is a difference. This book considers and integrates a broad spectrum of information related to the instructional design of visual information for learning and how the computer supports this process. Another way to understand the distinction is to...   Read Article.

Implementing Mathematics with The Nuprl Proof System...   Read Article.

Practical Foundations of Mathematics...   Read Article.

A Course in Universal Algebra...   Read Article.

Parallel Complexity Theory...   Read Article.

Cellular Automata and Complexity...   Read Article.

Algorithms and Complexity...   Read Article.

Introduction to Finite Mathematics...   Read Article.

Mathematical Foundations of Computer Science...   Read Article.

Introduction to Computer Science I...   Read Article.

This book explores some of the more important terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages; theories that are interesting also in their own right. These theories provide abstract models that...   Read Article.

This course will have two main sections. The first, shorter section will introduce inheritance and polymorphism in object oriented programming. This is material that you will need in the third year, and which makes the implementation of some datastructures more elegant and more re-useable. However this section of the course is fairly independent of...   Read Article.

This handbook was written with the intention of making available to the computer scientist, instructor or programmer the wealth of information which the field has generated in the last 20 years....   Read Article.

Problems on Algorithms, 2nd Edition...   Read Article.

This is a dictionary of algorithms, algorithmic techniques, data structures, archetypical problems, and related definitions. Algorithms include common functions, such as Ackermann's function. Problems include traveling salesman and Byzantine generals. Some entries have links to implementations and more information....   Read Article.

The main theme of this book is to describe complex phenomena as structures of interacting objects. Object technology is applicable to a wide range of phenomena on many different levels. Examples are work procedures on the enterprise level; large-scale applications on the systems level; and small, technical details on the program design level....   Read Article.