Don't miss the comments. Particularly Tor Hovland's hint about the size of k, and David Turner's "spoiler." The Wikipedia article [1] demystify's it completely.
This isn't a true self-referential graph because k actually encodes the graph, the formula simply iterates over every possible bitmap with a certain height.
A truly self-referential graph would also include the coordinates of itself in the graph.
4 comments
[ 5.9 ms ] story [ 40.9 ms ] thread[1] https://en.wikipedia.org/wiki/Tupper%27s_self-referential_fo...
A truly self-referential graph would also include the coordinates of itself in the graph.