An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

افزودن به بوکمارک اشتراک گذاری 0 دیدگاه کاربران 4 (1)

مشارکت: عنوان و توضیح کوتاه هر کتاب را ترجمه کنید این ترجمه بعد از تایید با نام شما در سایت نمایش داده خواهد شد.

ترجمه این کتاب مشاهده همه کتاب های ترجمه نشده

از خودتان درباره کتاب توضیح کوتاهی بنویسید

This must-read textbook presents an essential introduction to Kolmogorov complexity (KC), a central theory and powerful tool in information science that deals with the quantity of information in individual objects. The text covers both the fundamental concepts and the most important practical applications, supported by a wealth of didactic features.

This thoroughly revised and enhanced fourth edition includes new and updated material on, amongst other topics, the Miller-Yu theorem, the Gács-Kučera theorem, the Day-Gács theorem, increasing randomness, short lists computable from an input string containing the incomputable Kolmogorov complexity of the input, the Lovász local lemma, sorting, the algorithmic full Slepian-Wolf theorem for individual strings, multiset normalized information distance and normalized web distance, and conditional universal distribution.

Topics and features: describes the mathematical theory of KC, including the theories of algorithmic complexity and algorithmic probability; presents a general theory of inductive reasoning and its applications, and reviews the utility of the incompressibility method; covers the practical application of KC in great detail, including the normalized information distance (the similarity metric) and information diameter of multisets in phylogeny, language trees, music, heterogeneous files, and clustering; discusses the many applications of resource-bounded KC, and examines different physical theories from a KC point of view; includes numerous examples that elaborate the theory, and a range of exercises of varying difficulty (with solutions); offers explanatory asides on technical issues, and extensive historical sections; suggests structures for several one-semester courses in the preface.

As the definitive textbook on Kolmogorov complexity, this comprehensive and self-contained work is an invaluable resource for advanced undergraduate students, graduate students, and researchers in all fields of science.

لغو

گزارش تخلف

مغایرت عنوان کتاب با توضیحات و تصویر جلد
عدم رعایت حقوق نشر طبق قوانین جمهوری اسلامی ایران
محتوای مستهجن
توهین به قومیتها و محتوای نژادپرستی
توهین به اقیلیتهای مذهبی
اهانت به مقامات سیاسی و مذهبی
اشاعه ی کودک آزاری
سایر موارد

بستن

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

2019

نویسنده

Paul Vitányi

ناشر

Springer

شابک

9783030112974

20,000 تومان

خرید کتاب مطالعه نمونه درخواست ترجمه کتاب

خرید کتاب An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

گزارش تخلف

فرمت کتاب

ebook

زبان

english

تاریخ انتشار

2019

نویسنده

ناشر

شابک

کتاب های مرتبط

Randomness and complexity : from Leibniz to Chaitin

An Introduction to Kolmogorov Complexity and Its Applications (Texts in Computer Science)

9780387339986

The Kolmogorov Legacy in Physics

Kolmogorov's Heritage in Mathematics

Kolmogorov's Heritage in Mathematics

Kolmogorov's Heritage in Mathematics

Randomness and Complexity, from Leibniz to Chaitin.

A Level of Martin-Lof Randomness

An Introduction To Kolmogorov Complexity And Its Applications

Quantum Shift in the Global Brain

Hope Beneath Our Feet

Breasts

Shark Attacks

Mars Landing 2012

The Efficiency Trap

The Age of Wonder

100 великих городов мира

100 великих чудес света

My Mom, Style Icon

Inventores increíblemente poco razonables

دیدگاه کاربران