The On-Line Encyclopedia of Bongard Problems

Search: user:Jago Collins

Displaying 31-40 of 44 results found.

( prev | next ) page 1 2 3 4 5

Sort: recent Format: long Filter: (all | no meta | meta) Mode: (words | no words)

Meta Bongard Problems that sort Bongard Problems based on other information than just their solutions (e.g. what format the Bongard Problem is, or what specific examples are shown in it) vs. Meta Bongard Problems that sort Bongard Problems purely based on solution.

	BP504	BP793	BP795	BP802	BP803	BP827
	BP831	BP834	BP871	BP872	BP894	BP1150

BP200	BP796	BP829	BP830	BP832	BP833
BP835	BP836	BP868	BP873	BP874	BP875
BP876	BP877	BP878	BP879	BP880	BP881
BP895	BP927	BP944	BP948	BP952	BP954
BP987	BP1024	BP1025	BP1026	BP1027	BP1028
BP1029	BP1030	BP1031	BP1032	BP1033	. . .

?
BP828

(edit; present; nest [left/right]; search; history)

	COMMENTS	`Left-sorted Bongard Problems have the keyword "presentationmatters" on the OEBP.` `Right-sorted Bongard Problems have the keyword "presentationinvariant" on the OEBP.` `Meta Bongard problems that sort Bongard Problems purely based on their solutions usually have two versions in the database: one that sorts images of Bongard Problems and one that sorts links to pages on the OEBP. If both versions exist, users should make them cross-reference one another. (Meta Bongard Problems that sort images of Bongard Problems have the keyword miniproblems, whereas meta Bongard Problems that sort links to OEBP pages have the keyword links.)` `For meta-pages on the OEBP that sort other pages on the OEBP (keyword links), "presentationmatters" means factoring in content like the BP number, the currently uploaded examples, the wording of the title, the description, and so on, rather than just the solution (that is, how the page would sort all potential examples). This is unusual.` `"One solution vs. multiple solutions" (BP828) seems like a border-case. - Aaron David Fairbanks, Aug 01 2020`
	CROSSREFS	`See BP1010 (projectionmatters versus 3d) for a similar idea: there 2D representations are to 3D objects as here Bongard Problems are to Bongard Problem solutions.` `Adjacent-numbered pages: BP890 BP891 BP892 BP893 BP894 * BP896 BP897 BP898 BP899 BP900`
	KEYWORD	`fuzzy, meta (see left/right), links, keyword, right-self, sideless, metameta, right-it, dependence, presentationinvariant`
	WORLD	`metabp [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP551

Unstable balance vs. not

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Stability_theory`
	CROSSREFS	`Adjacent-numbered pages: BP546 BP547 BP548 BP549 BP550 * BP552 BP553 BP554 BP555 BP556`
	EXAMPLE	`The classic example is a pendulum with a solid rod (instead of a string) which has a stable balance point at the bottom of its swing, where if you move the pendulum slightly it will swing back towards that balanced state. However, theoretically the pendulum can also be balanced pointing directly up. In this case, if you move the pendulum slightly it will swing down away from that upwards balanced state.`
	KEYWORD	`updown, rotate, physics, anticomputer, perfect`
	CONCEPT	`tumbles_or_stays_put (info \| search),` `gravity (info \| search)`
	AUTHOR	`Jago Collins`

BP540

Objects define a map from the top row of boxes to the bottom row of boxes vs. not so.

(edit; present; nest [left/right]; search; history)

	REFERENCE	`https://en.wikipedia.org/wiki/Map_(mathematics)`
	CROSSREFS	`Adjacent-numbered pages: BP535 BP536 BP537 BP538 BP539 * BP541 BP542 BP543 BP544 BP545`
	AUTHOR	`Jago Collins`

BP394

For each colored square only, there exists a path starting on it that covers each square of the figure exactly once vs. there is no path that starts on a colored square and covers each square of the figure exactly once.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP389 BP390 BP391 BP392 BP393 * BP395 BP396 BP397 BP398 BP399`
	KEYWORD	`hard, nice, solved, traditional, dithering, left-listable, right-listable`
	CONCEPT	`existence (info \| search),` `path (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search)`
	AUTHOR	`Jago Collins`

BP393

Correct vs. incorrect.

(edit; present; nest [left/right]; search; history)

	COMMENTS	`"True" vs. "false."`
	CROSSREFS	`Adjacent-numbered pages: BP388 BP389 BP390 BP391 BP392 * BP394 BP395 BP396 BP397 BP398`
	KEYWORD	`nice, fuzzy, abstract, collective, contributepairs, traditional, rules, miniworlds, dithering`
	CONCEPT	`categorization (info \| search),` `true_false (info \| search)`
	AUTHOR	`Jago Collins`

BP392

Exponential increase vs. linear increase.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP387 BP388 BP389 BP390 BP391 * BP393 BP394 BP395 BP396 BP397`
	KEYWORD	`contributepairs, traditional`
	CONCEPT	`acceleration (info \| search),` `exponential (info \| search)`
	AUTHOR	`Jago Collins`

BP391

There exists an edge such that removing it yields two disconnected graphs (i.e., the minimum number of edges whose removal results in two disconnected graphs is 1) vs. the minimum number of edges whose removal results in two disconnected graphs is 2.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP386 BP387 BP388 BP389 BP390 * BP392 BP393 BP394 BP395 BP396`
	KEYWORD	`nice, precise, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `distinguishing_crossing_curves (info \| search),` `existence (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP390

Each graph vertex is uniquely defined by its connections (the graph does not admit nontrivial automorphisms) vs. the graph admits nontrivial automorphisms.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP385 BP386 BP387 BP388 BP389 * BP391 BP392 BP393 BP394 BP395`
	KEYWORD	`precise, allsorted, notso, traditional, preciseworld`
	CONCEPT	`graph (info \| search),` `self-reference (info \| search),` `topological_transformation (info \| search),` `imagined_shape (info \| search),` `imagined_entity (info \| search)`
	WORLD	`connected_graph [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP389

Loops are entangled (in 3-D) vs. loops can be separated (in 3-D).

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`Adjacent-numbered pages: BP384 BP385 BP386 BP387 BP388 * BP390 BP391 BP392 BP393 BP394`
	KEYWORD	`nice, precise, allsorted, contributepairs, traditional`
	CONCEPT	`knot (info \| search),` `topological_transformation (info \| search),` `imagined_motion (info \| search),` `motion (info \| search)`
	WORLD	`link_two_knots [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

BP388

White dot can see (in straight lines) all black points vs. white dot cannot see (in straight lines) all black points.

(edit; present; nest [left/right]; search; history)

	CROSSREFS	`See BP368 for whether ALL points can see all points.` `Adjacent-numbered pages: BP383 BP384 BP385 BP386 BP387 * BP389 BP390 BP391 BP392 BP393`
	KEYWORD	`nice, traditional`
	CONCEPT	`all (info \| search),` `imagined_line_or_curve (info \| search),` `imagined_entity (info \| search)`
	WORLD	`fill_shape_white_dot [smaller \| same \| bigger]`
	AUTHOR	`Jago Collins`

( prev | next ) page 1 2 3 4 5

		Hints
(Greetings from The On-Line Encyclopedia of Bongard Problems!)