| Record ID | ia:superrecursiveal0000burg |
| Source | Internet Archive |
| Download MARC XML | https://archive.org/download/superrecursiveal0000burg/superrecursiveal0000burg_marc.xml |
| Download MARC binary | https://www.archive.org/download/superrecursiveal0000burg/superrecursiveal0000burg_meta.mrc |
LEADER: 01056cam a22002774a 4500
001 2004041748
003 DLC
005 20080308091758.0
008 040121s2005 nyua b 001 0 eng
010 $a 2004041748
020 $a0387955690 (acid-free paper)
040 $aDLC$cDLC$dDLC
042 $apcc
050 00 $aQA9.615$b.B87 2005
082 00 $a511.3/52$222
100 1 $aBurgin, M. S.$q(Mark Semenovich)
245 10 $aSuper-recursive algorithms /$cMark Burgin.
260 $aNew York, NY :$bSpringer,$cc2005.
300 $axii, 304 p. :$bill. ;$c24 cm.
440 0 $aMonographs in computer science
504 $aIncludes bibliographical references (p. [263]-294) and index.
650 0 $aRecursive functions.
650 0 $aAlgorithms.
856 42 $3Publisher description$uhttp://www.loc.gov/catdir/enhancements/fy0662/2004041748-d.html
856 42 $3Contributor biographical information$uhttp://www.loc.gov/catdir/enhancements/fy0817/2004041748-b.html
856 41 $3Table of contents only$uhttp://www.loc.gov/catdir/enhancements/fy0817/2004041748-t.html