Kolmogorov Complexity and Computational Complexity /

There are many ways to measure the complexity of a given object, but there are two measures of particular importance in the theory of computing: One is Kolmogorov complexity, which measures the amount of information necessary to describe an object. Another is computational complexity, which measures...

Full description

Bibliographic Details

Main Author:	Watanabe, Osamu
Corporate Author:	SpringerLink (Online service)
Format:	eBook
Language:	English
Published:	Berlin, Heidelberg : Springer Berlin Heidelberg, 1992.
Series:	EATCS monographs on theoretical computer science.
Subjects:	Computer science. Computer software. Combinatorial analysis. Electronic books.
Online Access:	Connect to the full text of this electronic book