Library of American University of Madaba
Your cart is empty.
Recursion Theory and Computational Complexity
by Lolli, G.
Authors: SpringerLink (Online service) Series: C.I.M.E. Summer Schools ; . 79 Physical details: 236p. 6 illus. online resource. ISBN: 364211072X Subject(s): Mathematics. | Logic, Symbolic and mathematical. | Mathematics. | Mathematical Logic and Foundations.Online Resources:
Tags from this library:
No tags from this library for this title.
| Item type | Location | Call Number | Status | Date Due |
|---|---|---|---|---|
 E-Book |
AUM Main Library | 511.3 (Browse Shelf) | Not for loan |
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.
There are no comments for this item.