Jump to content

  • Log In with Google      Sign In   
  • Create Account


Game Development Dictionary


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 Comments


PARTNERS