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.

Bestandsnummer des Verk�ufers Z1-F-038-01618

Verk�ufer kontaktieren

Diesen Artikel melden

Bibliografische Details

Titel: Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Verlag: Birkh�user
Erscheinungsjahr: 1994
Sprache: Englisch
ISBN-10: 0817637672
ISBN-13: 9780817637675
Einband: Hardcover
Zustand: Like New

�ber diesen Titel

Inhaltsangabe

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.

Rese�a del editor

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.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Phatpocket Limited is a world class secondhand bookstore located in the Hertfordshire countryside in the United Kingdom. We specialize in textbooks across an enormous variety of subjects. We aim to provide a low cost source of high quality textbooks to the academic community. We also have a sizable collection of rare and collectible books. We are dedicated to providing our customers with the highest standard of customer service in the bookselling business.Phatpocket Limited is registered in England and Wales: No. 04924751.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Phatpocket Limited
1A The Maltings, Railway Place, Hertford, SG13 7JT, United Kingdom

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Books are usually shipped within two working days. All of our books have a 14 or 30 day no hassle money back guarantee unless stated otherwise in the book's description. Item must be returned in the exact same condition that it was received. Through our work with The Rainbow Centre and other Charity Partners, we have already given hundreds of young people in Sri Lanka and Africa the vital chance to get an education.

Your satisfaction is extremely important to us and we would be happy to work wit...

Mehr Information

Versandbedingungen

Orders usually ship within 2 business days. Shipping costs are based on books weighing 2.2 LB, or 1 KG. If your book order is heavy or oversized, we may contact you to let you know extra shipping is required.

In spite of our best efforts, a small number of the items in our catalogue may be mispriced or out of stock. If an item's correct price is higher than our stated price, we will, at our discretion, either contact you for instructions before shipping or cancel your order and notify you of such cancellation.