Amazon cover image
Image from Amazon.com

An introduction to Kolmogorov complexity and its applications Ming Li, Paul Vitanyi

By: Contributor(s): Series: Texts in computer science | Texts in computer sciencePublication details: New York Springer c2008Edition: 3rd edDescription: xxiii, 790 p ill 25 cmISBN:
  • 9780387339986 (Cloth)
  • 0387339981 (Cloth)
Subject(s): DDC classification:
  • 511.3
Contents:
Preliminaries.- Algorithmic Complexity.- Algorithmic Prefix Complexity.- Algorithmic Probability.- Inductive Reasoning.- The Incompressibility Method.- Resource-Bounded Complexity.- Physics, Information, and Computation.- Shannon Information and Kolmogorov Complexity.- Information Distance
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Status Date due Barcode
Carti IMAR II 36141 (Browse shelf(Opens below)) Checked out 12/29/2026 0015067

eng

Cuprinde bibliografie si index

Preliminaries.- Algorithmic Complexity.- Algorithmic Prefix Complexity.- Algorithmic Probability.- Inductive Reasoning.- The Incompressibility Method.- Resource-Bounded Complexity.- Physics, Information, and Computation.- Shannon Information and Kolmogorov Complexity.- Information Distance

There are no comments on this title.

to post a comment.

Powered by Koha