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".

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]").

"Stability" Bongard Problems are considered @invariance Bongard Problems. On one hand, maybe this is wrong, 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".

Meta Bongard Problems of the form "arbitrarily small [transformation] applied to some examples switch their sorting vs. the sorting of each example is invariant under sufficiently small applications of [transformation]" vs. other meta Bongard Problems.

Left-sorted Bongard Problems have the keyword "stability" on the OEBP.

For any "stability" Bongard Problem there could usually be made a corresponding @dependence Bongard Problem ("[transformation] applied to some examples switch their sorting vs. sorting is invariant under [transformation]").

"Stability" Bongard Problems are considered @dependence Bongard Problems. On one hand, maybe this is wrong, 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".

"Stability" Bongard Problems are @dependence Bongard Problems.

Aaron David Fairbanks

"Sortdependence" Bongard Problems are @notso Bongard Problems.

Meta Bongard Problems of the form "[transformation] applied to some examples make them unsortable vs. all sorted examples stay sorted after applying [transformation] (although perhaps they switch sides)" vs. other meta Bongard Problems.

Left-sorted Bongard Problems have the keyword "sortdependence" on the OEBP.

"Sortdependence" Bongard Problems are @notso Bongard Problems.

Aaron David Fairbanks