Subrecursive Programming Systems

Complexity & Succinctness

von John Case, James S. Royer

264 Seiten, Taschenbuch

Kurzbeschreibung des Verlags

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.

• Reihe: Progress in Theoretical Computer Science
• Themen: Informatik und Informationstechnologie Computerprogrammierung und Softwareentwicklung Software Engineering
• ISBN: 9781461266808
• Sprache: Englisch
• Erscheinungsdatum: 03.10.2012
• Größe: 235 x 155 mm
• Verlag: Birkhäuser