Introduction to Theory of Computation
by Anil Maheshwari, Michiel Smid - Carleton University, 2012
As the introduction of the book says, “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.”
Bayesian Computational Methods
by Christian P. Robert - arXiv, 2010
As the introduction of the book says, “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.”
Rule-based Computation and Deduction
by Helene Kirchner, Pierre-Etienne Moreau - ESSLLI, 2001
As the introduction of the book says, “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.”
Applicative Computing: Its quarks, atoms and molecules
by V. E. Wolfengagen - JurInfoR, 2010
As the introduction of the book says, “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.”
Logic and Proof
by Lawrence C Paulson - University of Cambridge, 2002
As the introduction of the book says, “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.”
Languages and Machines
by C. D. H. Cooper - Macquarie University, 2008
As the introduction of the book says, “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.”
Introduction to Computing: Explorations in Language, Logic, and Machines
by David Evans - University of Virginia, 2009
As the introduction of the book says, “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.”
Cellular Automata And Complexity: Collected Papers
by Stephen Wolfram - Westview Press, 1994
As the introduction of the book says, “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.”
Galois Connections and Fixed Point Calculus
by Roland Backhouse, 2001
As the introduction of the book says, “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.”
An Introduction to the Theory of Computation
by Eitan Gurari - Computer Science Pr, 1989
As the introduction of the book says, “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 Anil Maheshwari, Michiel Smid - Carleton University, 2012
As the introduction of the book says, “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.”
Bayesian Computational Methods
by Christian P. Robert - arXiv, 2010
As the introduction of the book says, “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.”
Rule-based Computation and Deduction
by Helene Kirchner, Pierre-Etienne Moreau - ESSLLI, 2001
As the introduction of the book says, “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.”
Applicative Computing: Its quarks, atoms and molecules
by V. E. Wolfengagen - JurInfoR, 2010
As the introduction of the book says, “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.”
Logic and Proof
by Lawrence C Paulson - University of Cambridge, 2002
As the introduction of the book says, “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.”
Languages and Machines
by C. D. H. Cooper - Macquarie University, 2008
As the introduction of the book says, “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.”
Introduction to Computing: Explorations in Language, Logic, and Machines
by David Evans - University of Virginia, 2009
As the introduction of the book says, “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.”
Cellular Automata And Complexity: Collected Papers
by Stephen Wolfram - Westview Press, 1994
As the introduction of the book says, “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.”
Galois Connections and Fixed Point Calculus
by Roland Backhouse, 2001
As the introduction of the book says, “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.”
An Introduction to the Theory of Computation
by Eitan Gurari - Computer Science Pr, 1989
As the introduction of the book says, “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.”
0 comments:
Post a Comment