The Pillars of Computation Theory

State, Encoding, Nondeterminism

  • Arnold L. Rosenberg

Part of the Universitext book series (UTX)

Table of contents

  1. Front Matter
    Pages i-xv
  2. Prolegomena

    1. Front Matter
      Pages 1-1
    2. Arnold L. Rosenberg
      Pages 3-12
    3. Arnold L. Rosenberg
      Pages 13-29
  3. State

    1. Front Matter
      Pages 31-31
    2. Arnold L. Rosenberg
      Pages 33-50
    3. Arnold L. Rosenberg
      Pages 51-62
    4. Arnold L. Rosenberg
      Pages 63-90
    5. Arnold L. Rosenberg
      Pages 91-110
  4. Encoding

    1. Front Matter
      Pages 111-112
    2. Arnold L. Rosenberg
      Pages 147-207
  5. Nondeterminism

    1. Front Matter
      Pages 209-209
    2. Arnold L. Rosenberg
      Pages 211-216
    3. Arnold L. Rosenberg
      Pages 217-232
    4. Arnold L. Rosenberg
      Pages 233-244
    5. Arnold L. Rosenberg
      Pages 245-297
  6. Back Matter
    Pages 1-25

About this book


Computation theory is a discipline that strives to use mathematical tools and concepts in order to expose the nature of the activity that we call “computation” and to explain a broad range of observed computational phenomena. Why is it harder to perform some computations than others? Are the differences in difficulty that we observe inherent, or are they artifacts of the way we try to perform the computations? Even more basically: how does one reason about such questions?

This book strives to endow upper-level undergraduate students and lower-level graduate students with the conceptual and manipulative tools necessary to make Computation theory part of their professional lives. The author tries to achieve this goal via three stratagems that set this book apart from most other texts on the subject.

(1) The author develops the necessary mathematical concepts and tools from their simplest instances, so that the student has the opportunity to gain operational control over the necessary mathematics.

(2) He organizes the development of the theory around the three “pillars” that give the book its name, so that the student sees computational topics that have the same intellectual origins developed in physical proximity to one another.

(3) He strives to illustrate the “big ideas” that computation theory is built upon with applications of these ideas within “practical” domains that the students have seen elsewhere in their courses, in mathematics, in computer science, and in computer engineering.


Graph NC automata complexity complexity theory computability computability theory theoretical computer science

Authors and affiliations

  • Arnold L. Rosenberg
    • 1
  1. 1.FalmouthU.S.A.

Bibliographic information

Industry Sectors
Finance, Business & Banking
IT & Software
Consumer Packaged Goods