Springer Recursion Theory and Computational Complexity (English, Special Edition, G. Lolli)

About the Book

S. Homer: Admissible recursion theory.- B.E. Jacobs: Computational complexity and recursion theory.- D. Normann: A survey of set recursion.- G.E. Sacks: Priority arguments in Higgler recursion.- R.I. Soare: Construction in the recursively enumerable degrees.- W. Maass: Recursively invariant recursion theory.

Why You Should Read This Book

• Written by acclaimed author G. Lolli
• Published by Springer, a respected name in academic and professional publishing
• Covers the domain of Logic with depth and clarity
• Available in English — ideal for students, researchers, and professionals alike
• A trusted reference work that belongs on every serious reader's shelf

Product Details

This Special Edition of Recursion Theory and Computational Complexity is published by Springer and carries ISBN-13 9783642110719. Packaged securely for delivery across India, this edition is ideal for personal libraries, classroom use, and professional reference.

Who Is This Book For?

Whether you are a student preparing for advanced coursework, a researcher deepening your expertise, or a professional staying current with the field, Recursion Theory and Computational Complexity by G. Lolli is an excellent choice. Order your copy today from BookBajar and enjoy free shipping with Cash on Delivery available across India.