Items related to Subrecursive Programming Systems: Complexity &...
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science) - Hardcover
Synopsis
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.
"synopsis" may belong to another edition of this title.
Synopsis
This text develops the theory of subrecursive programming systems and applies it to the more general theory of structural complexity theory. Its first goal is to establish relative program succinctness between systems, improving and subsuming most prior results in this area and introducing several forms of the phenomena. Its second goal is to illustrate the applicability of these tools in the context of structural complexity theory. This book is suitable for researchers aquainted with the theory of computation and comfortable with mathematical proofs. It can also be used by computer science and mathematics advanced undergraduates and graduates.
"About this title" may belong to another edition of this title.
- PublisherBirkhäuser
- Publication date1994
- ISBN 10 0817637672
- ISBN 13 9780817637675
- BindingHardcover
- LanguageEnglish
- Number of pages261
Buy New
View this item
£ 74.65
FREE shipping from U.S.A. to United Kingdom
Destination, rates & speedsOther Popular Editions of the Same Title
Search results for Subrecursive Programming Systems: Complexity &...
Stock Image
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Seller: Phatpocket Limited, Waltham Abbey, HERTS, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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 Inventory # Z1-F-038-01618
Quantity: 2 available
Stock Image
Subrecursive Programming Systems - Complexity And Succinctness
Seller: Basi6 International, Irving, TX, U.S.A.
Seller rating 5 out of 5 stars
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. Seller Inventory # ABEJUNE24-129828
Quantity: 1 available
Stock Image
Subrecursive Programming Systems - Complexity And Succinctness
Seller: Romtrade Corp., STERLING HEIGHTS, MI, U.S.A.
Seller rating 5 out of 5 stars
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 Inventory # ABNR-91868
Quantity: 1 available
Seller Image
Subrecursive Programming Systems : Complexity & Succinctness
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. Seller Inventory # 5230727-n
Quantity: Over 20 available
Stock Image
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
Condition: New. In. Seller Inventory # ria9780817637675_new
Quantity: Over 20 available
Seller Image
Subrecursive Programming Systems
Print on DemandSeller: moluna, Greven, Germany
Seller rating 5 out of 5 stars
Gebunden. 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 Inventory # 5975490
Quantity: Over 20 available
Seller Image
Subrecursive Programming Systems : Complexity & Succinctness
Published by
Birkhäuser Boston, Birkhäuser Boston, 1994
ISBN 10: 0817637672
ISBN 13: 9780817637675
New
Hardcover
Seller: AHA-BUCH GmbH, Einbeck, Germany
Seller rating 5 out of 5 stars
Buch. 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 Inventory # 9780817637675
Quantity: 1 available
Stock Image
Subrecursive Programming Systems: Complexity & Succinctness
Print on DemandSeller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
Hardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days 575. Seller Inventory # C9780817637675
Quantity: Over 20 available
Stock Image
Subrecursive Programming Systems
Seller: Majestic Books, Hounslow, United Kingdom
Seller rating 5 out of 5 stars
Condition: 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 Inventory # 5829502
Quantity: 1 available
Stock Image
Subrecursive Programming Systems
Seller: Books Puddle, New York, NY, U.S.A.
Seller rating 4 out of 5 stars
Condition: Used. pp. 264. Seller Inventory # 263099809
Quantity: 1 available