Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
US$ 101.66
Quantity: 1 available
Add to basketCondition: Like New. Used - Like New. Book is new and unread but may have minor shelf wear. Your purchase helps support Sri Lankan Children's Charity 'The Rainbow Centre'. Our donations to The Rainbow Centre have helped provide an education and a safe haven to hundreds of children who live in appalling conditions.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 134.62
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Ria Christie Collections, Uxbridge, United Kingdom
US$ 134.62
Quantity: Over 20 available
Add to basketCondition: New. In.
Seller: Chiron Media, Wallingford, United Kingdom
US$ 132.66
Quantity: 10 available
Add to basketPF. Condition: New.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 134.61
Quantity: Over 20 available
Add to basketCondition: New.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: New.
Condition: Used. pp. 264.
US$ 150.25
Quantity: 1 available
Add to basketCondition: Used. pp. 264 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 2012. Paperback. . . . . .
Condition: New. pp. 264.
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Ireland
Condition: New. 1994. 1994th Edition. hardcover. . . . . .
Condition: Used. pp. 264.
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 2012. Paperback. . . . . . Books ship from the US and Ireland.
Taschenbuch. Condition: Neu. Subrecursive Programming Systems | Complexity & Succinctness | James S. Royer (u. a.) | Taschenbuch | viii | Englisch | 2012 | Birkhäuser | EAN 9781461266808 | Verantwortliche Person für die EU: Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Seller: Kennys Bookstore, Olney, MD, U.S.A.
Condition: New. 1994. 1994th Edition. hardcover. . . . . . Books ship from the US and Ireland.
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
US$ 190.41
Quantity: Over 20 available
Add to basketCondition: As New. Unread book in perfect condition.
Language: English
Published by Birkhäuser, Birkhäuser, 2012
ISBN 10: 1461266807 ISBN 13: 9781461266808
Seller: AHA-BUCH GmbH, Einbeck, Germany
Taschenbuch. Condition: Neu. Druck auf Anfrage Neuware - Printed after ordering - 1.1. What This Book is About This book is a study of subrecursive programming systems, efficiency/program-size trade-offs between such systems, and how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 179.22
Quantity: 1 available
Add to basketHardcover. Condition: Like New. Like New. book.
Seller: GreatBookPrices, Columbia, MD, U.S.A.
Condition: As New. Unread book in perfect condition.
Seller: Mispah books, Redhill, SURRE, United Kingdom
US$ 212.83
Quantity: 1 available
Add to basketPaperback. Condition: Like New. LIKE NEW. SHIPS FROM MULTIPLE LOCATIONS. book.
Seller: Brook Bookstore On Demand, Napoli, NA, Italy
Condition: new. Questo è un articolo print on demand.
Seller: moluna, Greven, Germany
US$ 111.84
Quantity: Over 20 available
Add to basketCondition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 1 Introduction.- 1.1 What This Book is About.- 1.1.1 Subrecursive Programming Systems.- 1.1.2 Relative Succinctness Trade-offs.- 1.1.3 The Toolkit.- 1.2 Outline of Part I. A Subrecursion Programming Systems Toolkit.- 1.3 Outline of Part II. Program Succinct.
Seller: moluna, Greven, Germany
US$ 111.84
Quantity: Over 20 available
Add to basketGebunden. Condition: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 1 Introduction.- 1.1 What This Book is About.- 1.1.1 Subrecursive Programming Systems.- 1.1.2 Relative Succinctness Trade-offs.- 1.1.3 The Toolkit.- 1.2 Outline of Part I. A Subrecursion Programming Systems Toolkit.- 1.3 Outline of Part II. Program Succinct.
Seller: Majestic Books, Hounslow, United Kingdom
US$ 167.69
Quantity: 4 available
Add to basketCondition: New. Print on Demand pp. 264 49:B&W 6.14 x 9.21 in or 234 x 156 mm (Royal 8vo) Perfect Bound on White w/Gloss Lam.
Seller: Biblios, Frankfurt am main, HESSE, Germany
Condition: New. PRINT ON DEMAND pp. 264.
Language: English
Published by Birkhäuser, Birkhäuser Okt 2012, 2012
ISBN 10: 1461266807 ISBN 13: 9781461266808
Seller: buchversandmimpf2000, Emtmannsberg, BAYE, Germany
Taschenbuch. Condition: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Nature c/o IBS, Benzstrasse 21, 48619 Heek 264 pp. Englisch.