Subrecursive Programming Systems von James S. Royer | Complexity & Succinctness | ISBN 9781461266808

Subrecursive Programming Systems

Complexity & Succinctness

von James S. Royer und John Case
Mitwirkende
Autor / AutorinJames S. Royer
Autor / AutorinJohn Case
Buchcover Subrecursive Programming Systems | James S. Royer | EAN 9781461266808 | ISBN 1-4612-6680-7 | ISBN 978-1-4612-6680-8

Subrecursive Programming Systems

Complexity & Succinctness

von James S. Royer und John Case
Mitwirkende
Autor / AutorinJames S. Royer
Autor / AutorinJohn Case

Inhaltsverzeichnis

  • 1 Introduction.
  • 1.1 What This Book is About.
  • 1.2 Outline of Part I. A Subrecursion Programming Systems Toolkit.
  • 1.3 Outline of Part II. Program Succinctness.
  • 1.4 Brief History of Prior Results.
  • 1.5 How to Use This Book.
  • 1.6 Acknowledgments.
  • I A Subrecursion Programming Systems Toolkit.
  • 2 Basic Notation and Definitions.
  • 3 Deterministic Multi-tape Turing Machines.
  • 4 Programming Systems.
  • 5 The LOOP Hierarchy.
  • 6 The Poly-Degree Hierarchy.
  • 7 Delayed Enumeration and Limiting Recursion.
  • 8 Inseparability Notions.
  • 9 Toolkit Demonstrations.
  • II Program Succinctness.
  • 10 Notions of Succinctness.
  • 11 Limiting-Recursive Succinctness Progressions.
  • 12 Succinctness for Finite and Infinite Variants.
  • 13 Succinctness for Singleton Sets.
  • 14 Further Problems.
  • Appendix A Exercises.
  • Appendix B Solutions for Selected Exercises.
  • Notation Index.