| Record ID | marc_columbia/Columbia-extract-20221130-031.mrc:277842604:3316 |
| Source | marc_columbia |
| Download Link | /show-records/marc_columbia/Columbia-extract-20221130-031.mrc:277842604:3316?format=raw |
LEADER: 03316cam a2200661 i 4500
001 15139185
005 20220403001056.0
006 m o d
007 cr cnu|||unuuu
008 190509s2019 flu ob 000 0 eng d
035 $a(OCoLC)on1100588371
035 $a(NNC)15139185
040 $aN$T$beng$erda$epn$cN$T$dN$T$dEBLCP$dYDX$dTYFRS$dUKMGB$dOCLCF$dOCLCQ$dK6U$dOCLCO$dOCLCQ$dOCLCO
015 $aGBB995206$2bnb
016 7 $a019400705$2Uk
019 $a1100600381
020 $a9780429187490$q(electronic bk.)
020 $a0429187491$q(electronic bk.)
020 $a9780429529955$q(electronic bk. ;$qEPUB)
020 $a0429529953$q(electronic bk. ;$qEPUB)
020 $a9781482269758$q(electronic bk. ;$qPDF)
020 $a1482269759$q(electronic bk. ;$qPDF)
020 $a9780429544651$q(electronic bk. ;$qMobipocket)
020 $a0429544650$q(electronic bk. ;$qMobipocket)
020 $z9780824700263
024 7 $a10.1201/9780429187490$2doi
035 $a(OCoLC)1100588371$z(OCoLC)1100600381
037 $a9780429187490$bTaylor & Francis
050 4 $aQA267.7$b.C664 2019eb
072 7 $aMAT$x000000$2bisacsh
072 7 $aMAT$x003000$2bisacsh
072 7 $aPBW$2bicssc
082 04 $a511.3$223
049 $aZCUA
245 00 $aComplexity, logic, and recursion theory /$cedited by Andrea Sorbi.
264 1 $aBacon Raton :$bCRC Press,$c2019.
300 $a1 online resource
336 $atext$btxt$2rdacontent
337 $acomputer$bc$2rdamedia
338 $aonline resource$bcr$2rdacarrier
490 1 $aLecture notes in pure and applied mathematics ;$v187
504 $aIncludes bibliographical references.
588 $aOnline resource; title from PDF title page (EBSCO, viewed May 10, 2019).
505 0 $aCover; Half Title; Title Page; Copyright Page; Preface; Table of Contents; Contributors; Resource-Bounded Measure and Randomness; Degree Structures in Local Degree Theory; Compressibility of Infinite Binary Sequences; Beyond Gödel's Theorem: The Failure to Capture Information Content; Progressions of Theories of Bounded Arithmetic; On Presentations of Algebraic Structures; Witness-Isomorphic Reductions and Local Search; A Survey of Inductive Inference with an Emphasis on Queries; A Uniformity of Degree Structures; Short Course on Logic, Algebra, and Topology
520 $a"Integrates two classical approaches to computability. Offers detailed coverage of recent research at the interface of logic, computability theory, nd theoretical computer science. Presents new, never-before-published results and provides informtion not easily accessible in the literature."
650 0 $aComputational complexity.
650 0 $aRecursion theory.
650 6 $aComplexité de calcul (Informatique)
650 6 $aThéorie de la récursivité.
650 7 $aMATHEMATICS$xGeneral.$2bisacsh
650 7 $aMATHEMATICS$xApplied.$2bisacsh
650 7 $aComputational complexity.$2fast$0(OCoLC)fst00871991
650 7 $aRecursion theory.$2fast$0(OCoLC)fst01091982
655 4 $aElectronic books.
700 1 $aSorbi, Andrea,$d1956-$eeditor.
830 0 $aLecture notes in pure and applied mathematics ;$vv. 187.
856 40 $uhttp://www.columbia.edu/cgi-bin/cul/resolve?clio15139185$zTaylor & Francis eBooks
852 8 $blweb$hEBOOKS