I think he’s saying “suppose p1 is the shortest program that gets at most loss x. If p2 gets loss y<x, then we must require a longer string than p1 to express p2, and p1 therefore cannot express p2”.
This seems true, but I don’t understand its relevance to recursive self improvement.
I think he’s saying “suppose p1 is the shortest program that gets at most loss x. If p2 gets loss y<x, then we must require a longer string than p1 to express p2, and p1 therefore cannot express p2”.
This seems true, but I don’t understand its relevance to recursive self improvement.