|
|
BP1139 |
| Bongard Problems where, given any example, there is a way to add details to it (without erasing) such that it is sorted on the other side vs. BPs where this is not the case. |
|
| |
|
|
COMMENTS
|
This classification is specifically concerned with changes to examples that leave them sortable, as there are almost always ways of adding details to a BP's examples that make them unsortable.
Right-sorted BPs in this Bongard Problem are often Bongard Problems where there is always a way of adding to left-sorted examples to make them right-sorted, but not the other way around, or vice versa.
Another version of this Bongard Problem could be made about adding white (erasure of detail) instead of black (addition of detail).
Another version could be made about adding either white or black, but not both.
Where appropriate, you can assume all images will have some room in a lip of white background around the border (ignoring https://en.wikipedia.org/wiki/Sorites_paradox ).
You can't expand the boundary of an image as you add detail to it. If image boundaries could be expanded, then any shape could be shrunken to a point in relation to the surrounding whiteness, which could then be filled in to make any other shape.
How should this treat cases in which just a few examples can't be added to at all (like an all-black box)? E.g. BP966. Should this be sorted right (should the one special case of a black box spoil it) or should it be sorted left (should examples that can't at all be further added be discounted)? Maybe we should only sort BPs in which all examples can be further added to. (See BP1143left.) - Aaron David Fairbanks, Nov 12 2021
Is "addition of detail" context-dependent, or does it just mean any addition of blackness to the image? Say you have a points-and-lines Bongard Problem like BP1100, and you're trying to decide whether to sort it left or right here. You would just want to think about adding more points and lines to the picture. You don't want to get bogged down in thinking about whether black could be added to the image in a weird way so that a point gets turned into a line, or something. - Aaron David Fairbanks, Nov 13 2021 |
|
CROSSREFS
|
See BP1139 for Bongard Problems in which no example can be added to, period.
Adjacent-numbered pages:
BP1134 BP1135 BP1136 BP1137 BP1138  *  BP1140 BP1141 BP1142 BP1143 BP1144
|
|
KEYWORD
|
meta (see left/right), links, sideless
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP1140 |
| Bongard Problems where there is a way of adding details to some example (without erasing) that would sort it on the other side vs. Bongard Problems where there is no way of adding details to examples that would sort them on the other side. |
|
| |
|
|
COMMENTS
|
This classification is specifically concerned with changes to examples that leave them sortable, as there are almost always ways of adding details to a BP's examples that make them unsortable.
Another version of this Bongard Problem could be made about adding white (erasure of detail) instead of black (addition of detail).
Another version could be made about adding either white or black, but not both. |
|
CROSSREFS
|
Closely related to gap Problems and stable Problems.
Bongard Problems tagged finishedexamples will fit right.
Adjacent-numbered pages:
BP1135 BP1136 BP1137 BP1138 BP1139  *  BP1141 BP1142 BP1143 BP1144 BP1145
|
|
KEYWORD
|
meta (see left/right), links, sideless, invariance
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP1141 |
| Object inside of bounding box vs. object outside of bounding box. |
|
| |
|
|
|
|
|
BP1142 |
| Bongard Problems where there is no way to turn an example into any other sorted example by adding black OR white (not both) vs. Bongard Problems where some example can be altered in this way and remain sorted. |
|
| |
|
|
COMMENTS
|
Left-sorted problems have the keyword "finishedexamples" on the OEBP.
The addition does not have to be slight.
Left-sorted Problems usually have a very specific collection of examples, where the only images sorted all show the same type of object.
Any Bongard Problem where all examples are one shape outline will be sorted left, and (almost) any Bongard Problem where all examples are one fill shape will be sorted right. |
|
CROSSREFS
|
See BP1144 for the version about both additions and erasures, and only slight changes are considered.
See BP1167 for a stricter version, the condition that all examples have the same amount of black and white.
Adjacent-numbered pages:
BP1137 BP1138 BP1139 BP1140 BP1141  *  BP1143 BP1144 BP1145 BP1146 BP1147
|
|
KEYWORD
|
unwordable, notso, meta (see left/right), links, keyword, sideless, problemkiller
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP1143 |
| Bongard Problems where a visual addition (not erasing) can be made to any example such that it would still fit in the Bongard Problem vs. Bongard Problems where some example(s) are "maximal" (cannot be added to). |
|
| |
|
|
|
|
|
BP1144 |
| Bongard Problems where making any small change to any sorted example renders the example unsortable vs. other Bongard Problems. |
|
| |
|
|
|
|
|
BP1145 |
| Polygon that can be achieved by folding a square once vs. other polygons. |
|
| |
|
|
|
|
|
BP1146 |
| Same number of dots in top row as in leftmost column vs not so. |
|
| |
|
|
COMMENTS
|
This is a difficult-to-read attempt at making a Bongard Problem about perfect numbers. Grouping columns together to make rectangular arrays, each maximal (most dots possible) rectangular array of a particular height in any given example has the same number of dots in it (a perfect number, in left-sorted cases), and the dot-width of each array represents a particular divisor of that number.
It is not currently known whether there are a finite amount of examples that would be sorted left.
Every example in this Bongard Problem corresponds to a distinct natural number. There is not a way of representing the number 1 using the rules of construction for examples in this problem (if the problem were simply "Perfect number of dots vs. other number of dots", the example with 1 dot would be sorted right). |
|
REFERENCE
|
https://en.wikipedia.org/wiki/Perfect_number |
|
CROSSREFS
|
Adjacent-numbered pages:
BP1141 BP1142 BP1143 BP1144 BP1145  *  BP1147 BP1148 BP1149 BP1150 BP1151
|
|
KEYWORD
|
overriddensolution, left-listable, right-listable
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP1147 |
| Columns of the table could be respectively labeled "Number" and "Number of times number appears in this table" vs. not so. |
|
| |
|
|
|
|
|
BP1148 |
| Number of dots in the Nth box (from the left) is how many times the number (N - 1) appears in the whole diagram vs. not so. |
|
| |
|
|
COMMENTS
|
Left-sorted examples are sometimes called autobiographical or self-descriptive numbers. |
|
REFERENCE
|
https://oeis.org/A349595
https://en.wikipedia.org/wiki/Self-descriptive_number |
|
CROSSREFS
|
See BP1147 for a similar idea.
BP1149 was inspired by this.
Adjacent-numbered pages:
BP1143 BP1144 BP1145 BP1146 BP1147  *  BP1149 BP1150 BP1151 BP1152 BP1153
|
|
KEYWORD
|
nice, precise, unwordable, notso, handed, leftright, left-narrow, sequence, preciseworld, left-listable, right-listable
|
|
CONCEPT
|
self-reference (info | search)
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|
|
|
|
|
|
|