Subrecursive Programming Systems by John Case - Bookswagon
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Book 1
Book 2
Book 3
Home > Computing and Information Technology > Computer programming / software engineering > Subrecursive Programming Systems: Complexity and Succinctness(Progress in Theoretical Computer Science)
Subrecursive Programming Systems: Complexity and Succinctness(Progress in Theoretical Computer Science)

Subrecursive Programming Systems: Complexity and Succinctness(Progress in Theoretical Computer Science)


     0     
5
4
3
2
1



Out of Stock


Notify me when this book is in stock
X
About the Book

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.

Table of Contents:
What this book is about - subrecursive programming systems, relative succinctness trade-offs, the toolkit; outline of Part I - a subrecursion programming systems toolkit; outline of Part II - program succinctness; brief history of prior results; how to use this book; acknowledgments. Part 1 A subrecursion programming systems toolkit: basic notation and definitions - equation numbering, general notation and conventions, the standard pairing function, representing numbers, of lengths and logarithms, classes of sets and functions, programming systems and numberings, complexity measures, the arithmetic hierarchy, formal systems; deterministic multi-tape turing machines - details of the model - TM conventions, coding TMs, the standard acceptable programming system and complexity measures, the complexity of basic functions and operations, standard complexity classes; efficient universal simulation, costs of combining turing machines and efficiency of the combinations, TM normalisation; clocked TMs, combining TMs; slowed simulations; programming systems - closure properties and control structures, formalising the notion of a control structure, building control structures, clocked programming systems, formalizations, constructing clocked systems, inherited properties of clock systems, clocked systems for collections of sets, provably bounded programming systems, provably explicitly bounded systems, provably implicitly bounded systems, reducibility induced programming systems, induced systems and their properties, the generality of induced systems; the LOOP hierarchy; the poly-degree hierarchy; delayed enumeration and limiting recursion - uniform enumerations, limiting recursion, uniform limits; inseparability notions - productiveness and related notions, an-inseparability, en-inseparability; toolkit demonstrations: uniform density, a generalisation of uniform density, upper bounds on upward chains, minimal pairs, sufficient conditions for effective E2-inseparability. Part 2 Program succinctness: notions of succinctness - program size, relative succinctness - definitions, invariances and limitations, invariance with respect to program size measures, limits on succinctness, invariance under choice of programming systems, programming systems that represent classes of sets; limiting-recursive succinctness progressions - a technical prelude, the key theorem, a cornucopia of corollaries, a tight incompleteness theorem about complexity bounds, characterisations of limiting-recursive succinctness; succinctness for finite and infinite variant - the =m case, considerations for the =* and =x cases, the =* case, the =x case; succinctness for singleton sets - progressions for clocked systems, succinctness for programs with provable complexity; further problems. Appendices: exercises; solutions for selected exercises. Subject Index.


Best Sellers


Product Details
  • ISBN-13: 9783764337674
  • Publisher: Birkhauser Verlag AG
  • Publisher Imprint: Birkhauser Verlag AG
  • Height: 235 mm
  • Sub Title: Complexity and Succinctness
  • ISBN-10: 3764337672
  • Publisher Date: /09/1994
  • Binding: Hardback
  • Series Title: Progress in Theoretical Computer Science
  • Width: 155 mm


Similar Products

Add Photo
Add Photo

Customer Reviews

REVIEWS      0     
Click Here To Be The First to Review this Product
Subrecursive Programming Systems: Complexity and Succinctness(Progress in Theoretical Computer Science)
Birkhauser Verlag AG -
Subrecursive Programming Systems: Complexity and Succinctness(Progress in Theoretical Computer Science)
Writing guidlines
We want to publish your review, so please:
  • keep your review on the product. Review's that defame author's character will be rejected.
  • Keep your review focused on the product.
  • Avoid writing about customer service. contact us instead if you have issue requiring immediate attention.
  • Refrain from mentioning competitors or the specific price you paid for the product.
  • Do not include any personally identifiable information, such as full names.

Subrecursive Programming Systems: Complexity and Succinctness(Progress in Theoretical Computer Science)

Required fields are marked with *

Review Title*
Review
    Add Photo Add up to 6 photos
    Would you recommend this product to a friend?
    Tag this Book Read more
    Does your review contain spoilers?
    What type of reader best describes you?
    I agree to the terms & conditions
    You may receive emails regarding this submission. Any emails will include the ability to opt-out of future communications.

    CUSTOMER RATINGS AND REVIEWS AND QUESTIONS AND ANSWERS TERMS OF USE

    These Terms of Use govern your conduct associated with the Customer Ratings and Reviews and/or Questions and Answers service offered by Bookswagon (the "CRR Service").


    By submitting any content to Bookswagon, you guarantee that:
    • You are the sole author and owner of the intellectual property rights in the content;
    • All "moral rights" that you may have in such content have been voluntarily waived by you;
    • All content that you post is accurate;
    • You are at least 13 years old;
    • Use of the content you supply does not violate these Terms of Use and will not cause injury to any person or entity.
    You further agree that you may not submit any content:
    • That is known by you to be false, inaccurate or misleading;
    • That infringes any third party's copyright, patent, trademark, trade secret or other proprietary rights or rights of publicity or privacy;
    • That violates any law, statute, ordinance or regulation (including, but not limited to, those governing, consumer protection, unfair competition, anti-discrimination or false advertising);
    • That is, or may reasonably be considered to be, defamatory, libelous, hateful, racially or religiously biased or offensive, unlawfully threatening or unlawfully harassing to any individual, partnership or corporation;
    • For which you were compensated or granted any consideration by any unapproved third party;
    • That includes any information that references other websites, addresses, email addresses, contact information or phone numbers;
    • That contains any computer viruses, worms or other potentially damaging computer programs or files.
    You agree to indemnify and hold Bookswagon (and its officers, directors, agents, subsidiaries, joint ventures, employees and third-party service providers, including but not limited to Bazaarvoice, Inc.), harmless from all claims, demands, and damages (actual and consequential) of every kind and nature, known and unknown including reasonable attorneys' fees, arising out of a breach of your representations and warranties set forth above, or your violation of any law or the rights of a third party.


    For any content that you submit, you grant Bookswagon a perpetual, irrevocable, royalty-free, transferable right and license to use, copy, modify, delete in its entirety, adapt, publish, translate, create derivative works from and/or sell, transfer, and/or distribute such content and/or incorporate such content into any form, medium or technology throughout the world without compensation to you. Additionally,  Bookswagon may transfer or share any personal information that you submit with its third-party service providers, including but not limited to Bazaarvoice, Inc. in accordance with  Privacy Policy


    All content that you submit may be used at Bookswagon's sole discretion. Bookswagon reserves the right to change, condense, withhold publication, remove or delete any content on Bookswagon's website that Bookswagon deems, in its sole discretion, to violate the content guidelines or any other provision of these Terms of Use.  Bookswagon does not guarantee that you will have any recourse through Bookswagon to edit or delete any content you have submitted. Ratings and written comments are generally posted within two to four business days. However, Bookswagon reserves the right to remove or to refuse to post any submission to the extent authorized by law. You acknowledge that you, not Bookswagon, are responsible for the contents of your submission. None of the content that you submit shall be subject to any obligation of confidence on the part of Bookswagon, its agents, subsidiaries, affiliates, partners or third party service providers (including but not limited to Bazaarvoice, Inc.)and their respective directors, officers and employees.

    Accept

    Fresh on the Shelf


    Inspired by your browsing history


    Your review has been submitted!

    You've already reviewed this product!