|
Left-sorted Bongard Problems have the keyword "stability" on the OEBP.
For any "stability" Bongard Problem there could usually be made a corresponding invariance Bongard Problem ("[transformation] applied to some examples switch their sorting vs. sorting is invariant under [transformation]").
Potentially, "stability" Bongard Problems could be considered invariance Bongard Problems. On one hand, they are different, since checking whether arbitrarily small transformations switch an example's sorting is different from checking whether a particular transformation switches an example's sorting; the former is infinitely many conditions. On the other hand, there is actually only finitely much detail in any of the examples, and in practice a "stability" Bongard Problem generally just amounts to "a small application of [transformation] switches an example's sorting vs. not". |