Recursion Theory and Computational Complexity Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979 /

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 recursio...

Descripción completa

Detalles Bibliográficos
Clasificación:Libro Electrónico
Autor Corporativo: SpringerLink (Online service)
Otros Autores: Lolli, G. (Editor )
Formato: Electrónico eBook
Idioma:Inglés
Publicado: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2011.
Edición:1st ed. 2011.
Colección:C.I.M.E. Summer Schools ; 79
Temas:
Mathematical logic.
Mathematical Logic and Foundations.
Acceso en línea:Texto Completo

MARC

LEADER 00000nam a22000005i 4500
001 978-3-642-11072-6
003 DE-He213
005 20220119122416.0
007 cr nn 008mamaa
008 110616s2011 gw | s |||| 0|eng d
020 |a 9783642110726  |9 978-3-642-11072-6 
024 7 |a 10.1007/978-3-642-11072-6  |2 doi 
050 4 |a QA8.9-10.3 
072 7 |a PBCD  |2 bicssc 
072 7 |a PBC  |2 bicssc 
072 7 |a MAT018000  |2 bisacsh 
072 7 |a PBCD  |2 thema 
072 7 |a PBC  |2 thema 
082 0 4 |a 511.3  |2 23 
245 1 0 |a Recursion Theory and Computational Complexity  |h [electronic resource] :  |b Lectures given at a Summer School of the Centro Internazionale Matematico Estivo (C.I.M.E.) held in Bressanone (Bolzano), Italy, June 14-23, 1979 /  |c edited by G. Lolli. 
250 |a 1st ed. 2011. 
264 1 |a Berlin, Heidelberg :  |b Springer Berlin Heidelberg :  |b Imprint: Springer,  |c 2011. 
300 |a 236 p. 6 illus.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a C.I.M.E. Summer Schools ;  |v 79 
505 0 |a 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. 
520 |a 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. 
650 0 |a Mathematical logic. 
650 1 4 |a Mathematical Logic and Foundations. 
700 1 |a Lolli, G.  |e editor.  |4 edt  |4 http://id.loc.gov/vocabulary/relators/edt 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer Nature eBook 
776 0 8 |i Printed edition:  |z 9783642110757 
776 0 8 |i Printed edition:  |z 9783642110719 
830 0 |a C.I.M.E. Summer Schools ;  |v 79 
856 4 0 |u https://doi.uam.elogim.com/10.1007/978-3-642-11072-6  |z Texto Completo 
912 |a ZDB-2-SMA 
912 |a ZDB-2-SXMS 
950 |a Mathematics and Statistics (SpringerNature-11649) 
950 |a Mathematics and Statistics (R0) (SpringerNature-43713) 

Ejemplares similares