Cellular Automata And Complexity: Collected Papers
by Stephen Wolfram
Publisher: Westview Press 1994
Number of pages: 608
These original and widely known papers on cellular automata and complexity provide a highly readable account of what has become a major new field of science, with important implications for physics, biology, economics, computer science, and many other areas.
Home page url
Download or read it online for free here:
(multiple PDF files)
by David Evans - University of Virginia
An introduction to the most important ideas in computing. It focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the limits of what can be computed mechanically.
by Roland Backhouse
The book on the fundamental algebraic structures in the mathematics of program construction focusing the algebraic properties of recursion and how these are applied to the generic solution of programming problems. The tutorial covers fixed point calculus.
by Lawrence C Paulson - University of Cambridge
These lecture notes give a brief introduction to logic, with including the resolution method of theorem-proving and its relation to the programming language Prolog. Formal logic is used for specifying and verifying computer systems.
by Eitan Gurari - Computer Science Pr
The book explores questions and terminologies concerning programs, computers, and computation. The exploration reduces to a study of mathematical theories, such as those of automata and formal languages, theories interesting in their own right.