Search: user:Leo Crabbe
|
| |
|
| BP1154 |
| Visual Bongard Problems about Bongard Problems vs. other visual Bongard Problems. |
|
| |
|
| |
| |
|
|
| |
|
| BP1153 |
| Valid multi-sided Bongard Problems vs. invalid multi-sided Bongard Problems. |
|
| |
|
| |
| |
|
|
| |
|
| BP1151 |
| Section of the image is a Bongard Problem vs. no section of the image is a Bongard Problem. |
|
| |
|
| |
| |
|
|
| |
|
| 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 self-descriptive sequences. |
|
|
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
|
| |
|
|
| |
|
| BP1147 |
| Columns of the table could be respectively labeled "Number" and "Number of times number appears in this table" vs. not so. |
|
| |
|
| |
| |
|
|
| |
|
| 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
|
|
|
AUTHOR
|
Leo Crabbe
|
| |
|
|
| |
|
| BP1145 |
| Polygon that can be achieved by folding a square once vs. other polygons. |
|
| |
|
| |
| |
|
|
| |
|
| 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
|
| |
| |
|
|
|
|
|
|
|
|
