Recursion Theory and Computational Complexity

Explore the intricate world of computational theory with "Recursion Theory and Computational Complexity" by G. Lolli, published by Springer-Verlag Berlin and Heidelberg GmbH & Co. KG in 2010. This comprehensive volume spans 236 pages and is a crucial resource for anyone interested in the intersections of mathematics and computer science.

Delve into the insights from esteemed contributors, including S. Homer discussing admissible recursion theory, and B.E. Jacobs examining computational complexity's ties to recursion. Additional chapters provide valuable surveys and discussions on set recursion, priority arguments, and recursively invariant concepts in recursion theory, ensuring a well-rounded understanding for readers.

This book serves as a reprint of the first edition from the C.I.M.E. series, making it an essential addition to the library of mathematicians, computer scientists, and students eager to deepen their understanding of symbolic and mathematical logic.