Introduction to Theory of Computation
by Anil Maheshwari, Michiel Smid
Publisher: Carleton University 2012
Number of pages: 246
This is a free textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and the Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.
Home page url
Download or read it online for free here:
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 Stephen Wolfram - Westview Press
These original 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 computer science, physics, economics, biology, and many other areas.
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.
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.