Custom cover image
Custom cover image

Recursion Theory and Computational Complexity / edited by G. Lolli

By: Resource type: Ressourcentyp: Buch (Online)Book (Online)Language: English Series: C.I.M.E. Summer Schools ; 79 | SpringerLink BücherPublisher: Berlin, Heidelberg : Springer Berlin Heidelberg, 2011Description: Online-Ressource (236p. 6 illus, digital)ISBN:
  • 9783642110726
Subject(s): Genre/Form: Additional physical formats: 9783642110719 | Buchausg. u.d.T.: Recursion Theory and Computational Complexity. Reprint of the 1. ed. C.I.M.E., Ed. Liguori, Napoli & Birkhäuser, 1981. Berlin : Springer, 2010. 236 S.MSC: MSC: *03-06 | 03D15 | 03D80 | 00B25LOC classification:
  • QA8.9-10.3
DOI: DOI: 10.1007/978-3-642-11072-6Online resources: Summary: 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.Summary: 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.PPN: PPN: 1650971524Package identifier: Produktsigel: ZDB-2-SEB | ZDB-2-SMA | ZDB-2-SXMS
No physical items for this record
KIT – The University in the Helmholtz Association                         Home | Impressum | Datenschutz | Barrierefreiheit | KIT