Kolmogorov complexity

Noun

countable uncountable

(computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object.

Japanese Meaning

情報オブジェクト（例：書籍、画像など）を生成する最短プログラムの長さとして定義される、計算理論における情報の複雑さ / 物体の情報量や記述の難易度を測る尺度としての、Kolmogorov複雑性

What is this buttons?

Researchers often cite Kolmogorov complexity when arguing that some patterns are essentially incompressible.

Google Translation / DeepL Translation

研究者たちは、あるパターンが本質的に圧縮不可能であると主張するときに、コルモゴロフ複雑度をしばしば引用します。

Details

Sense（1）

(computing theory) The complexity of an information object—such as a book or an image—informally defined as the length of the shortest program that produces that information object.

Kolmogorov complexities

（ plural ）

Details

Kolmogorov complexity

Dictionary quizzes to help you remember the meaning

Login / Sign up

Download the app!

Kolmogorov complexity

Dictionary quizzes to help you remember the meaning

Login / Sign up

Login

──── or ────

Sign up

──── or ────

Download the app!