الصفحة الرئيسية > Term: Kolmogorov complexity
Kolmogorov complexity
The minimum number of bits into which a string can be compressed without losing information. This is defined with respect to a fixed, but universal decompression scheme, given by a universal Turing machine.
- قسم من أقسام الكلام: noun
- المجال / النطاق: علم الكمبيوتر
- الفئة: Algorithms & data structures
- Government Agency: NIST
0
المنشئ
- GeorgeV
- 100% positive feedback