Interesting, I think. So the key difference with Kolmogorov complexity is that it's computable, right? It seems like a special case Kolmogorov complexity but with a weaker programming language that doesn't have all it's interesting properties locked away by the halting problem.