Search: all:new
|
|
Sort:
recent
Format:
long
Filter:
(all | no meta | meta)
Mode:
(words | no words)
|
|
|
|
|
BP525 |
| Some zoomed-in (cropped) version of an image of a hollow circle vs. not so. |
|
| |
|
|
|
|
|
BP524 |
| Same objects are shown lined up in both "universes" vs. the two "universes" are not aligned. |
|
| |
|
|
COMMENTS
|
All examples are black and white images, partitioned by lines such that crossing a line switches the background color and the foreground color. (Sometimes it is not clear which is "background" and which is "foreground".) In the space between two dividing lines, there is a black and white scene; the outlines of the shapes are curves dividing black from white. Images sorted left are such that each outline-curve present in a scene that comes in contact non-tangentially with a dividing line continues across the dividing line, across which the black and white sides of it switch.
Examples (especially right) usually have ambiguity to some degree; depending on how a person reads the images, dividing lines may be confused for curves within a scene. |
|
CROSSREFS
|
Adjacent-numbered pages:
BP519 BP520 BP521 BP522 BP523  *  BP525 BP526 BP527 BP528 BP529
|
|
KEYWORD
|
fuzzy, unwordable, anticomputer, traditional, blackwhiteinvariant
|
|
AUTHOR
|
Aaron David Fairbanks
|
|
|
|
|
BP523 |
| Same amount of black in any vertical slice vs. varying amounts of black in vertical slices. |
|
| |
|
|
|
|
|
BP505 |
| Number indicated on number line conceptually related to image shown below vs. not so. |
|
| |
|
|
|
|
|
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. |
|
| |
|
|
|
|
|
BP393 |
| Correct vs. incorrect. |
|
| |
|
|
|
|
|
BP392 |
| Exponential increase vs. linear increase. |
|
| |
|
|
|
|
|
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. |
|
| |
|
|
| |
|
|
|
|
|
|
|
|