login
Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)
Search: +ex:BP1200
Displaying 1-5 of 5 results found.     page 1
     Sort: id      Format: long      Filter: (all | no meta | meta)      Mode: (words | no words)
BP508 Bongard Problems with precise definitions vs. Bongard Problems with vague definitions.
BP1
BP3
BP4
BP6
BP13
BP23
BP31
BP67
BP72
BP103
BP104
BP210
BP292
BP312
BP321
BP322
BP324
BP325
BP329
BP334
BP344
BP348
BP367
BP368
BP376
BP384
BP386
BP389
BP390
BP391
BP523
BP527
BP557
BP558
BP559

. . .

BP2
BP9
BP10
BP11
BP12
BP14
BP62
BP119
BP148
BP364
BP393
BP505
BP508
BP509
BP511
BP524
BP571
BP813
BP847
BP865
BP894
BP895
BP939
BP1002
BP1111
BP1158
(edit; present; nest [left/right]; search; history)
COMMENTS

Bongard Problems sorted left have the keyword "precise" on the OEBP.

Bongard Problems sorted right have the keyword "fuzzy" on the OEBP.


In an precise Bongard Problem, any relevant example is either clearly sorted left, clearly sorted right, or clearly not sorted.

(All relevant examples clearly sorted either left or right is the keyword allsorted.)


How can it be decided whether or not a rule is precise? How can it be decided whether or not a rule classifies all "examples that are relevant"? There needs to be another rule to determine which examples the original rule intends to sort. Bongard Problems by design communicate ideas without fixing that context ahead of time. The label "precise" can only mean a Bongard Problem's rule seems precise to people who see it. (This "precise vs. fuzzy" Bongard Problem is fuzzy.)


In an precise "less than ___ vs. greater than ___" Bongard Problem (keyword spectrum), the division between the sides is usually an apparent threshold. For example, there is an intuitive threshold between acute and obtuse angles (see e.g. BP292).


As a rule of thumb, do not consider imperfections of hand drawn images (keyword ignoreimperfections) when deciding whether a Bongard Problem is precise or fuzzy. Just because one can draw a square badly does not mean "triangle vs. quadrilateral" (BP6) should be labelled fuzzy; similar vagueness arises in all hand-drawn Bongard Problems. (For Bongard Problems in which fine subtleties of drawings, including small imperfections, are meant to be considered, use the keyword perfect.)


Sometimes the way a Bongard Problem would sort certain examples is an unsolved problem in mathematics. (See e.g. BP820.) There is a precise criterion that has been used to verify each sorted example fits where it fits (some kind of mathematical proof); however, where some examples fit is still unknown. Whether or not such a Bongard Problem should be labelled "precise" might be debated.

(Technical note: some properties are known to be undecidable, and sometimes the decidability itself is unknown. See https://en.wikipedia.org/wiki/Decision_problem .)

(See the keyword proofsrequired.)

One way to resolve this ambiguity is to define "precise" as meaning that once people decide where an example belongs for a reason, they will all agree about it.


Sometimes the class of all examples in a Bongard Problem is imprecise, but, despite that, the rule sorting those examples is precise. Say, for some potential new example, it is unclear whether it should be included in the Bongard Problem at all, but, if it were included, it would be clear where it should be sorted (or that it should be left unsorted). A Bongard Problem like this can still be tagged "precise".

(If all examples are clearly sorted except for some example for which it is unclear whether it belongs to the class of relevant examples, the situation becomes ambiguous.)

On the other hand, sometimes the class of all examples is very clear, with an obvious boundary. (Keyword preciseworld.)


There is a subtle distinction to draw between Bongard Problems that are precise to the people making them and Bongard Problems that are precise to the people solving them. A Bongard Problem (particularly a non-allsorted one) might be labeled "precise" on the OEBP because the description and the listed ambiguous examples explicitly forbid sorting certain border cases; however, someone looking at the Bongard Problem without access to the OEBP page containing the definition would not be aware of this. It may or may not be obvious that certain examples were intentionally left out of the Bongard Problem. A larger collection of examples may make it more clear that a particularly blatant potential border case was left out intentionally.

CROSSREFS

See BP876 for the version with pictures of Bongard Problems instead of links to pages on the OEBP.

See both and neither for specific ways an example can be classified as unsorted in an "precise" Bongard Problem.

Adjacent-numbered pages:
BP503 BP504 BP505 BP506 BP507  *  BP509 BP510 BP511 BP512 BP513

KEYWORD

fuzzy, meta (see left/right), links, keyword, right-self, sideless

WORLD

bp [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

BP563 Bongard Problems such that there is a way of making an infinite list of all relevant possible left-sorted examples vs. Bongard Problems where there is no such way of listing all left-sorted examples.
BP386
BP394
BP904
BP922
BP926
BP931
BP956
BP997
BP1057
BP1072
BP1146
BP1148
BP1149
BP1150
BP1197
BP1199
BP1200
BP1201
BP319
BP345
BP351
BP559
BP818
?
BP329
(edit; present; nest [left/right]; search; history)
COMMENTS

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


All the possible left examples for the BPs on the left side of this problem could be listed in one infinite sequence. Right examples here are Problems for which no such sequence can exist.


This depends on deciding what images should be considered "the same thing", which is subjective and context-dependent.


All examples in this Bongard Problem have an infinite left side (they do not have the keyword left-finite).


The mathematical term for a set that can be organized into an infinite list is a "countably infinite" set, as opposed to an "uncountably infinite" set.

Another related idea is a "recursively enumerable" a.k.a. "semi-decidable" set, which is a set that a computer program could list the members of.

The keyword "left-listable" is meant to be for the more general idea of a countable set, which does not have to do with computer algorithms.


Note that this is not just BP940 (right-listable) flipped.


It seems in practice, Bongard Problems that are left-listable are usually also right-listable because the whole class of relevant examples is listable. A keyword for just plain "listable" may be more useful. Or instead keywords for left- versus right- semidecidability, in the sense of computing. - Aaron David Fairbanks, Jan 10 2023

REFERENCE

https://en.wikipedia.org/wiki/Countable_set

CROSSREFS

See left-finite, which distinguishes between a finite left side and infinite left side.


"Left-listable" BPs are typically precise.

Adjacent-numbered pages:
BP558 BP559 BP560 BP561 BP562  *  BP564 BP565 BP566 BP567 BP568

KEYWORD

math, meta (see left/right), links, keyword

WORLD

bp_infinite_left_examples [smaller | same | bigger]
zoom in right (left_uncountable_bp)

AUTHOR

Leo Crabbe

BP940 Bongard Problems such that there is a way of making an infinite list of all relevant possible right-sorted examples vs. Bongard Problems where there is no such way of listing all right-sorted examples.
BP386
BP394
BP904
BP926
BP931
BP956
BP997
BP1057
BP1072
BP1148
BP1149
BP1150
BP1199
BP1200
BP1201
BP91
BP329
BP351
BP538
BP559
BP593
BP801
BP902
BP920
(edit; present; nest [left/right]; search; history)
COMMENTS

Left-sorted Problems have the keyword "right-listable" on the OEBP.


BPs are sorted based on how BP563 (left-listable) would sort them were they flipped; see that page for a description.

CROSSREFS

See right-finite, which distinguishes between finite right side and infinite right side.

Adjacent-numbered pages:
BP935 BP936 BP937 BP938 BP939  *  BP941 BP942 BP943 BP944 BP945

KEYWORD

meta (see left/right), links, keyword

WORLD

bp_infinite_right_examples [smaller | same | bigger]
zoom in right (right_uncountable_bp)

AUTHOR

Leo Crabbe

BP1125 BP pages on the OEBP (with a criterion for sorting examples that in some cases may be very difficult to work out) where users should be certain (i.e. know a proof) about how examples are sorted vs. users can include examples on a side as long as nobody has seen a reason it does not fit there.
BP335
BP344
BP532
BP850
BP1119
BP1137
BP1200
BP1245
(edit; present; nest [left/right]; search; history)
COMMENTS

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

Right-sorted Bongard Problems have the keyword "noproofs" on the OEBP.


For every "noproofs" Bongard Problem there could be made a stricter "proofsrequired" version. This stricter version will be hardsort.


Deciding to make a Bongard Problem noproofs adds subjectivity to the sorting of examples (keyword subjective).



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 restricting to just the cases where a property is observably true (i.e. "proofsrequired") corresponds to taking the topological "interior" of that property.



TO DO: It may be better to split each of these keywords up into two: "left-proofsrequired", "right-proofsrequired", "left-noproofs", "right noproofs".


CROSSREFS

See keyword hardsort.


Bongard Problems that are left-unknowable or right-unknowable will have to be "noproofs".

Adjacent-numbered pages:
BP1120 BP1121 BP1122 BP1123 BP1124  *  BP1126 BP1127 BP1128 BP1129 BP1130

EXAMPLE

In "proofsrequired" BP335 (shape tessellates the plane vs. shape does not tessellate the plane), shapes are only put in the Bongard Problem if they are known to tessellate or not to tessellate the plane. A "noproofs" version of this Bongard Problem would instead allow a shape to be put on the right if it was just (subjectively) really hard to find a way of tessellating the plane with it.

KEYWORD

meta (see left/right), links, keyword, oebp, instruction

AUTHOR

Aaron David Fairbanks

BP1128 Bongard Problem with inductive definition of solution vs. other Bongard Problems.
BP956
BP1129
BP1200
(edit; present; nest [left/right]; search; history)
COMMENTS

Bongard Problems sorted left have the keyword "inductivedefinition" on the OEBP.


An inductive definition is like, "Call certain basic objects 'blurps', and call combinations of blurps 'blurps' too."

CROSSREFS

Adjacent-numbered pages:
BP1123 BP1124 BP1125 BP1126 BP1127  *  BP1129 BP1130 BP1131 BP1132 BP1133

KEYWORD

meta (see left/right), links, keyword

WORLD

bp [smaller | same | bigger]

AUTHOR

Aaron David Fairbanks

    page 1

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