| Record ID | marc_columbia/Columbia-extract-20221130-021.mrc:31515715:1249 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-021.mrc:31515715:1249?format=raw |
LEADER: 01249cam a2200313 a 4500
001 10122111
005 20130219173825.0
008 111120s2013 maua b 001 0 eng c
020 $a9781133187790
020 $a113318779X
035 $a(OCoLC)ocn761858892
035 $a(NNC)10122111
040 $aBTCTA$cPUL$dBTCTA$dYDXCP$dMYG$dBWX
042 $apcc
050 4 $aQA267$b.S56 2013
100 1 $aSipser, Michael.
245 10 $aIntroduction to the theory of computation /$cMichael Sipser.
250 $a3rd ed.
260 $aBoston, MA :$bCengage Learning,$cc2013.
300 $axxii, 458 p. :$bill. ;$c24 cm.
504 $aIncludes bibliographical references (p. 443-447) and index.
505 00 $g1.$tRegular languages --$g2.$tContext-free languages --$g3.$tThe Church-Turing thesis --$g4.$tDecidability --$g5.$tReducibility --$g6.$tAdvanced topics in computability theory --$g7.$tTime complexity --$g8.$tSpace complexity --$g9.$tInteractibility --$g10.$tAdvanced topics in complexity theory.
650 0 $aMachine theory.
650 0 $aComputational complexity.
852 00 $bsci$hQA267$i.S56 2013
852 00 $bsci$hQA267$i.S56 2013
852 00 $bsci$hQA267$i.S56 2013
852 00 $bsci$hQA267$i.S56 2013
852 00 $bmil,fli$hQA267$i.S56 2013