Automata Theory (10)
Computability Theory (8)
Computational Complexity Theory (21)
Quantum Computing (32)
e-books in Theory of Computation category
by John E. Savage - Addison-Wesley , 1998
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 Anil Maheshwari, Michiel Smid - Carleton University , 2012
This is a textbook for an undergraduate course on the Theory of Computation. Contents: Finite Automata and Regular Languages; Context-Free Languages; Turing Machines and Church-Turing Thesis; Decidable and Undecidable Languages; Complexity Theory.
by Christian P. Robert - arXiv , 2010
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 Helene Kirchner, Pierre-Etienne Moreau - ESSLLI , 2001
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 , 2010
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 Lawrence C Paulson - University of Cambridge , 2002
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 C. D. H. Cooper - Macquarie University , 2008
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.
by David Evans - University of Virginia , 2009
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 Stephen Wolfram - Westview Press , 1994
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 Roland Backhouse , 2001
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 Eitan Gurari - Computer Science Pr , 1989
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.