Editing 688: Self-Description

Jump to: navigation, search

Warning: You are not logged in. Your IP address will be publicly visible if you make any edits. If you log in or create an account, your edits will be attributed to your username, along with other benefits.

The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then save the changes below to finish undoing the edit.
Latest revision Your text
Line 16: Line 16:
 
The third panel features a {{w|scatter plot}} labeled "Location of black ink in this image." It is the first {{w|Quadrant (plane geometry)|quadrant}} of a {{w|Cartesian coordinate system|cartesian plane}} with the zeroes marked. The graph is the whole comic scaled proportionally to fit the axes, so the last panel also has to contain an image of itself having an image of itself ad infinitum thus displaying the {{w|Droste effect}}, a type of visual {{w|recursion}}.
 
The third panel features a {{w|scatter plot}} labeled "Location of black ink in this image." It is the first {{w|Quadrant (plane geometry)|quadrant}} of a {{w|Cartesian coordinate system|cartesian plane}} with the zeroes marked. The graph is the whole comic scaled proportionally to fit the axes, so the last panel also has to contain an image of itself having an image of itself ad infinitum thus displaying the {{w|Droste effect}}, a type of visual {{w|recursion}}.
  
βˆ’
The title text refers to the comic's own self-reference, but it is also self-referencing because of the character count in it. It would be difficult to write this sentence, as just one more character would not be solved by writing 243, as "three" has two more characters than "two", and "four" has only one more character...
+
The title text refers to the comic's own self-reference, but it is also self-referencing because of the character count in it. It would be difficult to write this sentence, as just one more character would not be solved by writing 243, as three has two more than two, and four has only one more...
  
 
"The graph of panel dependencies is complete and bidirectional, and every node has a loop." This means that if we draw a dot corresponding to each panel, and then we draw arrows connecting the dots to indicate dependencies, the resulting {{w|Graph (discrete mathematics)|graph}} is {{w|complete graph|complete}} (meaning that all the points are connected to one another) and bidirectional (meaning that if point A has an arrow to point B, then point B also has an arrow to point A). "Every node has a loop" means that each point also has an arrow connecting to itself.
 
"The graph of panel dependencies is complete and bidirectional, and every node has a loop." This means that if we draw a dot corresponding to each panel, and then we draw arrows connecting the dots to indicate dependencies, the resulting {{w|Graph (discrete mathematics)|graph}} is {{w|complete graph|complete}} (meaning that all the points are connected to one another) and bidirectional (meaning that if point A has an arrow to point B, then point B also has an arrow to point A). "Every node has a loop" means that each point also has an arrow connecting to itself.

Please note that all contributions to explain xkcd may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see explain xkcd:Copyrights for details). Do not submit copyrighted work without permission!

To protect the wiki against automated edit spam, we kindly ask you to solve the following CAPTCHA:

Cancel | Editing help (opens in new window)