*001922687
*00520250613175100.0
*007ta
*008130719s1958    xxu           000 u eng d
*00901030cam a2200325 c 4500
*019  $bl
*035  $a(EXLNZ-47BIBSYS_NETWORK)997540162774702201
*035  $a(NO-LaBS)14695689(bibid)
*035  $a(NO-TrBIB)754016277
*035  $a754016277-47bibsys_network
*040  $aNO-TrBIB$bnob$ekatreg
*080  $a510.5(07)
*080  $a510.57
*080  $a517.5
*084  $a02$2msc
*084  $a02F02$2msc
*084  $aF.1.1$2acmccs
*1001 $aDavis, Martin$d1928-2023$0(NO-TrBIB)90594044$_205790900
*24510$aComputability & unsolvability$cMartin Davis
*260  $aNew York$bMcGraw-Hill$c1958
*300  $aXXV, 210 s.$bfig.
*4901 $aMcGraw-Hill series in information processing and computers
*650 7$aBeregnbarhetsteori$0(NO-TrBIB)REAL000213$2noubomn$_205851000
*650 7$aFunksjonsteori$2tekord$_187192500
*650 7$aRekursive funksjoner$2tekord$_188700800
*653  $aberegnbarhet$aløsbarhet$_117350900
*7400 $aComputability and unsolvability
*830 0$aMcGraw-Hill series in information processing and computers$_15955300
*901  $a80
*999  $aoai:nb.bibsys.no:997540162774702202$b2021-11-14T20:59:59Z$z997540162774702202
^