Subrecursive Programming Systems

Complexity & Succinctness

Authors:

ISBN: 978-1-4612-6680-8 (Print) 978-1-4612-0249-3 (Online)

Table of contents (14 chapters)

  1. Front Matter

    Pages i-viii

  2. Introduction

    1. No Access

      Book Chapter

      Pages 1-18

      Introduction

  3. A Subrecursion Programming Systems Toolkit

    1. Front Matter

      Pages 19-19

    2. No Access

      Book Chapter

      Pages 21-30

      Basic Notation and Definitions

    3. No Access

      Book Chapter

      Pages 31-55

      Deterministic Multi-tape Turing Machines

    4. No Access

      Book Chapter

      Pages 56-94

      Programming Systems

    5. No Access

      Book Chapter

      Pages 95-104

      The LOOP Hierarchy

    6. No Access

      Book Chapter

      Pages 105-112

      The Poly-Degree Hierarchy

    7. No Access

      Book Chapter

      Pages 113-121

      Delayed Enumeration and Limiting Recursion

    8. No Access

      Book Chapter

      Pages 122-127

      Inseparability Notions

    9. No Access

      Book Chapter

      Pages 128-151

      Toolkit Demonstrations

  4. Program Succinctness

    1. Front Matter

      Pages 153-153

    2. No Access

      Book Chapter

      Pages 155-161

      Notions of Succinctness

    3. No Access

      Book Chapter

      Pages 162-190

      Limiting-Recursive Succinctness Progressions

    4. No Access

      Book Chapter

      Pages 191-199

      Succinctness for Finite and Infinite Variants

    5. No Access

      Book Chapter

      Pages 200-220

      Succinctness for Singleton Sets

    6. No Access

      Book Chapter

      Pages 221-222

      Further Problems

  5. Back Matter

    Pages 223-253