Search: keyword:metameta
|
|
| Displaying 1-10 of 29 results found.
|
( next ) page 1 2 3
|
|
|
Sort:
id
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
|
| |
|
| BP517 |
| Meta Bongard Problems that sort themselves left vs. meta Bongard Problems that sort themselves right. |
|
| |
|
| |
| |
|
|
| |
|
| BP519 |
| Meta-BPs that indicate a specific concept appearing in a BP's solution. |
|
| |
|
| |
| |
|
|
| |
|
| BP537 |
| Meta Bongard Problems vs. other Bongard Problems. |
|
| |
|
| |
| |
|
|
| |
|
| BP539 |
| Meta Bongard Problems such that if the sides of an example Bongard Problem are switched its sorting within the meta Problem may switch vs. meta Bongard Problems that always sort flipped versions on the same side. |
|
| |
|
| |
| |
|
|
| |
|
| BP547 |
| Meta Meta Bongard Problems vs. other Bongard Problems. |
|
| |
|
| |
| |
|
|
| |
|
| BP561 |
| Meta Bongard Problems fitting in their own world vs. other meta Bongard Problems. |
|
| |
|
| |
| |
|
|
| |
|
| 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
|
| |
|
|
| |
|
| BP577 |
| Concept MBPs about "primitive" concepts vs. concept MBPs about "composite" concepts. |
|
| |
|
| |
| |
| |
|
|
|
|
|
|
|
|
