reynolds number

Kolmogorov Complexity

Course Description

Course Objective

In algorithmic information theory the Kolmogorov complexity of an object such as a piece of text is a measure of the computational resources needed to specify the object It is named after Andrey Kolmogorov who first published on the subject in 1963

Ask a Question

My Questions

Comment