Library of American University of Madaba

Normal View MARC View ISBD View

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 .

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.

ISBN: 9783642110726

Subjects--Topical Terms:
Mathematics.
Logic, Symbolic and mathematical.
Mathematics.
Mathematical Logic and Foundations.

LC Class. No.: QA8.9-10.3

Dewey Class. No.: 511.3