Publisher's Synopsis
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.
