Recursion Theory and Computational Complexity [electronic resource] / edited by G. Lolli.
By: Lolli, G [editor.].
Contributor(s): SpringerLink (Online service).
Material type:![materialTypeLabel](/opac-tmpl/lib/famfamfam/BK.png)
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.