Skip to main content
PBS logo
 
 

Search - Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)

Subrecursive Programming Systems: Complexity & Succinctness (Progress in Theoretical Computer Science)
Subrecursive Programming Systems Complexity Succinctness - Progress in Theoretical Computer Science
Author: James S. Royer, John Case
Subrecursive programming systems are pervasive throughout both theoretical and practical computer science. This monograph systematically and rigorously develops the theory of subrecursive programming systems and the powerful tools and techniques these systems support. The tools are first applied to provide elegant, insightful, new proofs of know...  more »
ISBN-13: 9780817637675
ISBN-10: 0817637672
Publication Date: 8/1/1994
Pages: 264
Edition: 1
Rating:
  ?
0 stars, based on 0 rating
Publisher: Birkhäuser Boston
Book Type: Hardcover
Members Wishing: 0
Reviews: Amazon | Write a Review


Genres:


Back to the Top ↑
By using this Web site, you confirm that you have read, understood, and agreed to be bound by the Terms of Use. As an Amazon Associate we earn from qualifying purchases.
US Patent Number 7,877,315 | Copyright © 2004 - 2024 PaperBackSwap.com. All Rights Reserved.