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.
Subrecursive Programming Systems: Complexity & Succinctness
and over one million other books are available for Amazon Kindle.
Learn more
FREE Two-Day Shipping for students on millions of items. Learn more |
| ||||||||||||||||||
Book Description
Special Offers and Product Promotions
- Buy $50 in qualifying physical textbooks, get $5 in Amazon MP3 Credit. Here's how (restrictions apply)
Product Details
Would you like to update product info or give feedback on images?
|
More About the Author
Discover books, learn about writers, read author blogs, and more.
Customer Reviews
|
There are no customer reviews yet.
|
|||
|
Video reviews
|
Inside This Book
(learn more)
First Sentence:
Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Turing Machines, Peano Arithmetic, Costs of Combining, Generalization of Uniform Density, Program Succinctness, Technical Prelude, Craig's Theorem, The Ltime-effective, Tight Incompleteness Theorem, Uniform Enumerations, Uniform Limits New!
Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Read the first page Key Phrases - Capitalized Phrases (CAPs): (learn more)
Turing Machines, Peano Arithmetic, Costs of Combining, Generalization of Uniform Density, Program Succinctness, Technical Prelude, Craig's Theorem, The Ltime-effective, Tight Incompleteness Theorem, Uniform Enumerations, Uniform Limits New!
Concordance | Text Stats Browse Sample Pages:
Front Cover | Table of Contents | First Pages | Index | Back Cover | Surprise Me!
Citations (learn more)
This book cites 11
books:
See all 11 books this book cites
- Theoretical Computer Science: Essays in Memory of Shimon Even (Lecture Notes in Computer Science / Theoretical Computer Science and General Issues) by Oded Goldreich in Back Matter (1), and Back Matter (2)
- Categorical Combinators, Sequential Algorithms and Functional Programming (Research notes in theoretical computer science) by P.L. Currien in Back Matter
- Nondeterminism in Algebraic Specifications and Algebraic Programs (Progress in Theoretical Computer Science) by Hussmann in Back Matter
- Logic of Domains (Progress in Theoretical Computer Science) by G. Zhang in Back Matter
- Finite Automata, Formal Logic, and Circuit Complexity (Progress in Theoretical Computer Science) by Howard Straubing in Back Matter
See all 11 books this book cites
Tag this product(What's this?)Think of a tag as a keyword or label you consider is strongly related to this product.
Tags will help all customers organize and find favorite items. |
Customer Discussions
|
This product's forum
Active discussions in related forums
Search Customer Discussions
|
Related forums
|
Listmania!
So You'd Like to...
Look for Similar Items by Category
- Books > Computers & Technology > Programming > Software Design, Testing & Engineering > Software Development
- Books > Computers & Technology > Software
- Books > New & Used Textbooks > Computer Science > Programming Languages
- Books > New & Used Textbooks > Computer Science > Software Design & Engineering
- Books > Science & Math > Mathematics
