Search: supworld:linksbp
|
|
BP537 |
| Meta Bongard Problems vs. other Bongard Problems. |
|
| |
|
|
|
|
|
BP541 |
| Bongard Problems vs. anything else. |
|
| | |  | blllmam | cat | nongard |
|
|
|
|
|
|
BP542 |
| BP Pages on the OEBP vs. anything else. |
|
| |
|
|
|
|
|
BP544 |
| Everything vs. nothing. |
|
| |
|
|
COMMENTS
|
All ideas and things, with no limits. |
|
CROSSREFS
|
Adjacent-numbered pages:
BP539 BP540 BP541 BP542 BP543  *  BP545 BP546 BP547 BP548 BP549
|
|
KEYWORD
|
notso, meta (see left/right), links, world, left-self, right-finite, right-full, left-null, left-it, feedback, experimental, funny
|
|
CONCEPT
|
existence (info | search)
|
|
WORLD
|
everything [smaller | same] zoom in left (everything) | zoom in right (nothing)
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP547 |
| Meta Meta Bongard Problems vs. other Bongard Problems. |
|
| |
|
|
|
|
|
BP549 |
| Bongard Problems with simple solutions vs. Bongard Problems with convoluted solutions. |
|
| |
|
|
COMMENTS
|
Right examples have the keyword "convoluted" on the OEBP.
Images of Bongard Problems with convoluted solutions often admit many alternative solutions of similar complexity. In order for one particular convoluted solution to be the simplest solution, it is often necessary to include a large number of examples. A similar issue appears in infodense Bongard Problems.
When a Bongard Problem is too convoluted, a person might find the intended answer but discount it because it seems too convoluted. A solution to a Bongard Problem is unambiguous when it is the least convoluted option by a large margin. |
|
CROSSREFS
|
Related to arbitrary.
See BP374 for simple vs. complicated drawings.
Adjacent-numbered pages:
BP544 BP545 BP546 BP547 BP548  *  BP550 BP551 BP552 BP553 BP554
|
|
KEYWORD
|
meta (see left/right), links, keyword
|
|
WORLD
|
bp [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
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
|
|
|
|
|
BP561 |
| Meta Bongard Problems fitting in their own world vs. other meta Bongard Problems. |
|
| |
|
|
|
|
|
BP565 |
| Bongard Problems that are hard for humans to solve but easier for computers to solve vs. Bongard Problems that are hard for computers to solve but easier for humans to solve. |
|
| |
|
|
|
|
|
BP566 |
| Meta Bongard Problems of the form "[transformation] applied to some examples switch their sorting vs. sorting is invariant under [transformation]" vs. other meta Bongard Problems. |
|
| |
|
|
COMMENTS
|
Left-sorted Bongard Problems have the keyword "invariance" on the OEBP.
Bongard Problems labelled "invariance" are usually (but not always) about transformations that can be undone by other transformations of the same class. (The technical term for this kind of transformation is an "isomorphism".)
When the transformations used in a "invariance" Bongard Problem vary continuously, there could usually be made a corresponding stability Bongard Problem. Stability Bongard Problems are like "invariance" Bongard Problems but for arbitrarily small applications of [transformation] affecting examples' sorting.
Potentially, stability Bongard Problems could be considered "invariance" Bongard Problems. On one hand, they are different, since checking whether arbitrarily small transformations switch an example's sorting is different from checking whether a particular transformation switches an example's sorting; the former is infinitely many conditions. On the other hand, there is actually only finitely much detail in any of the examples, and in practice a stability Bongard Problem generally just amounts to "a small application of [transformation] switches an example's sorting vs. not".
(The keyword gap is another example of a Bongard Problem currently labelled with "invariance" that arguably does not technically fit.)
Also, dependence Bongard Problems could be considered "invariance" Bongard Problems, where the relevant kind of transformation is swapping the example out for any other example that shares the relevant property. |
|
CROSSREFS
|
"Invariance" Bongard Problems are notso Bongard Problems.
"Invariance" Bongard Problems are often keywords (keyword keyword) on the OEBP.
See keyword problemkiller, which is about transformations making all sorted examples unsortable.
Adjacent-numbered pages:
BP561 BP562 BP563 BP564 BP565  *  BP567 BP568 BP569 BP570 BP571
|
|
KEYWORD
|
meta (see left/right), links, keyword, metameta
|
|
WORLD
|
linksbp [smaller | same | bigger]
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
Welcome |
Solve |
Browse |
Lookup |
Recent |
Links |
Register |
Contact
Contribute |
Keywords |
Concepts |
Worlds |
Ambiguities |
Transformations |
Invalid Problems |
Style Guide |
Goals |
Glossary
|
|
|
|
|
|
|
|
|
|