× Recursion Theory and Computational Complexity Close
Recursion Theory and Computational Complexity by G. Lolli
English | PDF | 2011 | 228 Pages | ISBN : 3642110711 | 13.44 MB
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.Without You And Your Support We Can’t Continue
Thanks For Buying Premium From My Links For Support

Download File Size:12.59 MB

---