The authors frame the calendars of the world in a completely algorithmic form, allowing easy conversion among these calendars and the determination of secular and religious holidays. LISP code for all the algorithms are available on the Web.

    The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and G�del's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.

    It begins by providing an overview of the first two works of the trilogy, then goes on to consider the meaning of meaning. This explorat ion leads to a theory of how the brain works. This book differs from others in the field, in that it is written from the perspective of a theoretical biologist looking at the evolution of information systems as a basis for studying the phenomena of information, intelligence and meaning. It describes how neurons create a brain which understands information inputs and then is able to operate on such information.