Perhaps, but we’re not aiming for an algorithm able to discover the minimal description of “anything”. We’re working with an object of a very specific type, that has a very specific structure which could be exploited (perhaps the way these posts sketch out) to find that minimal representation.
I think this is a general problem with these kinds of fundamental impossibility theorems (see also: no-free-lunch theorems, the data-processing inequality, Legg’s minimial-complexity theorem). They’re usually inapplicable to practical cases, because they talk about highly generic objects which are missing all the structures that make those problems solvable in practice. This is a good post on the topic.
Perhaps, but we’re not aiming for an algorithm able to discover the minimal description of “anything”. We’re working with an object of a very specific type, that has a very specific structure which could be exploited (perhaps the way these posts sketch out) to find that minimal representation.
I think this is a general problem with these kinds of fundamental impossibility theorems (see also: no-free-lunch theorems, the data-processing inequality, Legg’s minimial-complexity theorem). They’re usually inapplicable to practical cases, because they talk about highly generic objects which are missing all the structures that make those problems solvable in practice. This is a good post on the topic.
That’s a fair observation. I will look at this post. Thank you.