Search: all:new
|
|
|
|
|
Sort:
recent
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
|
| |
|
| BP961 |
| Includes itself on the left vs. includes itself on the right. |
|
| |
|
|
|
|
COMMENTS
|
Some examples are Bongard Problems with this solution. |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP956 BP957 BP958 BP959 BP960 * BP962 BP963 BP964 BP965 BP966
|
|
|
KEYWORD
|
nice, precise, dual, handed, leftright, perfect, infinitedetail, both, neither, preciseworld
|
|
|
CONCEPT
|
fractal (info | search),
recursion (info | search),
self-reference (info | search)
|
|
|
AUTHOR
|
Aaron David Fairbanks
|
| |
|
|
| |
|
| BP956 |
| Nested pairs of brackets vs. other arrangement of brackets (some open brackets are not closed or there are extra closing brackets). |
|
| |
|
|
|
|
COMMENTS
|
Examples on the left are also known as "Dyck words". |
|
|
REFERENCE
|
https://en.wikipedia.org/wiki/Dyck_language |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP951 BP952 BP953 BP954 BP955 * BP957 BP958 BP959 BP960 BP961
|
|
|
KEYWORD
|
easy, nice, precise, allsorted, unwordable, notso, sequence, traditional, inductivedefinition, preciseworld, left-listable, right-listable
|
|
|
CONCEPT
|
recursion (info | search)
|
|
|
AUTHOR
|
Aaron David Fairbanks
|
| |
|
|
| |
|
| BP951 |
| Process described leaves some inputs invariant vs. no output will resemble its input. |
|
| |
|
|
|
|
COMMENTS
|
There are many ambiguities here. The solver is expected to determine what things are "allowed" to be inputs for each process. To avoid confusion examples should not be sorted differently if you consider inputting nothing.
In each example there is at least some overlap between the set of possible inputs and the set of possible outputs for each process. If we did not apply this constraint, an easy example to be sorted right would be a process that turns blue shapes red.
A harder-to-read but more clearly defined version of this Problem could include within each example a mini Bongard Problem sorting left all allowed inputs for the process. |
|
|
REFERENCE
|
https://en.wikipedia.org/wiki/Fixed_point_(mathematics) |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP946 BP947 BP948 BP949 BP950 * BP952 BP953 BP954 BP955 BP956
|
|
|
KEYWORD
|
structure, rules, miniworlds
|
|
|
CONCEPT
|
function (info | search)
|
|
|
AUTHOR
|
Leo Crabbe
|
| |
|
|
| |
|
| BP949 |
| Two unique distances between points vs. three unique distances between points. |
|
| |
|
| |
| |
|
|
| |
|
| BP946 |
| Can be constructed using 2 identical copies of an image (full overlapping not allowed) vs. not so. |
|
| |
|
|
|
|
COMMENTS
|
"Full overlapping not allowed" means you cannot overlay an image onto itself without moving it; if this were allowed all images would be sorted on the left. The copies can be moved around (translated) in 2D but can not be flipped or rotated.
There are examples on the right drawn with thick lines, and these could be created by copying an image with slightly thinner lines and moving it over a tiny amount. If you fix this issue by saying "the copy has to be moved over more than a tiny amount" then the Bongard Problem is perfect but not precise, but if you fix this issue by saying "interpret the figures as made up of (infinitesimally) thin lines" then it's precise but not perfect. - Aaron David Fairbanks, Jun 17 2023 |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP941 BP942 BP943 BP944 BP945 * BP947 BP948 BP949 BP950 BP951
|
|
|
KEYWORD
|
nice, notso, creativeexamples
|
|
|
AUTHOR
|
Leo Crabbe
|
| |
|
|
| |
|
| BP945 |
| Cube number of dots vs. non-cube number of dots. |
|
| |
|
| |
| |
|
|
| |
|
| BP944 |
| Image of Bongard Problem that would sort ANY image of a valid Bongard Problem on one of its sides vs. image of Bongard Problem whose categorization of a BP image would depend on the solution or examples in it. |
|
| |
|
|
|
|
COMMENTS
|
"Any" here means any image of a Bongard Problem in the relevant format, i.e. with white background, black vertical dividing line, and examples in boxes on either side.
All examples shown in this Problem clearly sort themselves on the left or right.
A self-referential but maybe simpler solution is "would sort all examples in this whole Bongard Problem on one of its sides vs. not so." Users adding examples please try to maintain this: for any example you add to the right of this Bongard Problem, make sure it does not sort all the other examples in this Bongard Problem on just one of its sides. - Aaron David Fairbanks, Aug 26 2020 |
|
|
CROSSREFS
|
Adjacent-numbered pages:
BP939 BP940 BP941 BP942 BP943 * BP945 BP946 BP947 BP948 BP949
|
|
|
KEYWORD
|
hard, challenge, presentationinvariant
|
|
|
WORLD
|
boxes_bpimage_sorts_self [smaller | same | bigger]
zoom in left | zoom in right
|
|
|
AUTHOR
|
Jago Collins
|
| |
|
|
| |
|
| BP942 |
| Square bounding box vs. oblong rectangular bounding box. |
|
| |
|
| |
| |
| |
|
|
|
|
|
|
|
|
