Search: ex:BP1191
|
Displaying 1-6 of 6 results found.
|
page 1
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP503 |
| "Nice" Bongard Problems vs. Bongard Problems the OEBP does not need more like. |
|
| |
|
|
|
|
|
BP512 |
| Abstract Bongard Problems vs. concrete visual Bongard Problems. |
|
| |
|
|
|
|
|
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
|
|
| |
|
|
|
|