Comment on page
- 1.True/false: suppose we have a 45000-bit program in Python that outputs a bitstream B. What is the maximum size of an interpreter written in Java that proves the Java-Kolmogorov complexity is less than 100,000?
- 2.What are the two defining properties of an NP problem?
- 1.What is the probability that some sequence of 1 million bits could be compressed to 900,000 bits or less?