Search: ex:BP351
|
Displaying 1-10 of 11 results found.
|
( next ) page 1 2
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP550 |
| Experimental Bongard Problems vs. traditional-style Bongard Problems. |
|
| |
|
|
COMMENTS
|
Left examples have the keyword "experimental" on the OEBP.
Right examples have the keyword "traditional" on the OEBP.
Experimental BPs push the boundaries of what makes Bongard Problems Bongard Problems.
Traditional BPs show some simple property of black and white pictures. The OEBP is a place with many wild and absurd Bongard Problems, so it is useful to have an easy way to just find the regular old Bongard Problems. |
|
CROSSREFS
|
Adjacent-numbered pages:
BP545 BP546 BP547 BP548 BP549  *  BP551 BP552 BP553 BP554 BP555
|
|
KEYWORD
|
subjective, meta (see left/right), links, keyword, left-it
|
|
WORLD
|
bp [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP563 |
| Bongard Problems such that there is a way of making an infinite list of all relevant possible left-sorted examples vs. Bongard Problems where there is no such way of listing all left-sorted examples. |
|
| |
|
|
COMMENTS
|
Left-sorted Problems have the keyword "left-listable" on the OEBP.
All the possible left examples for the BPs on the left side of this problem could be listed in one infinite sequence. Right examples here are Problems for which no such sequence can exist.
This depends on deciding what images should be considered "the same thing", which is subjective and context-dependent.
All examples in this Bongard Problem have an infinite left side (they do not have the keyword left-finite).
The mathematical term for a set that can be organized into an infinite list is a "countably infinite" set, as opposed to an "uncountably infinite" set.
Another related idea is a "recursively enumerable" a.k.a. "semi-decidable" set, which is a set that a computer program could list the members of.
The keyword "left-listable" is meant to be for the more general idea of a countable set, which does not have to do with computer algorithms.
Note that this is not just BP940 (right-listable) flipped.
It seems in practice, Bongard Problems that are left-listable are usually also right-listable because the whole class of relevant examples is listable. A keyword for just plain "listable" may be more useful. Or instead keywords for left- versus right- semidecidability, in the sense of computing. - Aaron David Fairbanks, Jan 10 2023 |
|
REFERENCE
|
https://en.wikipedia.org/wiki/Countable_set |
|
CROSSREFS
|
See left-finite, which distinguishes between a finite left side and infinite left side.
"Left-listable" BPs are typically precise.
Adjacent-numbered pages:
BP558 BP559 BP560 BP561 BP562  *  BP564 BP565 BP566 BP567 BP568
|
|
KEYWORD
|
math, meta (see left/right), links, keyword
|
|
WORLD
|
bp_infinite_left_examples [smaller | same | bigger] zoom in right (left_uncountable_bp)
|
|
AUTHOR
|
Leo Crabbe
|
|
|
|
|
BP592 |
| Bongard Problem with solution relating to concept: becoming larger / becoming smaller vs. Bongard Problem unrelated to this concept. |
|
| |
|
|
|
|
|
BP621 |
| Bongard Problem with solution relating to concept: discrete / continuous quantity vs. Bongard Problem unrelated to this concept. |
|
| |
|
|
|
|
|
BP654 |
| Bongard Problem with solution relating to concept: iteration (discrete, within the example) vs. Bongard Problem unrelated to this concept. |
|
| |
|
|
|
|
|
BP708 |
| Bongard Problem with solution relating to concept: tracing along a line or curve vs. Bongard Problem unrelated to this concept. |
|
| |
|
|
|
|
|
BP789 |
| Bongard Problems in which all examples have the same format, a specific multi-part structure vs. other Bongard Problems. |
|
| |
|
|
COMMENTS
|
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.) |
|
CROSSREFS
|
Adjacent-numbered pages:
BP784 BP785 BP786 BP787 BP788  *  BP790 BP791 BP792 BP793 BP794
|
|
KEYWORD
|
meta (see left/right), links, keyword
|
|
WORLD
|
bp [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP866 |
| Bongard Problems that admit examples fitting the solution in various creative ways vs. not so. |
|
| |
|
|
COMMENTS
|
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.) |
|
CROSSREFS
|
Adjacent-numbered pages:
BP861 BP862 BP863 BP864 BP865  *  BP867 BP868 BP869 BP870 BP871
|
|
KEYWORD
|
notso, meta (see left/right), links, keyword
|
|
WORLD
|
bp [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP940 |
| Bongard Problems such that there is a way of making an infinite list of all relevant possible right-sorted examples vs. Bongard Problems where there is no such way of listing all right-sorted examples. |
|
| |
|
|
|
|
|
BP1158 |
| Bongard Problems in which each example communicates a rule vs. other Bongard Problems. |
|
| |
|
|
COMMENTS
|
Left-sorted Bongard Problems have the keyword "rules" on the OEBP.
In the typical "rules" Bongard Problem, it is possible to come up with many convoluted rules that fit each example, but the intended interpretation is the only simple and obvious one.
Since it is difficult to communicate a rule with little detail, "rules" Bongard Problems are usually infodense.
Typically, each example is itself a bunch of smaller examples that all obey the rule. It is the same as how a Bongard Problems relies on many examples to communicate rules; it likely wouldn't get the answer across with just one example.
Often, each rule is communicated just by showing some examples of things satisfying it placed next to each other. (See keywords left-narrow and right-narrow.) Contrast Bongard Problems, which are more communicative, by showing some examples satisfying the rule and some examples NOT satisfying the rule.
BP1157 is an example of a "rules" Bongard Problem in which each intended rule is communicated by just one example of its application; these rules have to be particularly simple and intuitive, and the individual examples have to be complicated enough to communicate them.
A "rules" Bongard Problem is often collective. Some examples may admit multiple equally plausible rules, and the correct interpretation of each example only becomes clear once the solution is known. The group of examples together improve the solver's confidence about having understood each individual one right.
It is common that there will be one or two examples with multiple reasonable interpretations due to oversight of the author. |
|
CROSSREFS
|
All meta Bongard Problems are "rules" Bongard Problems.
Many of the other Bongard-Problem-like structures seen on the OEBP are also about recognizing a pattern. (See keyword structure.)
"Rules" Bongard Problems are abstract, although the individual rules in them may not be abstract. "Rules" Bongard Problems also usually have the keyword creativeexamples.
Adjacent-numbered pages:
BP1153 BP1154 BP1155 BP1156 BP1157  *  BP1159 BP1160 BP1161 BP1162 BP1163
|
|
KEYWORD
|
fuzzy, meta (see left/right), links, keyword, left-self, rules
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|
|
|
|
|
|
|
|