0
Your cart

Your cart is empty

Books > Computing & IT > Computer programming

Buy Now

Subrecursive Programming Systems - Complexity & Succinctness (Hardcover, 1994 ed.) Loot Price: R2,790
Discovery Miles 27 900
Subrecursive Programming Systems - Complexity & Succinctness (Hardcover, 1994 ed.): James S. Royer, John Case

Subrecursive Programming Systems - Complexity & Succinctness (Hardcover, 1994 ed.)

James S. Royer, John Case

Series: Progress in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,790 Discovery Miles 27 900 | Repayment Terms: R261 pm x 12*

Bookmark and Share

Expected to ship within 18 - 22 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: Birkhauser Boston
Country of origin: United States
Series: Progress in Theoretical Computer Science
Release date: August 1994
First published: 1994
Authors: James S. Royer • John Case
Dimensions: 235 x 155 x 15mm (L x W x T)
Format: Hardcover
Pages: 253
Edition: 1994 ed.
ISBN-13: 978-0-8176-3767-5
Categories: Books > Computing & IT > General theory of computing > Mathematical theory of computation
Books > Computing & IT > Computer programming > General
Promotions
LSN: 0-8176-3767-2
Barcode: 9780817637675

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!

You might also like..

Problem Solving with C++ - Global…
Walter Savitch Paperback R2,189 R1,762 Discovery Miles 17 620
Programming Logic & Design
Joyce Farrell Paperback R757 Discovery Miles 7 570
C++ Programming - Program Design…
D. Malik Paperback R1,646 R1,523 Discovery Miles 15 230
Program Construction - Calculating…
Roland Backhouse Paperback R2,460 Discovery Miles 24 600
Programming Logic & Design…
Joyce Farrell Paperback R1,256 R1,170 Discovery Miles 11 700
Hardware Accelerator Systems for…
Shiho Kim, Ganesh Chandra Deka Hardcover R3,950 Discovery Miles 39 500
Dark Silicon and Future On-chip Systems…
Suyel Namasudra, Hamid Sarbazi-Azad Hardcover R3,940 Discovery Miles 39 400
Temporal Data Mining via Unsupervised…
Yun Yang Paperback R1,173 Discovery Miles 11 730
Creativity in Computing and DataFlow…
Suyel Namasudra, Veljko Milutinovic Hardcover R4,204 Discovery Miles 42 040
News Search, Blogs and Feeds - A Toolkit
Lars Vage, Lars Iselid Paperback R1,332 Discovery Miles 13 320
Microcontroller Projects in C for the…
Dogan Ibrahim Paperback R1,455 Discovery Miles 14 550
Essential Java for Scientists and…
Brian Hahn, Katherine Malan Paperback R1,266 Discovery Miles 12 660

See more

Partners