Subrecursive Programming Systems: Complexity & Succinctness - James S. Royer,John Case
-25% koodilla BOOKS
Toimitus 17-23 arkipäivässä
30 päivän palautusoikeus
1.1. What This Book is About This book is a study of ¿ subrecursive programming systems, ¿ efficiency/program-size trade-offs between such systems, and ¿ how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest ... Täydellinen kuvaus
Saatat myös pitää
TOP
Gödel, Escher, Bach: An Eternal Golden Braid
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Empire of AI: Dreams and Nightmares in Sam Altmans OpenAI
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
AI Engineering: Building Applications with Foundation Models
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Pragmatic Programmer: journey to mastery, 20th Anniversary Edition, 2/e: your journey to mastery, 20th Anniversary Edition
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Rust Programming Language
Steve Klabnik, Carol Nichols, Chris Krycho
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How Linux Works: What Every Superuser Should Know
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Python Crash Course: A Hands-On, Project-Based Introduction to Programming
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
How To Think About AI: A Guide For The Perplexed
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
The Art of Game Design: A Book of Lenses
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Artificial Intelligence: A Modern Approach, Global Edition
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
CompTIA Security+ Certification Kit: Exam SY0-701
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Automate the Boring Stuff with Python
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Fundamentals of Software Architecture: A Modern Engineering Approach
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Speak Data: Artists, Scientists, Thinkers, and Dreamers on How We Live Our Lives in Numbers
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Hacking: The Art of Exploitation
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Hackers. 25th Anniversary Edition: Heroes of the Computer Revolution
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Deep Learning
Ian Goodfellow, Yoshua Bengio, Aaron Courville
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Proofs from THE BOOK
Martin Aigner, Günter M. Ziegler
-25% koodilla BOOKS
Toimittajalla varastossa
TOP
Mathematics for Machine Learning
Cheng Soon Ong, A. Aldo Faisal, Marc Peter Deisenroth
-25% koodilla BOOKS
Toimittajalla varastossa
Kuvaus
1.1. What This Book is About This book is a study of ¿ subrecursive programming systems, ¿ efficiency/program-size trade-offs between such systems, and ¿ how these systems can serve as tools in complexity theory. Section 1.1 states our basic themes, and Sections 1.2 and 1.3 give a general outline of the book. Our first task is to explain what subrecursive programming systems are and why they are of interest. 1.1.1. Subrecursive Programming Systems A subrecursive programming system is, roughly, a programming language for which the result of running any given program on any given input can be completely determined algorithmically. Typical examples are: 1. the Meyer-Ritchie LOOP language [MR67,DW83], a restricted assem bly language with bounded loops as the only allowed deviation from straight-line programming; 2. multi-tape 'lUring Machines each explicitly clocked to halt within a time bound given by some polynomial in the length ofthe input (see [BH79,HB79]); 3. the set of seemingly unrestricted programs for which one can prove 1 termination on all inputs (see [Kre51,Kre58,Ros84]); and 4. finite state and pushdown automata from formal language theory (see [HU79]). lOr, more precisely, the collection of programs, p, ofsome particular general-purpose programming language (e.g., Lisp or Modula-2) for which there is a proof in some par ticular formal system (e.g., Peano Arithmetic) that p halts on all inputs.
Lisätietoja
| Kirjoittaja | James S. Royer, John Case |
|---|---|
| Julkaisija | Birkhäuser Boston |
| Series | Progress in Theoretical Computer Science |
| Julkaisuvuosi | 1994 |
| Kannen tyyppi | Kovakantinen |
| EAN | 9780817637675 |