LEADER 00905nam0-22003251i-450- 001 990002890850403321 010 $a0-534-94332-2 035 $a000289085 035 $aFED01000289085 035 $a(Aleph)000289085FED01 035 $a000289085 100 $a20000920d1995----km-y0itay50------ba 101 0 $aENG 200 1 $aNeural network design$fMartin T. Hagan, Howard B. Demuth, Mark Beale 210 $aBoston$cPWS Kent$d1995 215 $apag. varia.$d24 cm$efloppy disk 610 0 $aInformatica applicata alla statistica 610 0 $aReti neurali 676 $a006.3 700 1$aHagan,$bMartin T.$0117524 702 1$aBeale,$bMark 702 1$aDemuth,$bHoward B. 801 0$aIT$bUNINA$gRICA$2UNIMARC 901 $aBK 912 $a990002890850403321 952 $aVII-C-84$b6197$fMAS 959 $aMAS 996 $aNeural network design$9466989 997 $aUNINA DB $aING01 LEADER 01707nam0 22004093i 450 001 VAN0260332 005 20230925084620.377 017 70$2N$a9783540374251 100 $a20230628d1977 |0itac50 ba 101 $aeng 102 $aDE 105 $a|||| ||||| 200 1 $aComputations in Higher Types$fJohan Moldestad 210 $aBerlin$cSpringer$d1977 215 $aviii, 208 p.$d24 cm 461 1$1001VAN0102250$12001 $aLecture notes in mathematics$1210 $aBerlin [etc.]$cSpringer$v574 606 $a03-XX$xMathematical logic and foundations [MSC 2020]$3VANC019750$2MF 606 $a03D60$xComputability and recursion theory on ordinals, admissible sets, etc. [MSC 2020]$3VANC037481$2MF 606 $a03D65$xHigher-type and set recursion theory [MSC 2020]$3VANC037574$2MF 610 $aCalculation$9KW:K 610 $aComputability theory$9KW:K 610 $aComputation$9KW:K 610 $aObjects$9KW:K 610 $aRecursion$9KW:K 610 $aRecursive functions$9KW:K 610 $aTypes$9KW:K 620 $dBerlin$3VANL000066 700 1$aMoldestad$bJohan$3VANV214500$048583 712 $aSpringer $3VANV108073$4650 801 $aIT$bSOL$c20240614$gRICA 856 4 $uhttps://doi.org/10.1007/BFb0087822$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 $aVAN0260332 950 $aBIBLIOTECA DEL DIPARTIMENTO DI MATEMATICA E FISICA$d08CONS e-book 6022 $e08eMF6022 20230628 996 $aComputations in higher types$980729 997 $aUNICAMPANIA