This note
covers the following topics: Automata, Set Theory, The Natural numbers and
Induction, Foundations of Language Theory, Operations on Languages,
Deterministic Finite Automata, Formal Languages, Computability, Computations
of Turing Machines, The Primitive Recursive Functions, The Partial Recursive
Functions, DNA Computing, Analog Computing and Scientific Computing.

This note provides
an introduction to the theory of computational complexity. Topics covered
includes: Models of computation, Time and space complexity classes,
Nonterminism and NP, Diagonalization, Oracles and relativization, Alternation,
Space complexity, Natural proofs, Randomized classes, Counting classes,
Descriptive complexity and Interactive proofs.

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 note
covers the following topics: Automata, Set Theory, The Natural numbers and
Induction, Foundations of Language Theory, Operations on Languages,
Deterministic Finite Automata, Formal Languages, Computability, Computations
of Turing Machines, The Primitive Recursive Functions, The Partial Recursive
Functions, DNA Computing, Analog Computing and Scientific Computing.

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 course note provides a challenging introduction to some of the
central ideas of theoretical computer science. It attempts to present a vision
of computer science beyond computers: that is, CS as a set of mathematical
tools for understanding complex systems such as universes and minds.

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.