000295456 000__ 00911cam\a22003134a\45\0
000295456 001__ 295456
000295456 005__ 20210513111036.0
000295456 008__ 040121s2005\\\\nyua\\\\\b\\\\001\0\eng\\
000295456 010__ $$a  2004041748
000295456 015__ $$aGBA4-Z9668
000295456 020__ $$a0387955690 (alk. paper)
000295456 0291_ $$aUKM$$bbA4Z9668
000295456 035__ $$a(OCoLC)ocm53871347
000295456 035__ $$a295456
000295456 040__ $$aDLC$$cDLC$$dYDX$$dUKM$$dOHX$$dBAKER$$dISE
000295456 042__ $$apcc
000295456 049__ $$aISEA
000295456 05000 $$aQA9.615$$b.B87 2005
000295456 072_7 $$aQA$$2lcco
000295456 08200 $$a511.3/52$$222
000295456 1001_ $$aBurgin, M. S.$$q(Mark Semenovich)
000295456 24510 $$aSuper-recursive algorithms /$$cMark Burgin.
000295456 260__ $$aNew York, NY :$$bSpringer,$$cc2005.
000295456 300__ $$axii, 304 p. :$$bill. ;$$c24 cm.
000295456 440_0 $$aMonographs in computer science
000295456 504__ $$aIncludes bibliographical references (p. [263]-294) and index.
000295456 650_0 $$aRecursive functions.
000295456 650_0 $$aAlgorithms.
000295456 85200 $$bgen$$hQA9.615$$i.B87$$i2005
000295456 909CO $$ooai:library.usi.edu:295456$$pGLOBAL_SET
000295456 980__ $$aBIB
000295456 980__ $$aBOOK
000295456 994__ $$aC0$$bISE