Subrecursive Programming Systems

Name: Subrecursive Programming Systems
SKU: 2524703
Price: 310.00 NZD
Availability: InStock

Complexity & Succinctness

By:

Format:

Hardback

Series:

Progress in Theoretical Computer Science

Show Hide Adult Content

$310.00

Available from supplier

Usually ships in 3-4 weeks

0 in Trolley

Price Match

Wrap this item as a gift ($5.90) - add a free gift card on the next page

Free Delivery with Primate

Join Now

Free 14 day free trial, cancel anytime.

Buy Now, Pay Later with:

4 payments of $77.50 with Afterpay Learn more

6 weekly interest-free payments of $51.67 with Laybuy Learn more

Availability

Delivering to:

Estimated arrival:

Around 11-21 June using International Courier

Description

This text develops the theory of subrecursive programming systems and applies it to the more general theory of structural complexity theory. Its first goal is to establish relative program succinctness between systems, improving and subsuming most prior results in this area and introducing several forms of the phenomena. Its second goal is to illustrate the applicability of these tools in the context of structural complexity theory. This book is suitable for researchers aquainted with the theory of computation and comfortable with mathematical proofs. It can also be used by computer science and mathematics advanced undergraduates and graduates.

Release date NZ

August 1st, 1994

Author

Audiences

Postgraduate, Research & Scholarly
Professional & Vocational
Technical / Manuals
Undergraduate

Illustrations

VIII, 253 p.

Pages

253

Series

Progress in Theoretical Computer Science

Dimensions

156x234x15

ISBN-13

9780817637675

Product ID

2524703

Customer reviews

Nobody has reviewed this product yet. You could be the first!

Write a Review

Marketplace listings

There are no Marketplace listings available for this product currently.
Already own it? Create a free listing and pay just 9% commission when it sells!

Sell Yours Here