Lolli, G.

Recursion Theory and Computational Complexity [electronic resource] / edited by G. Lolli. - 236p. 6 illus. online resource. - C.I.M.E. Summer Schools ; 79 . - C.I.M.E. Summer Schools ; 79 .

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.

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.

9783642110726

10.1007/978-3-642-11072-6 doi


Mathematics.
Logic, Symbolic and mathematical.
Mathematics.
Mathematical Logic and Foundations.

QA8.9-10.3

511.3

2017 | The Technical University of Kenya Library | +254(020) 2219929, 3341639, 3343672 | library@tukenya.ac.ke | Haile Selassie Avenue