…yes? Well, at least there’s valid definitions of “analogous” that make this true: Hypertext links form a directed graph, loops form, well, cycles in that graph, and executions of game of life can be mapped onto a directed graph, and that graph can contain cycles, just as with hyperlinks without any out-edges escaping those cycles. Executions, plural, if you only use one the graph will have only one out-edge per node and either be infinite, or have one back-edge. Rather degenerate, you’d call it a (repeating) sequence instead of a graph to not make things unnecessarily complicated.
Not very meaningful though as wikipedia articles and game of life aren’t isomorphic, at least to my knowledge. If they were isomorphic you’d actually have interesting mathematics at hand.
They’re both… terminally loopy graphs, that’s it (I just made up that term there’s probably a proper one).
…yes? Well, at least there’s valid definitions of “analogous” that make this true: Hypertext links form a directed graph, loops form, well, cycles in that graph, and executions of game of life can be mapped onto a directed graph, and that graph can contain cycles, just as with hyperlinks without any out-edges escaping those cycles. Executions, plural, if you only use one the graph will have only one out-edge per node and either be infinite, or have one back-edge. Rather degenerate, you’d call it a (repeating) sequence instead of a graph to not make things unnecessarily complicated.
Not very meaningful though as wikipedia articles and game of life aren’t isomorphic, at least to my knowledge. If they were isomorphic you’d actually have interesting mathematics at hand.
They’re both… terminally loopy graphs, that’s it (I just made up that term there’s probably a proper one).