Advertisement

A Basis for Theoretical Computer Science

  • Michael A. Arbib
  • A. J. Kfoury
  • Robert N. Moll

Part of the Texts and Monographs in Computer Science book series (MCS)

Table of contents

  1. Front Matter
    Pages i-viii
  2. Michael A. Arbib, A. J. Kfoury, Robert N. Moll
    Pages 1-30
  3. Michael A. Arbib, A. J. Kfoury, Robert N. Moll
    Pages 31-72
  4. Michael A. Arbib, A. J. Kfoury, Robert N. Moll
    Pages 73-110
  5. Michael A. Arbib, A. J. Kfoury, Robert N. Moll
    Pages 111-144
  6. Michael A. Arbib, A. J. Kfoury, Robert N. Moll
    Pages 145-174
  7. Michael A. Arbib, A. J. Kfoury, Robert N. Moll
    Pages 175-208
  8. Back Matter
    Pages 209-220

About this book

Introduction

Computer science seeks to provide a scientific basis for the study of inform a­ tion processing, the solution of problems by algorithms, and the design and programming of computers. The last forty years have seen increasing sophistication in the science, in the microelectronics which has made machines of staggering complexity economically feasible, in the advances in programming methodology which allow immense programs to be designed with increasing speed and reduced error, and in the development of mathematical techniques to allow the rigorous specification of program, process, and machine. The present volume is one of a series, The AKM Series in Theoretical Computer Science, designed to make key mathe­ matical developments in computer science readily accessible to under­ graduate and beginning graduate students. Specifically, this volume takes readers with little or no mathematical background beyond high school algebra, and gives them a taste of a number of topics in theoretical computer science while laying the mathematical foundation for the later, more detailed, study of such topics as formal language theory, computability theory, programming language semantics, and the study of program verification and correctness. Chapter 1 introduces the basic concepts of set theory, with special emphasis on functions and relations, using a simple algorithm to provide motivation. Chapter 2 presents the notion of inductive proof and gives the reader a good grasp on one of the most important notions of computer science: the recursive definition of functions and data structures.

Keywords

Graph Informatik Notation algorithms automata logic theoretical computer science

Authors and affiliations

  • Michael A. Arbib
    • 1
  • A. J. Kfoury
    • 2
  • Robert N. Moll
    • 1
  1. 1.Department of Computer and Information ScienceUniversity of MassachusettsAmherstUSA
  2. 2.Department of MathematicsBoston UniversityBostonUSA

Bibliographic information

  • DOI https://doi.org/10.1007/978-1-4613-9455-6
  • Copyright Information Springer-Verlag New York 1981
  • Publisher Name Springer, New York, NY
  • eBook Packages Springer Book Archive
  • Print ISBN 978-1-4613-9457-0
  • Online ISBN 978-1-4613-9455-6
  • Series Print ISSN 0172-603X
  • Buy this book on publisher's site