Join thousands of book lovers
Sign up to our newsletter and receive discounts and inspiration for your next reading experience.
By signing up, you agree to our Privacy Policy.You can, at any time, unsubscribe from our newsletters.
Abstract Recursion and Intrinsic Complexity
part of the Lecture Notes in Logic series
- Binding:
- Hardback
- Pages:
- 250
- Published:
- December 5, 2018
- Dimensions:
- 157x235x18 mm.
- Weight:
- 470 g.
Delivery:
2-4 weeks
Expected delivery: December 20, 2024
Extended return policy to January 30, 2025
About Yiannis N. (University of California Moschovakis
View all books by Yiannis N. (University of California MoschovakisDescription of Abstract Recursion and Intrinsic Complexity
The author presents and applies a new framework for studying the complexity of algorithms. The book is aimed at logicians, computer scientists, mathematicians and philosophers who are interested in the theory of computation and its foundations. It includes an accessible introduction to abstract recursion theory and contains over 250 problems.
User ratings of Abstract Recursion and Intrinsic Complexity
Rate this book
In order to rate this book you must be logged in.Others also bought..
Find similar books
The book Abstract Recursion and Intrinsic Complexity can be found in the following categories:
You can, at any time, unsubscribe from our newsletters.
© 2024 Tales
All packages are shipped from our warehouse in the UK.
Company address: Esromgade 15, 3. - 2200 - DK
Registered company number: DK43351621
