See keyword @hardsort.

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

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".

See keyword @hardsort".

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

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" (right-BP864).

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

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".

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" (right-BP864).

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

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.

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" (right-BP864).

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

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 "interior" of that property.

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" (right-BP864).

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

See keyword "hardsort" (right-BP864).

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

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" (right-BP864).

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

TO DO: It's worth thinking about which side people naturally consider the burden of proof to be on.

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.

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 (e.g. 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.

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. Furthermore this stricter version will be "hardsort" (right-BP864).

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

TO DO: It's worth thinking about which side people naturally consider the burden of proof to be on.

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. Furthermore this stricter version will be "hardsort" (right-BP864).

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

TO DO: It's worth looking into which side people naturally consider the burden of proof to be on.

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. Furthermore this stricter version will be "hardsort" (right-BP864).

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

TO DO: It seems worth investigating about which side people naturally consider the burden of proof to be on. - Aaron David Fairbanks, May 05 2021