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

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

SKU: DADAX0817637672 In Stock
Sale price$64.51 Regular price$92.16
Save $27.65
Quantity
Add to wishlist
Add to compare
Shipping & Tax will be calculated at Checkout.
Delivery time: 3-5 business days (USA)
Delivery time: 8-12 business days (International)
15 days return policy
Payment Options

Help

If you have any questions, you are always welcome to contact us. We'll get back to you as soon as possible, withing 24 hours on weekdays.

Customer service

All questions about your order, return and delivery must be sent to our customer service team by e-mail at yourstore@yourdomain.com

Sale & Press

If you are interested in selling our products, need more information about our brand or wish to make a collaboration, please contact us at press@yourdomain.com

Customer Reviews

Be the first to write a review
0%
(0)
0%
(0)
0%
(0)
0%
(0)
0%
(0)

1.1. What This Book is About This book is a study of subrecursive programming systems, efficiency/programsize tradeoffs 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 MeyerRitchie LOOP language [MR67, DW83], a restricted assem bly language with bounded loops as the only allowed deviation from straightline programming; 2. multitape '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 generalpurpose programming language (e.g., Lisp or Modula2) for which there is a proof in some par ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Shipping & Returns

Shipping
We ship your order within 2–3 business days for USA deliveries and 5–8 business days for international shipments. Once your package has been dispatched from our warehouse, you'll receive an email confirmation with a tracking number, allowing you to track the status of your delivery.

Returns
To facilitate a smooth return process, a Return Authorization (RA) Number is required for all returns. Returns without a valid RA number will be declined and may incur additional fees. You can request an RA number within 15 days of the original delivery date. For more details, please refer to our Return & Refund Policy page.

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Warranty

We provide a 2-year limited warranty, from the date of purchase for all our products.

If you believe you have received a defective product, or are experiencing any problems with your product, please contact us.

This warranty strictly does not cover damages that arose from negligence, misuse, wear and tear, or not in accordance with product instructions (dropping the product, etc.).

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Secure Payment

Your payment information is processed securely. We do not store credit card details nor have access to your credit card information.

We accept payments with :
Visa, MasterCard, American Express, Paypal, Shopify Payments, Shop Pay and more.

Related Products

You may also like