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 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 Helene Kirchner, Pierre-Etienne Moreau - ESSLLI
This text first introduces the concept of rewriting which is behind rule-based systems. Then the rewriting logic and the rewriting calculus are defined and shown to be especially suited to describing concurrent and non-deterministic computations.
by V. E. Wolfengagen - JurInfoR
This work covers the advanced topics in main ideas of computing in general. Material is especially useful for the instructor, postgraduate and graduate students of IT-specialties and is suitable for the system of training of specialists.
by John E. Savage - Addison-Wesley
The book re-examines computer science, giving priority to resource tradeoffs and complexity classifications over the structure of machines and their relationships to languages. This viewpoint is motivated by more realistic computational models.