Skip to main content
  • Book
  • © 1994

Subrecursive Programming Systems

Complexity & Succinctness

Birkhäuser

Part of the book series: Progress in Theoretical Computer Science (PTCS)

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

This is a preview of subscription content, log in via an institution to check for access.

Table of contents (14 chapters)

  1. Front Matter

    Pages i-viii
  2. Introduction

    1. Introduction

      • James S. Royer, John Case
      Pages 1-18
  3. A Subrecursion Programming Systems Toolkit

    1. Front Matter

      Pages 19-19
    2. Basic Notation and Definitions

      • James S. Royer, John Case
      Pages 21-30
    3. Deterministic Multi-tape Turing Machines

      • James S. Royer, John Case
      Pages 31-55
    4. Programming Systems

      • James S. Royer, John Case
      Pages 56-94
    5. The LOOP Hierarchy

      • James S. Royer, John Case
      Pages 95-104
    6. The Poly-Degree Hierarchy

      • James S. Royer, John Case
      Pages 105-112
    7. Delayed Enumeration and Limiting Recursion

      • James S. Royer, John Case
      Pages 113-121
    8. Inseparability Notions

      • James S. Royer, John Case
      Pages 122-127
    9. Toolkit Demonstrations

      • James S. Royer, John Case
      Pages 128-151
  4. Program Succinctness

    1. Front Matter

      Pages 153-153
    2. Notions of Succinctness

      • James S. Royer, John Case
      Pages 155-161
    3. Limiting-Recursive Succinctness Progressions

      • James S. Royer, John Case
      Pages 162-190
    4. Succinctness for Finite and Infinite Variants

      • James S. Royer, John Case
      Pages 191-199
    5. Succinctness for Singleton Sets

      • James S. Royer, John Case
      Pages 200-220
    6. Further Problems

      • James S. Royer, John Case
      Pages 221-222
  5. Back Matter

    Pages 223-253

Authors and Affiliations

  • School of Computer and Information Sciences, Center for Science & Technology, Syracuse University, Syracuse, USA

    James S. Royer

  • Computer And Information Sciences, University of Delaware, Newark, USA

    John Case

Bibliographic Information

Buy it now

Buying options

eBook USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access