000299932 000__ 01320cam\a2200325Ia\45\0
000299932 001__ 299932
000299932 005__ 20210513111638.0
000299932 008__ 050823s2004\\\\enk\\\\\\b\\\\000\0\eng\\
000299932 010__ $$a  2005279337
000299932 020__ $$a0521616042 (pbk.)
000299932 035__ $$a(OCoLC)ocm61326001
000299932 035__ $$a299932
000299932 040__ $$aNPS$$cNPS$$dDLC$$dBAKER$$dISE
000299932 049__ $$aISEA
000299932 05000 $$aQA267$$b.C48 2004
000299932 08200 $$a006.3/1$$222
000299932 1001_ $$aChaitin, Gregory J.
000299932 24510 $$aAlgorithmic information theory /$$cGregory J. Chaitin.
000299932 250__ $$aPbk. ed.
000299932 260__ $$aCambridge [Cambridgeshire] ;$$aNew York :$$bCambridge University Press,$$c2004.
000299932 300__ $$ax, 178 p. ;$$c25 cm.
000299932 440_0 $$aCambridge tracts in theoretical computer science ;$$v1
000299932 504__ $$aIncludes bibliographical references (p. [176]-178).
000299932 50500 $$tFormalisms for computation --$$tThe arithmetic of register machines --$$tA version of pure LISP --$$tThe LISP interpreter EVAL --$$tConceptual development --$$tProgram size --$$tRandomness --$$tIncompleteness.
000299932 650_0 $$aMachine theory.
000299932 650_0 $$aComputational complexity.
000299932 650_0 $$aLISP (Computer program language)
000299932 85200 $$bgen$$hQA267$$i.C48$$i2004
000299932 85641 $$3Table of contents$$uhttp://www.loc.gov/catdir/toc/cam031/87015876.html
000299932 85642 $$3Publisher description$$uhttp://www.loc.gov/catdir/description/cam023/87015876.html
000299932 909CO $$ooai:library.usi.edu:299932$$pGLOBAL_SET
000299932 980__ $$aBIB
000299932 980__ $$aBOOK
000299932 994__ $$aC0$$bISE