Recursion Theory and Computational Complexity

Recursion Theory and Computational Complexity
Author :
Publisher : Springer Science & Business Media
Total Pages : 228
Release :
ISBN-10 : 9783642110726
ISBN-13 : 364211072X
Rating : 4/5 (72X Downloads)

Book Synopsis Recursion Theory and Computational Complexity by : G. Lolli

Download or read book Recursion Theory and Computational Complexity written by G. Lolli and published by Springer Science & Business Media. This book was released on 2011-06-17 with total page 228 pages. Available in PDF, EPUB and Kindle. Book excerpt: 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.

Recursion Theory and Computational Complexity Related Books