• Title: Delftse Foundations of Computation
• Authors Stefan Hugtenburg, Neil Yorke-Smith
• Publisher: Delft University of Technology; eBook (Creative Commons Licensed)
• License(s): Creative Commons License (CC)
• Paperback: N/A
• eBook: PDF
• Language: English
• ISBN-10: N/A
• ISBN-13: N/A
• Share This:  

Book Description

This is 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.

• N/A

• Amazon

• Introduction to Computer Science
• Theory of Computation
• Mathematical Logic - Set Theory, Model Theory, Computability, etc
• Theory of Programming Languages

• Delftse Foundations of Computation (Stefan Hugtenburg, et al)
• The Mirror Site (1) - PDF
• The Mirror Site (2) - PDF

• Foundations of Computation (Carol Critchlow, et al)

  It includes topics from discrete mathematics, automata theory, formal language theory, and the theory of computation, along with practical applications to computer science. The course has no prerequisites other than introductory computer programming.

• Models of Computation: Exploring the Power of Computing

  It covers the traditional topics of formal languages, automata and complexity classes, as well as an introduction to the more modern topics of space-time tradeoffs, memory hierarchies, parallel computation, the VLSI model, and circuit complexity.

• Mathematics and Computation (Avi Wigderson)

  This book provides a broad, conceptual overview of computational complexity theory - the mathematical study of efficient computation. With important practical applications to computer science and industry, computational complexity theory, etc.

• Introduction to Computing: Language, Logic, and Machines

  This book focuses on how to describe information processes by defining procedures, how to analyze the costs required to carry out a procedure, and the fundamental limits of what can and cannot be computed mechanically.

• Soft Computing: Techniques in Engineering Sciences

  Soft Computing is used where a complex problem is not adequately specified for the use of conventional math and computer techniques. This book elaborates on the most recent applications of Soft Computing in various fields of engineering.

• Quantum Computing: Progress and Prospects

  Provides an introduction to the Quantum Computing, including the unique characteristics and constraints of the technology, and assesses the feasibility and implications of creating a functional quantum computer capable of addressing real-world problems.

• Theory of Computation, Making Connections (Jim Hefferon)

  The book is geared toward those who thirst for computation theory knowledge. To cater to the demands of a wide range of people, the principles in this book are explained in a way that is easy to understand, digest and apply in the upcoming career.

• Introduction to Theory of Computation (Anil Maheshwari, et al)

  This is a textbook on formal languages, automata theory, and computational complexity. This text strikes a good balance between rigor and an intuitive approach to computer theory.

• Computing Fundamentals: Theory and Practice of Software Design

  The book introduces the reader to computer programming, i.e. algorithms and data structures. It covers many new programming concepts that have emerged in recent years including object-oriented programming and design patterns.

• Matters Computational: Ideas, Algorithms, Source Code

  This book provides algorithms and ideas for computationalists, whether a working programmer or anyone interested in methods of computation. The implementations are done in C++ and the GP language, written for POSIX-compliant platforms.

• Introduction to Theory of Computation (Eitan M. Gurari)

  This book explores some of the more important terminologies and questions concerning programs, computers, problems, and computation. The exploration reduces in many cases to a study of mathematical theories, such as those of automata and formal languages; theories that are interesting also in their own right.