Logo

Mathematical Foundations of Computer Science

Small book cover: Mathematical Foundations of Computer Science

Mathematical Foundations of Computer Science
by

Publisher: Duke University

Description:
These lecture notes present an introduction to theoretical computer science including studies of abstract machines, the language hierarchy from regular languages to recursively enumerable languages, noncomputability and complexity theory.

Home page url

Download or read it online for free here:
Download link
(multiple PDF, PS files)

Similar books

Book cover: Foundations of ComputationFoundations of Computation
by - Hobart and William Smith Colleges
The book covers material on logic, sets, and functions that would often be taught in a course in discrete mathematics. The second part covers automata, formal languages, and grammar that would ordinarily be encountered in an upper level course.
(18352 views)
Book cover: Introduction to High-Performance Scientific ComputingIntroduction to High-Performance Scientific Computing
by - University of Texas
A computational scientist needs knowledge of several aspects of numerical analysis and discrete mathematics. This text covers: computer architecture, parallel computers, machine arithmetic, numerical linear algebra, applications.
(16528 views)
Book cover: Building Blocks for Theoretical Computer ScienceBuilding Blocks for Theoretical Computer Science
by - University of Illinois, Urbana-Champaign
This book provides a survey of basic mathematical objects, notation, and techniques useful in later computer science courses. It gives a brief introduction to some key topics: algorithm analysis and complexity, automata theory, and computability.
(15283 views)
Book cover: Concrete Abstractions: An Introduction to Computer Science Using SchemeConcrete Abstractions: An Introduction to Computer Science Using Scheme
by - Course Technology
The book Concrete Abstractions covers the programming and data structures basics. It will give first-time computer science students the opportunity to not only write programs, but to prove theorems and analyze algorithms as well.
(22902 views)