Progress in Theoretical Computer Science Subrecursive Programming Systems: Complexity & Succinctness, (Paperback)
Progress in Theoretical Computer Science Subrecursive Programming Systems: Complexity & Succinctness, (Paperback)
Hero image 0 of Progress in Theoretical Computer Science Subrecursive Programming Systems: Complexity & Succinctness, (Paperback), 0 of 1

Progress in Theoretical Computer Science Subrecursive Programming Systems: Complexity & Succinctness, (Paperback)

(No ratings yet)

Key item features

  • Progress in Theoretical Computer Science Subrecursive Programming Systems: Complexity & Succinctness, (Paperback)
  • Author: James S Royer
  • ISBN: 9781461266808
  • Format: Paperback
  • Publication Date: 2012-10-03
  • Page Count: 253

Specs

Publication date, October, 2012Author, James S RoyerBook format, PaperbackGenre, Computing & InternetPages, 253Age group, Adult

About this item

Product details

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.
  • Progress in Theoretical Computer Science Subrecursive Programming Systems: Complexity & Succinctness, (Paperback)
  • Author: James S Royer
  • ISBN: 9781461266808
  • Format: Paperback
  • Publication Date: 2012-10-03
  • Page Count: 253
info:
We aim to show you accurate product information. Manufacturers, suppliers and others provide what you see here, and we have not verified it.  

Specifications

Publication date

October, 2012

Author

James S Royer

Book format

Paperback

Genre

Computing & Internet

Warranty

Warranty information

Please be aware that the warranty terms on items offered for sale by third party Marketplace sellers may differ from those displayed in this section (if any). To confirm warranty terms on an item offered for sale by a third party Marketplace seller, please use the 'Contact seller' feature on the third party Marketplace seller's information page and request the item's warranty terms prior to purchase.

Customer ratings & reviews

0 out of 5 stars
0 ratings|0 reviews
This item does not have any reviews yet
Current price is $104.59
Price when purchased online
  • Free shipping
  • Free 90-day returns

How do you want your item?

Try 30 days for just $1! Choose a plan at checkout.
How do you want your item?
Ships to
Arrives by Wed, Dec 2
Sold and shipped by Walmart.com
Free 90-day returns
This item is gift eligible

More seller options (1)

Starting from $104.59
walmart plus

Try 30 days of Walmart+ for just $1!

T&C apply.