000 04029nam a22003855i 4500
001 277900
003 MX-SnUAN
005 20160429153839.0
007 cr nn 008mamaa
008 150903s2008 xxu| o |||| 0|eng d
020 _a9780387498201
_99780387498201
024 7 _a10.1007/9780387498201
_2doi
035 _avtls000331782
039 9 _a201509030214
_bVLOAD
_c201404121926
_dVLOAD
_c201404091653
_dVLOAD
_y201402041012
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
050 4 _aQA268
100 1 _aLi, Ming.
_eautor
_9226989
245 1 3 _aAn Introduction to Kolmogorov Complexity and Its Applications /
_cby Ming Li, Paul Vitányi.
264 1 _aNew York, NY :
_bSpringer New York,
_c2008.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aTexts in Computer Science,
_x1868-0941
500 _aSpringer eBooks
505 0 _aPreliminaries -- Algorithmic Complexity -- Algorithmic Prefix Complexity -- Algorithmic Probability -- Inductive Reasoning -- The Incompressibility Method -- Resource-Bounded Complexity -- Physics, Information, and Computation.
520 _aThis ongoing bestseller, now in its third edition, is considered the standard reference on Kolmogorov complexity, a modern theory of information that is concerned with information in individual objects. New key features and topics in the 3rd edition: * New results on randomness * Kolmogorov's structure function, model selection, and MDL * Incompressibility method: counting unlabeled graphs, Shellsort, communication complexity * Derandomization * Kolmogorov complexity versus Shannon information, rate distortion, lossy compression, denoising * Theoretical results on information distance * The similarity metric with applications to genomics, phylogeny, clustering, classification, semantic meaning, question-answer systems *Quantum Kolmogorov complexity Written by two experts in the field, this book is ideal for advanced undergraduate students, graduate students, and researchers in all fields of science. It is self-contained: it contains the basic requirements from mathematics, probability theory, statistics, information theory, and computer science. Included are history, theory, new developments, a wide range of applications, numerous (new) problem sets, comments, source references, and hints to solutions of problems. This is the only comprehensive treatment of the central ideas of Kolmogorov complexity and their applications. ``Li and Vitányi have provided an ideal book for the exploration of a deep, beautiful and important part of computer science.'' -- Juris Hartmanis, Turing Award Winner 1993, Cornell University, Ithaca, NY. ``The book is likely to remain the standard treatment of Kolmogorov complexity for a long time.'' -- Jorma J. Rissanen, IBM Research, California. ``The book of Li and Vitányi is unexcelled.'' -- Ray J. Solomonoff, Oxbridge Research, Cambridge, Massachusetts "The book is outstanding...the authors did their job unbelievably well...necessary reading for all kinds of readers from undergraduate students to top authorities in the field." -- Vladimir A. Uspensky and Alexander K. Shen, Journal of Symbolic Logic [Review] ``Careful and clear introduction to a subtle and deep field.'' --David G. Stork, Ricoh Innovations, California, Amazon [Review] ``THE book on Kolmogorov Complexity.'' --Lance Fortnow, University of Chicago, IL, Amazon [Review]
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
700 1 _aVitányi, Paul.
_eautor
_9301079
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387339986
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-49820-1
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c277900
_d277900