| Record ID | marc_nuls/NULS_PHC_180925.mrc:125120372:1750 |
| Source | marc_nuls |
| Download Link | /show-records/marc_nuls/NULS_PHC_180925.mrc:125120372:1750?format=raw |
LEADER: 01750cam 2200337 a 4500
001 9921835040001661
005 20150423141110.0
008 930630s1994 caua b 001 0 eng
010 $a 93026807
020 $a0122063821 (acid-free paper)
035 $a(CSdNU)u42652-01national_inst
035 $a(OCoLC)28506245
035 $a(Sirsi) 01-AAE-5798
040 $aDLC$cDLC
049 $aCNUM
050 00 $aQA267$b.D38 1994
100 1 $aDavis, Martin,$d1928-
245 10 $aComputability, complexity, and languages :$bfundamentals of theoretical computer science /$cMartin D. Davis, Ron Sigal, Elaine J. Weyuker.
250 $a2nd. ed.
260 $aBoston :$bAcademic Press, Harcourt, Brace,$c1994.
300 $axix, 609 p. :$bill. ;$c24 cm.
440 0 $aComputer science and scientific computing
504 $aIncludes bibliographical references (p. 593-594) and index.
505 0 $aPrograms and computable functions -- Primitive recursive functions -- A universal program -- Calculation on strings -- Turing machines -- Processes and grammars -- Classifying unsolvable problems -- Regular languages -- Context-free languages -- Context-sensitive languages -- Propositional calculus -- Quantification theory -- Abstract complexity -- Polynomial-time computability -- Approximation orderings -- Denotational semantics of recursion equations -- Operational semantics of recusion equations.
650 0 $aMachine theory.
650 0 $aComputational complexity.
650 0 $aFormal languages.
700 1 $aSigal, Ron.
700 1 $aWeyuker, Elaine J.
948 $a10/13/1999$b10/13/1999
999 $aQA 267 D38 1994$wLC$c1$i31786100566386$d3/16/2010$f6/16/2004$g1 $lCIRCSTACKS$mNULS$n1$q2$rY$sY$tBOOK$u11/22/1994$o.STAFF. Pieces: 00001