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 Christian P. Robert - arXiv
We will first present the most standard computational challenges met in Bayesian Statistics, focusing primarily on mixture estimation and on model choice issues, and then relate these problems with computational solutions.
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.
by C. D. H. Cooper - Macquarie University
This is a text on discrete mathematics. It includes chapters on logic, set theory and strings and languages. There are some chapters on finite-state machines, some chapters on Turing machines and computability, and a couple of chapters on codes.