| Record ID | marc_columbia/Columbia-extract-20221130-003.mrc:210188060:1395 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-003.mrc:210188060:1395?format=raw |
LEADER: 01395cam a2200337 4500
001 1186980
005 20220601225454.0
008 840604s1965 nyu b 000 0 eng c
010 $a 65003996
035 $a(OCoLC)ocm00232930
035 $9AGQ9574CU
035 $a(NNC)1186980
035 $a1186980
040 $aDLC/ICU$cCGU$dm.c.$dZCU
050 00 $aQA248.5$b.D33
082 0 $a512.8
100 1 $aDavis, Martin,$d1928-$eeditor.$4http://id.loc.gov/vocabulary/relators/edt$0http://id.loc.gov/authorities/names/n50035603
245 14 $aThe undecidable ;$bbasic papers on undecidable propositions, unsolvable problems and computable functions.
260 $aHewlett, N.Y. :$bRaven Press,$c[1965]
300 $a440 pages ;$c25 cm
336 $atext$2rdacontent
337 $aunmediated$2rdamedia
338 $avolume$2rdacarrier
504 $aIncludes bibliographical references.
650 0 $aRecursive functions.$0http://id.loc.gov/authorities/subjects/sh85112014
650 0 $aGödel's theorem.$0http://id.loc.gov/authorities/subjects/sh85055601
650 0 $aTuring machines.$0http://id.loc.gov/authorities/subjects/sh85138778
650 0 $aUnsolvability (Mathematical logic)$0http://id.loc.gov/authorities/subjects/sh85141199
650 0 $aComputable functions.$0http://id.loc.gov/authorities/subjects/sh85029469
852 00 $boff,glx$hQA248.5$i.D293
852 00 $bmat$hQA248.5$i.D293