Synopsis
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 known results in structural complexity theory and are then applied to establish major new theorems regarding program-succinctness trade-offs.
"synopsis" may belong to another edition of this title.
