Recursion Theory and Computational Complexity [electronic resource] / edited by G. Lolli.
By: Lolli, G [editor.].
Contributor(s): SpringerLink (Online service).
Material type:
BookSeries: C.I.M.E. Summer Schools: 79Publisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: 236p. 6 illus. online resource.Content type: text Media type: computer Carrier type: online resourceISBN: 9783642110726.Subject(s): Mathematics | Logic, Symbolic and mathematical | Mathematics | Mathematical Logic and FoundationsDDC classification: 511.3 Online resources: Click here to access online 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.