>  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.

0 0

작성자

  • GeorgeV
  •  (Gold) 1123 포인트
  • 100% positive feedback
© 2024 CSOFT International, Ltd.