This PDF Models of Computation by John E. Savage covers the following
topics related to Computation Theory : The Role of Theory in Computer Science,
General Computational Models, Logic Circuits, Machines with Memory, Finite-State
Machines and Pushdown Automata, Computability, Algebraic and Combinatorial
Circuits, Parallel Computation, Computational Complexity, Complexity Classes,
Circuit Complexity, Space–Time Tradeoffs, Memory-Hierarchy Tradeoffs, VLSI
Models of Computation.
This PDF Models of Computation by John E. Savage covers the following
topics related to Computation Theory : The Role of Theory in Computer Science,
General Computational Models, Logic Circuits, Machines with Memory, Finite-State
Machines and Pushdown Automata, Computability, Algebraic and Combinatorial
Circuits, Parallel Computation, Computational Complexity, Complexity Classes,
Circuit Complexity, Space–Time Tradeoffs, Memory-Hierarchy Tradeoffs, VLSI
Models of Computation.
This note covers the following topics: Languages, Finite Automata,
Regular Languages and Sets, Context-Free Grammars, Pushdown Automata and
Context-Free Languages, Turing Machines, The Chomsky Hierarchy, P and NP.
This
note explains the following topics: Discrete mathematics, Deterministic Finite
Automata, Nondeterministic Finite Automata, Equivalence of DFA and NFA,
Nondeterministic Finite Auotmata, egular expressions and finite automata,
Non-regular languages and Pumping Lemma, Myhill-Nerode Theorem, Context-free
languages and Ambiguity, Closure Properties, Pumping Lemma and non-CFLs,
Closure Properties and non-CFL Languages, Decidable and Recognizable
Languages.
This course is an introduction to
the Theory of Computation. Topics covered includes: Background Mathematics,
Models of Computation, Context-Free Grammars, Automata, The Chomsky
Hierarchy.
This note explains the following topics: Symbols, strings and
languages, Finite automata, Regular expressions and languages, Markov models,
Context free languages, Language recognizers and generators, The Chomsky
hierarchy, Turing machines, Computability and actability, Computational
complexity.
This is a free textbook for an undergraduate course
on the Theory of Computation, which have been teaching at Carleton University
since 2002.Topics covered includes: Finite Automata and Regular Languages,
Context-Free Languages, Turing Machines and the Church-Turing Thesis,
Decidable and Undecidable Languages and Complexity Theory.
This book covers the
following topics: The RAM Model, The Primitive Recursive Functions, The
Partial Recursive Functions, Coding and Godelization, The Hierarchy of
Primitive Recursive Functions, Universality and Parametrisation, The type-free
lambda calculus.
This note covers the following topics: A brief history of
computing, Fundamentals, Formal languages and machine models, Computability
and undecidability, NP-completeness, Generalized number systems and
Cryptography mental poker.
This is an executable course note
implemented in Pidgin ML, which is a core subset of the Objective Caml
programming language under the so-called revised syntax.
This book introduces the basic concepts from computational number theory
and algebra, including all the necessary mathematical background. Covered topics
are: Basic properties of the integers, Congruences, Computing with large
integers, Euclid’s algorithm, The distribution of primes, Abelian groups, Rings,
Finite and discrete probability distributions, Probabilistic algorithms,
Probabilistic primality testing, Finding generators and discrete logarithms in
Zp, Quadratic reciprocity and computing modular square roots, Modules and vector
spaces, Matrices, Subexponential-time discrete logarithms and factoring,
Polynomial arithmetic and applications.