000			04251nam a22005175i 4500
001			978-0-387-49820-1
003			DE-He213
005			20250710084004.0
007			cr nn 008mamaa
008			100301s2008 xxu| s |||| 0|eng d
020			_a9780387498201 _a99780387498201
024	7		_a10.1007/978-0-387-49820-1 _2doi
082	0	4	_a003.54 _223
100	1		_aLi, Ming. _eauthor.
245	1	3	_aAn Introduction to Kolmogorov Complexity and Its Applications _h[recurso electrónico] / _cby Ming Li, Paul Vitányi.
264		1	_aNew York, NY : _bSpringer New York, _c2008.
300			_bonline resource.
336			_atext _btxt _2rdacontent
337			_acomputer _bc _2rdamedia
338			_arecurso en línea _bcr _2rdacarrier
347			_atext file _bPDF _2rda
490	1		_aTexts in Computer Science, _x1868-0941
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]
650		0	_aCOMPUTER SCIENCE.
650		0	_aCODING THEORY.
650		0	_aINFORMATION THEORY.
650		0	_aOPTICAL PATTERN RECOGNITION.
650		0	_aALGORITHMS.
650		0	_aMATHEMATICAL STATISTICS.
650	1	4	_aCOMPUTER SCIENCE.
650	2	4	_aCODING AND INFORMATION THEORY.
650	2	4	_aTHEORY OF COMPUTATION.
650	2	4	_aALGORITHMS.
650	2	4	_aSTATISTICAL THEORY AND METHODS.
650	2	4	_aPATTERN RECOGNITION.
700	1		_aVitányi, Paul. _eauthor.
710	2		_aSpringerLink (Online service)
773	0		_tSpringer eBooks
776	0	8	_iPrinted edition: _z9780387339986
830		0	_aTexts in Computer Science, _x1868-0941
856	4	0	_uhttp://dx.doi.org/10.1007/978-0-387-49820-1 _zVer el texto completo en las instalaciones del CICY
912			_aZDB-2-SCS
942			_2ddc _cER
999			_c57885 _d57885