Articles liés à Subrecursive Programming Systems: Complexity &...
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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
- ÉditeurBirkhauser Boston Inc
- Date d'édition1994
- ISBN 10 0817637672
- ISBN 13 9780817637675
- ReliureRelié
- Langueanglais
- Nombre de pages253
- Coordonnées du fabricantnon disponible
Acheter neuf
Afficher cet article
EUR 86,69
Gratuit expédition depuis Etats-Unis vers France
Destinations, frais et délaisAutres éditions populaires du même titre
Résultats de recherche pour Subrecursive Programming Systems: Complexity &...
Image d'archives
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Edité par
Birkh�user, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Ancien ou d'occasion
Couverture rigide
Vendeur : Phatpocket Limited, Waltham Abbey, HERTS, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur Z1-F-038-01618
Quantité disponible : 2 disponible(s)
Image d'archives
Subrecursive Programming Systems - Complexity And Succinctness
Vendeur : Romtrade Corp., STERLING HEIGHTS, MI, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : 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. N° de réf. du vendeur ABNR-91868
Quantité disponible : 1 disponible(s)
Image d'archives
Subrecursive Programming Systems - Complexity And Succinctness
Vendeur : Basi6 International, Irving, TX, Etats-Unis
Évaluation du vendeur 5 sur 5 étoiles
Etat : Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service. N° de réf. du vendeur ABEJUNE24-129828
Quantité disponible : 1 disponible(s)
Image fournie par le vendeur
Subrecursive Programming Systems
Edité par
Birkhäuser Boston, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Neuf
Couverture rigide
Vendeur : moluna, Greven, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Gebunden. Etat : 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. N° de réf. du vendeur 5975490
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Subrecursive Programming Systems
Edité par
Birkhäuser Boston, Birkhäuser Boston Aug 1994, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Neuf
Buch
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Basel AG in Springer Science + Business Media, Heidelberger Platz 3, 14197 Berlin 264 pp. Englisch. N° de réf. du vendeur 9780817637675
Quantité disponible : 1 disponible(s)
Image d'archives
Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : New. In. N° de réf. du vendeur ria9780817637675_new
Quantité disponible : Plus de 20 disponibles
Image fournie par le vendeur
Subrecursive Programming Systems : Complexity & Succinctness
Edité par
Birkhäuser Boston, Birkhäuser Boston, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Neuf
Couverture rigide
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Buch. Etat : 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. N° de réf. du vendeur 9780817637675
Quantité disponible : 1 disponible(s)
Image d'archives
Subrecursive Programming Systems
Edité par
Springer, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Ancien ou d'occasion
Couverture rigide
Vendeur : Books Puddle, New York, NY, Etats-Unis
Évaluation du vendeur 4 sur 5 étoiles
Etat : Used. pp. 264. N° de réf. du vendeur 263099809
Quantité disponible : 1 disponible(s)
Image d'archives
Subrecursive Programming Systems
Edité par
Springer, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Ancien ou d'occasion
Couverture rigide
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Évaluation du vendeur 5 sur 5 étoiles
Etat : Used. pp. 264 52:B&W 6.14 x 9.21in or 234 x 156mm (Royal 8vo) Case Laminate on White w/Gloss Lam. N° de réf. du vendeur 5829502
Quantité disponible : 1 disponible(s)
Image d'archives
Subrecursive Programming Systems
Edité par
Springer, 1994
ISBN 10 : 0817637672
ISBN 13 : 9780817637675
Ancien ou d'occasion
Couverture rigide
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Évaluation du vendeur 5 sur 5 étoiles
Etat : Used. pp. 264. N° de réf. du vendeur 183099819
Quantité disponible : 1 disponible(s)