Bongard Problems sorted left have the keyword "meta" on the OEBP.

Meta Bongard Problems are Bongard Problems that sort Bongard Problems. Sometimes abbreviated MBPs.

The first meta Bongard Problem was BP200.

Some meta BP pages sort images of Bongard Problems (keyword miniproblems), while other meta BP pages sort other BP pages (keyword links).

BPs that sort meta-BPs are labelled metameta.

Adjacent-numbered pages:
BP532 BP533 BP534 BP535 BP536  *  BP538 BP539 BP540 BP541 BP542

meta (see left/right), links, keyword, world, left-self, sideless, metameta, left-full, feedback

bp [smaller | same | bigger]
zoom in left (linksbp)

Aaron David Fairbanks

Left examples have the keyword "structure" on the OEBP.

Examples of "structures": Bongard Problem, Bongard's Dozen, 4-panel analogy board, sequence of objects with a constant quantity changing from object to object that together represent the quality that is changing, sequence of objects paired with clump of n dots together representing the nth object that should come in the sequence.

If the solver hasn't become familiar with the featured structure, the Bongard Problem's solution may seem convoluted or inelegant. (See keyword assumesfamiliarity.) Once the solver gets used to seeing a particular structure it becomes easier to read that structure and solve Bongard Problems featuring it.

One can non-verbally teach someone how a particular structure works via a Bongard Problem, showing valid examples of that structure versus non-examples. E.g., BP968 for the structure of Bongard Problems and BP981 for the structure of analogy grids. (See the keyword teach.)

Adjacent-numbered pages:
BP784 BP785 BP786 BP787 BP788  *  BP790 BP791 BP792 BP793 BP794

meta (see left/right), links, keyword

bp [smaller | same | bigger]

Aaron David Fairbanks

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

Be encouraged to contribute new interesting examples to Bongard Problems with this keyword.

There is much overlap with the keyword hardsort.

This is what it usually means to say examples fit on (e.g.) the left of a Bongard Problem in various creative ways: there is no (obvious) general method to determine a left-fitting example fits left.

There is a related idea in computability theory: a "non recursively enumerable" property is one that cannot in general be checked by a computer algorithm.

But keep in mind the tag "creativeexamples" is supposed to mean something less formal. For example, it requires no ingenuity for a human being to check when a simple shape is convex or concave (so BP4 is not labelled "creativeexamples"). However, it is not as if we use an algorithm to do this, like a computer. (It is not even clear what an "algorithm" would mean in this context, since it is ambiguous both what class of shapes the Bongard Problem sorts and how that would be encoded into a computer program's input. There are usually many options and ambiguities like this whenever one tries to formalize the content of a Bongard Problem.)

Adjacent-numbered pages:
BP861 BP862 BP863 BP864 BP865  *  BP867 BP868 BP869 BP870 BP871

notso, meta (see left/right), links, keyword

bp [smaller | same | bigger]

Aaron David Fairbanks

Left-sorted BPs have the keyword "notso" on the OEBP.

This meta Bongard Problem is about Bongard Problems featuring two rules that are conceptual opposites.

Sometimes both sides could be seen as the "not" side: consider, for example, two definitions of the same Bongard Problem, "shape has hole vs. does not" and "shape is not filled vs. is". It is possible (albeit perhaps unnatural) to phrase the solution either way when the left and right sides partition all possible relevant examples cleanly into two groups (see the allsorted keyword).

When one property is "positive-seeming" and its opposite is "negative-seeming", it usually means the positive property would be recognized without counter-examples (e.g. a collection of triangles will be seen as such), while the negative property wouldn't be recognized without counter-examples (e.g. a collection of "non-triangle shapes" will just be interpreted as "shapes" unless triangles are shown opposite them).

BP513 (keyword left-narrow) is about Bongard Problems whose left side can be recognized without the right side. When a Bongard Problem is left-narrow and not "right-narrow that usually makes the property on the left seem positive and the property on the right seem negative.

The OEBP by convention has preferred the "positive-seeming" property (when there is one) to be on the left side.

All in all, the keyword "notso" should mean:

1) If the Bongard Problem is "narrow" on at least one side, then it is left-narrow.

2) The right side is the conceptual negation of the left side.

If a Bongard Problem's solution is "[Property A] vs. not so", the "not so" side is everything without [Property A] within some suitable context. A Bongard Problem "triangles vs. not so" might only include simple shapes as non-triangles; it need not include images of boats as non-triangles. It is not necessary for all the kitchen sink to be thrown on the "not so" side (although it is here).

See BP1001 for a version sorting pictures of Bongard Problems (miniproblems) instead of links to pages on the OEBP. (This version is a little different. In BP1001, the kitchen sink of all other possible images is always included on the right "not so" side, rather than a context-dependent conceptual negation.)

Contrast keyword viceversa.

"[Property A] vs. not so" Bongard Problems are often allsorted, meaning they sort all relevant examples--but not always, because sometimes there exist ambiguous border cases, unclear whether they fit [Property A] or not.

Adjacent-numbered pages:
BP862 BP863 BP864 BP865 BP866  *  BP868 BP869 BP870 BP871 BP872

notso, meta (see left/right), links, keyword, left-self, funny

everything [smaller | same]
zoom in left

Aaron David Fairbanks

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

Sometimes all the examples in a Bongard Problem need to be interpreted a certain way for the Bongard Problem to make sense. Only once the representation is understood, the idea seems simple.

For example, all meta Bongard Problems (Bongard Problems sorting other Bongard Problems) assume the solver interprets the examples as Bongard Problems.

TO DO: Maybe it is best to stop putting the label "assumesfamiliarity" on all meta-Bongard Problems. There are so many of them. It may be better to only use the "assumesfamiliarity" keyword on meta-BPs for a further assumption than just that all examples are interpreted as Bongard Problems. - Aaron David Fairbanks, Feb 11 2021

Many Bongard Problems in which all examples take the same format (keyword structure) assume the solver already knows how to read that format.

Some Bongard Problems assume the solver will be able to understand symbolism that is consistent between examples (keyword consistentsymbols).

Bongard Problems tagged math often assume the solver is familiar with a certain representation of a math idea.

Adjacent-numbered pages:
BP1106 BP1107 BP1108 BP1109 BP1110  *  BP1112 BP1113 BP1114 BP1115 BP1116

BP1032: The solution should really read "Assuming all images are Bongard Problems sorting each natural number left or right ..." This Bongard Problem makes sense to someone who has been solving a series of similar BPs, but otherwise there is no reason to automatically read a collection of numbers as standing for a larger collection of numbers.

fuzzy, meta (see left/right), links, keyword

bp [smaller | same | bigger]

Aaron David Fairbanks