login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: keyword:dual
Displaying 41-50 of 58 results found. ( prev | next )     page 1 2 3 4 5 6
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP941 JPEG image vs. PNG image.
(edit; present; nest [left/right]; search; history)
COMMENTS

Evidently this solution is stretching the idea of what makes images "different". Each corresponding pair of panels would be parsed as identical in any other case. It is worth noting that if you view this Problem on a template, the solution no longer applies at all.

CROSSREFS

Adjacent-numbered pages:
BP936 BP937 BP938 BP939 BP940  *  BP942 BP943 BP944 BP945 BP946

KEYWORD

less, precise, dual, antihuman, contributepairs, invalid, experimental, funny

AUTHOR

Leo Crabbe

BP955 Images of Bongard Problems that sort an image of their left side on their left and an image of their right side on their left vs. images of Bongard Problems that sort an image of their left side on their right and an image of their right side on their right.
(edit; present; nest [left/right]; search; history)
CROSSREFS

See also BP957 for the other two evident possibilities.

Adjacent-numbered pages:
BP950 BP951 BP952 BP953 BP954  *  BP956 BP957 BP958 BP959 BP960

KEYWORD

abstract, dual, handed, leftright, solved, meta (see left/right), miniproblems, creativeexamples, assumesfamiliarity, structure, experimental

CONCEPT self-reference (info | search)

WORLD

oblong_boxes_bpimage_sorts_both_sides_skewed [smaller | same | bigger]
zoom in left (oblong_boxes_bpimage_sorts_both_sides_left) | zoom in right (oblong_boxes_bpimage_sorts_both_sides_right)

AUTHOR

Leo Crabbe

BP961 Includes itself on the left vs. includes itself on the right.
(edit; present; nest [left/right]; search; history)
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

BP962 White vs. black.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP957 BP958 BP959 BP960 BP961  *  BP963 BP964 BP965 BP966 BP967

KEYWORD

precise, allsorted, minimal, dual, blackwhite, gap, left-finite, right-finite, left-full, right-full, left-null, finished, preciseworld, unstableworld

WORLD

[smaller | same | bigger]
zoom in left (blank_image) | zoom in right (black_image)

AUTHOR

Leo Crabbe

BP971 Left half has more black (less white) than right half versus vice versa.
(edit; present; nest [left/right]; search; history)
COMMENTS

A similar, but different, solution is "center of mass is on the left half vs. center of mass is on the right half."

CROSSREFS

See BP972 for the version with examples rotated a quarter-turn.

Adjacent-numbered pages:
BP966 BP967 BP968 BP969 BP970  *  BP972 BP973 BP974 BP975 BP976

KEYWORD

nice, precise, spectrum, dual, handed, leftright, rotate, boundingbox, blackwhite, traditional, viceversa, absoluteposition, bordercontent

AUTHOR

Aaron David Fairbanks

BP972 Top half has more black (less white) than bottom half versus vice versa.
(edit; present; nest [left/right]; search; history)
COMMENTS

A similar, but different, solution is "center of mass is above the horizontal vs. center of mass is below the horizontal."

CROSSREFS

See BP971 for the version with examples rotated a quarter-turn.

Adjacent-numbered pages:
BP967 BP968 BP969 BP970 BP971  *  BP973 BP974 BP975 BP976 BP977

KEYWORD

precise, spectrum, dual, handed, updown, boundingbox, blackwhite, traditional, viceversa, absoluteposition, bordercontent

AUTHOR

Aaron David Fairbanks

BP1008 The 26th from the left, 63rd from the top pixel is black versus white.
(edit; present; nest [left/right]; search; history)
COMMENTS

This is a typical kind of joke answer people give for Bongard Problems when they cannot find an answer.

CROSSREFS

Adjacent-numbered pages:
BP1003 BP1004 BP1005 BP1006 BP1007  *  BP1009 BP1010 BP1011 BP1012 BP1013

KEYWORD

less, dual, arbitrary, handed, leftright, updown, boundingbox, blackwhite, antihuman, right-null, perfect, pixelperfect, help, experimental, funny, absoluteposition, bordercontent

CONCEPT specificity (info | search)

AUTHOR

Aaron David Fairbanks

BP1024 One sorted left vs. one sorted right.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1019 BP1020 BP1021 BP1022 BP1023  *  BP1025 BP1026 BP1027 BP1028 BP1029

KEYWORD

precise, allsorted, dual, handed, leftright, math, meta (see left/right), miniproblems, assumesfamiliarity, structure, preciseworld, presentationinvariant

WORLD

boxes_dots_bpimage_clear_set_of_numbers [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP1085 More triangles on the right vs. more triangles on the left.
(edit; present; nest [left/right]; search; history)
CROSSREFS

Adjacent-numbered pages:
BP1080 BP1081 BP1082 BP1083 BP1084  *  BP1086 BP1087 BP1088 BP1089 BP1090

KEYWORD

stub, dual, handed, leftright

AUTHOR

Aaron David Fairbanks

BP1124 Bongard Problems such that examples are always by default sorted left, until some unforeseen way of fitting right is noticed (a person is never "sure" something should fit left, but can be "sure" something fits right) vs. vice versa.
BP347
BP829
BP1127
BP801
BP1155
BP1163
(edit; present; nest [left/right]; search; history)
COMMENTS

Left-sorted Bongard Problems have the keyword "left-unknowable" on the OEBP.

Right-sorted Bongard Problems have the keyword "right-unknowable".


Think of searching for needles in endless haystacks. You can be sure a haystack has a needle by finding it, but you can never be sure a haystack does not have a needle.


When a Bongard Problem is "left-unknowable", individual examples cannot be determined for certain to fit left, by any means. The author of the Bongard Problem just chooses some examples that seem to fit left. (See also the noproofs keyword.)


It is very extreme for this to apply to all examples without exception. Often a Bongard Problem is close to being purely left-unknowable, but a few examples spoil it by being obviously disqualified from the right side for some reason.


It is natural for a person to guess the solution to an unknowable Bongard Problem before actually understanding all the knowable examples, taking some of them on faith.

As a prank, take a left- or right- unknowable Bongard Problem and put an example that actually belongs on the unknowable side on the knowable side. The solver will have to take it on faith there is some reason it fits there they are not seeing.

(The property of having this kind of sorting mistake is unknowable for left- or right- unknowable Bongard Problems.)



One interpretation of topology (a subject of mathematics -- see https://en.wikipedia.org/wiki/Topology ) is that a topology describes the observability of various properties. (The topological "neighborhoods" of a point are the subsets one could determine the point to be within using a finite number of measurements.) The analogue of a property that is nowhere directly observable is a "subset with empty interior". Furthermore, the fact that the negation of the property is observable corresponds to the subset being "closed".

CROSSREFS

Left- or right- unknowable Bongard Problems are generally notso Bongard Problems: an example fits on one side just in case it cannot be observed to fit on the other.


Although the descriptions of left-couldbe and right-couldbe sound similar to "left-unknowable" and "right-unknowable", they are not the same. It is the difference between a clear absence of information and perpetual uncertainty about whether there is more information to be found. For any example sorted on a "could be" side, there is a clear (knowable) absence of information whose presence would justify the example being on the other side.

Sometimes an unknowable BP can be turned into a couldbe BP by explicitly restricting the amount of available information. For example, if there were a hypothetical Bongard Problem with infinitely detailed pictures, using a low resolution for all pictures could simplify the issue of detecting some properties that would be "unknowable". Many fractal-based BPs are this way (e.g. BP1122). See keyword infinitedetail.


Right-unknowable Bongard Problems are generally left-narrow (and left-unknowable Bongard Problems are generally right-narrow).


A Bongard Problem with examples on both sides cannot be tagged both proofsrequired and left- or right- unknowable.


Many Bongard Problems are about finding rules (keyword rules)--in each panel a rule is to be found, and there are no specified limits about what kind of rule it can be or how abstract it can be. (Just like a Bongard Problem.) "There is a rule vs. there isn't" (resp. vice versa) are right- (resp. left-) unknowable. (That is, disregarding cases that obviously do not define a rule because of some trivial disqualifying reason.)


Actually, I think there is something more to be said about this. It is possible to design examples that signal there is no rule to be found. See for example EX9138 in BP1127 and EX6829 in BP829. (Related: keyword help.) Each of these examples communicates a clear rule that "doesn't count". And there is so little information shown that a person can feel confident they've noticed all the relevant details. So, contrary to how they are currently tagged, these Bongard Problems aren't strictly "unknowable"; there are some exceptional knowable cases. But being too strict about the definition of "unknowable" makes it so there aren't any examples of unknowable Bongard Problems, so it's probably better to be a bit loose. - Aaron David Fairbanks, Apr 20 2022

Adjacent-numbered pages:
BP1119 BP1120 BP1121 BP1122 BP1123  *  BP1125 BP1126 BP1127 BP1128 BP1129

EXAMPLE

The perfect example is BP1163.


Interesting example of a Bongard Problem that is neither left-unknowable nor right unknowable in particular, but for which it is impossible to know whether any example fits on either side: BP1229 (translational symmetry vs. not) made with examples that can be expanded to any larger finite region the solver wants to look at. In this case, examples could only be sorted based on what they seem like (see seemslike), trusting they appear in a way that hints psychologically at what they actually are (see help).

KEYWORD

dual, meta (see left/right), links, keyword, side, viceversa

CONCEPT semidecidable (info | search)

AUTHOR

Aaron David Fairbanks

( prev | next )     page 1 2 3 4 5 6

Welcome | Solve | Browse | Lookup | Recent | Links | Register | Contact
Contribute | Keywords | Concepts | Worlds | Ambiguities | Transformations | Invalid Problems | Style Guide | Goals | Glossary