0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming > Software engineering

Buy Now

Subrecursive Programming Systems - Complexity & Succinctness (Paperback, Softcover reprint of the original 1st ed. 1994) Loot Price: R2,918
Discovery Miles 29 180
Subrecursive Programming Systems - Complexity & Succinctness (Paperback, Softcover reprint of the original 1st ed. 1994): James...

Subrecursive Programming Systems - Complexity & Succinctness (Paperback, Softcover reprint of the original 1st ed. 1994)

James S. Royer, John Case

Series: Progress in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,918 Discovery Miles 29 180 | Repayment Terms: R273 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

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.

General

Imprint: Springer-Verlag New York
Country of origin: United States
Series: Progress in Theoretical Computer Science
Release date: December 2012
First published: 1994
Authors: James S. Royer • John Case
Dimensions: 235 x 155 x 14mm (L x W x T)
Format: Paperback
Pages: 253
Edition: Softcover reprint of the original 1st ed. 1994
ISBN-13: 978-1-4612-6680-8
Categories: Books > Computing & IT > Computer programming > Software engineering
Promotions
LSN: 1-4612-6680-7
Barcode: 9781461266808

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners