3 ms·
Yes, but still finite.
by dvt 5y ago
Yes, but still finite.
- pishpash 5y agoAs in the above comment, the K constant actually bears on low-complexity strings, not high-complexity ones. It says low-complexity strings in any language are always reasonably low-complexity (within +K) in other languages, but since K can be arbitrarily large, the bound is totally loose and useless.