The On-Line Encyclopedia of Bongard Problems

Search: keyword:structure

Displaying 51-52 of 52 results found.

( prev ) page 1 2 3 4 5 6

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

Dots Bongard Problem vs. nothing.

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

	CROSSREFS	`Adjacent-numbered pages: BP1038 BP1039 BP1040 BP1041 BP1042 * BP1044 BP1045 BP1046 BP1047 BP1048`
	KEYWORD	`less, precise, allsorted, notso, meta (see left/right), miniproblems, example, assumesfamiliarity, structure, preciseworld, presentationinvariant`
	WORLD	`boxes_dots_bpimage_clear_set_of_numbers [smaller \| same \| bigger] zoom in right (nothing)`
	AUTHOR	`Aaron David Fairbanks`

Valid multi-sided Bongard Problems vs. invalid multi-sided Bongard Problems.

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

	COMMENTS	`This is a generalisation of Bongard Problems that allows them to have any number of sides. There is a sense in which this problem is about valid vs. invalid ways of partitioning a set of examples into equivalence classes.`
	CROSSREFS	`https://en.wikipedia.org/wiki/Equivalence_class` `Adjacent-numbered pages: BP1148 BP1149 BP1150 BP1151 BP1152 * BP1154 BP1155 BP1156 BP1157 BP1158`
	KEYWORD	`abstract, teach, meta (see left/right), miniproblems, infodense, structure, rules, miniworlds`
	WORLD	`zoom in left`
	AUTHOR	`Leo Crabbe`

( prev ) page 1 2 3 4 5 6

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