Search: -ex:BP4
|
Displaying 1-9 of 9 results found.
|
page 1
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP504 |
| BP pages on the OEBP in need of more examples vs. BP pages with a list of examples that should not be altered. |
|
| |
|
|
COMMENTS
|
Left-sorted Bongard Problems have the keyword "stub" on the OEBP.
Right-sorted Bongard Problems have the keyword "finished" on the OEBP.
Users are not able to add or remove examples from Problems tagged "finished." (This is unusual; most Bongard Problems on the OEBP can be expanded indefinitely by users.)
A "finished" Bongard Problem will always admit the alternate, convoluted solution "is [left example 1] OR is [left example 2] OR . . . OR is [last left example] vs. is [right example 1] OR is [right example 2] OR . . . OR is [last right example]". |
|
CROSSREFS
|
Bongard's original Problems are tagged "finished."
Adjacent-numbered pages:
BP499 BP500 BP501 BP502 BP503  *  BP505 BP506 BP507 BP508 BP509
|
|
KEYWORD
|
meta (see left/right), links, keyword, oebp, presentationmatters, left-finite, right-finite, instruction
|
|
WORLD
|
bppage [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP537 |
| Meta Bongard Problems vs. other Bongard Problems. |
|
| |
|
|
|
|
|
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
|
|
|
|
|
BP552 |
| Orientation-dependent Bongard Problems vs. orientation-independent visual Bongard Problems. |
|
| |
|
|
COMMENTS
|
Left examples have the keyword "handed" on the OEBP.
If mirroring any example along the any axis can change its sorting the BP is "handed."
Note that BPs about comparing orientation between multiple things in one example fit on the right side. |
|
CROSSREFS
|
See BP871 for the version with pictures of Bongard Problems (miniproblems) instead of links to pages on the OEBP.
The keyword leftright is specifically about flipping over the vertical axis, while the keyword updown is specifically about flipping over the horizontal axis.
Bongard Problems tagged rotate are usually "handed", since any rotation can be created by two reflections. Not necessarily, however, since the reflected step in between might not be sorted on either side by the Bongard Problem.
Adjacent-numbered pages:
BP547 BP548 BP549 BP550 BP551  *  BP553 BP554 BP555 BP556 BP557
|
|
KEYWORD
|
meta (see left/right), links, keyword, invariance, wellfounded
|
|
WORLD
|
visualbp [smaller | same | bigger] zoom in left (handed_visualbp)
|
|
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
|
|
|
|
|
BP1113 |
| Bongard Problems relating to the OEBP vs. Bongard Problems unrelated to the OEBP. |
|
| |
|
|
|
|
|
BP1195 |
| Bongard Problems that depend on absolute positioning within the bounding box vs. shifting at once all content within the bounding box (without letting it cross the bounding box) will not switch the sorting of any examples. |
|
| |
|
|
| |
|
|
|
|
|
|
|