by Gregory J. Chaitin
Publisher: Springer 2001
Number of pages: 164
In this book on algorithmic information theory, the author compares his concept of randomness, which is based on the complexity of the generating algorithm, with other concepts and discusses its relation to incompleteness and the halting problem. Algorithms are described in a dialect of LISP. The style mostly is that of a lecture, lively and readable.
Home page url
Download or read it online for free here:
by Mark Watson
This book is an introduction to Common Lisp. The author considers Common Lisp to be twice as good as Java for some applications. Common Lisp compilers are freely available, stable, and compiled Common Lisp code is very fast.
by David S. Touretzky - Benjamin-Cummings Pub Co
This is a gentle introduction to Common Lisp for students taking their first programming course. No prior mathematical background beyond arithmetic is assumed. There are lots of examples, the author avoided technical jargon.
by Robert J. Chassell - Free Software Foundation, Inc.
This is an introduction to programming in Emacs Lisp for people who are not programmers. The text is designed to get you started: to guide you in learning the fundamentals of programming, and to show you how you can teach yourself to go further.
by Clark Weissman - Dickenson Publishing Company
The chapters of this book expose the reader to the LISP formalism and give him an opportunity to acquire the necessary skills for processing symbolic data. Learning these skills is analogous to learning the rules of arithmetic ...