Subrecursive Programming Systems
Complexity & Succinctness
Published on 6. December 2012
VIII, 253 pages
978-1-4612-0249-3 (ISBN)
Description
Zur Zeit liegt uns keine Inhaltsangabe vor.
More details
Other editions
Additional editions
Book
10/2012
Springer-Verlag New York Inc.
€106.99
Shipment within 15-20 days
Book
08/1994
Birkhauser Boston Inc
€106.99
Shipment within 15-20 days
Content
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.
