LEADER 01727nam0 22004453i 450 001 VAN00298858 005 20250926100624.530 017 70$2N$a9781461206354 100 $a20250926d1999 |0itac50 ba 101 $aeng 102 $aUS 105 $a|||| ||||| 181 $ai$b e 182 $ab 183 $acr 200 1 $aBounded Queries in Recursion Theory$fWilliam I. Gasarch, Georgia A. Martin 210 $aNew York$cSpringer ; Boston$cBirkhäuser$d1999 215 $axiii, 353 p.$d24 cm 410 1$1001VAN00052679$12001 $aProgress in computer science and applied logic$1210 $aBasel [etc.]$cBirkhäuser$v16 610 $aAlgorithms$9KW:K 610 $aComplexity$9KW:K 610 $aComputability theory$9KW:K 610 $aComputer Science$9KW:K 610 $aComputers$9KW:K 610 $aNotation$9KW:K 610 $aSimulation$9KW:K 620 $aUS$dNew York$3VANL000011 620 $dBoston$3VANL000051 700 1$aGasarch$bWilliam I.$3VANV254017$01849806 701 1$aMartin$bGeorgia A.$3VANV041736$01849802 712 $aBirkhäuser $3VANV108193$4650 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20251107$gRICA 856 4 $uhttps://doi.org/10.1007/978-1-4612-0635-4$zE-book ? Accesso al full-text attraverso riconoscimento IP di Ateneo, proxy e/o Shibboleth 899 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$1IT-CE0120$2VAN08 912 $fN 912 $aVAN00298858 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08DLOAD e-Book 12935 $e08eMF12935 20251104 996 $aBounded Queries in Recursion Theory$94442269 997 $aUNICAMPANIA