**Delftse Foundations of Computation**

by Stefan Hugtenburg, Neil Yorke-Smith

**Publisher**: TU Delft Open 2018**ISBN-13**: 9789463660839**Number of pages**: 176

**Description**:

Delftse Foundations of Computation is a textbook for a one quarter introductory course in theoretical computer science. It includes topics from propositional and predicate logic, proof techniques, set theory and the theory of computation, along with practical applications to computer science. It has no prerequisites other than a general familiarity with computer programming.

Download or read it online for free here:

**Download link**

(5.1MB, PDF)

## Similar books

**The Fourth Paradigm: Data-Intensive Scientific Discovery**

by

**Tony Hey, Stewart Tansley, Kristin Tolle**-

**Microsoft Research**

The Fourth Paradigm, the collection of essays expands on the vision of pioneering computer scientist Jim Gray for a new, fourth paradigm of discovery based on data-intensive science and offers insights into how it can be fully realized.

(

**17215**views)

**Building Blocks for Theoretical Computer Science**

by

**Margaret M. Fleck**-

**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.

(

**11485**views)

**Foundations of Computer Science**

by

**Lawrence C Paulson**-

**University of Cambridge**

This text teaches programming and presents some fundamental principles of computer science, especially algorithm design. The programming in this course is based on the language ML and mostly concerns the functional programming style.

(

**21927**views)

**Mathematical Foundations of Computer Science**

by

**Susan Rodger**-

**Duke University**

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.

(

**15870**views)