Ching-lueh Chang - Academia.edu (original) (raw)
Uploads
Papers by Ching-lueh Chang
International Journal of Foundations of Computer Science, 2010
A bit string is random (in the sense of algorithmic information theory) if it is incompressible, ... more A bit string is random (in the sense of algorithmic information theory) if it is incompressible, i.e., its Kolmogorov complexity is close to its length. Two random strings are independent if knowing one of them does not simplify the description of other, i.e., the conditional complexity of each string (using the other as a condition) is close to its length. We may define independence of a k-tuple of strings in the same way.
International Journal of Foundations of Computer Science, 2010
A bit string is random (in the sense of algorithmic information theory) if it is incompressible, ... more A bit string is random (in the sense of algorithmic information theory) if it is incompressible, i.e., its Kolmogorov complexity is close to its length. Two random strings are independent if knowing one of them does not simplify the description of other, i.e., the conditional complexity of each string (using the other as a condition) is close to its length. We may define independence of a k-tuple of strings in the same way.