Show HN: Most Wikipedia articles lead to the same loop
151–160 of 171 posts
Re: Show HN: Most Wikipedia articles lead to the same loop
#152From a mathematical perspective, this is actually not that surprising. Think of the act of clicking the first link in the Wikipedia article as a function that takes in the page you're on and outputs another page. If you call this function on itself over and over again (ie use the output of one step as in the input of the next step), you will eventually enter a loop. The proof of this is simple: there are only a finit…
Without more information, I don't think this is true. It is true if the transition function between states depends on a finite number of previous ones (WLOG if s_n is a function of only s_{n-1}), but I think that it isn't if the transition depends on an infinite number.
(Though, in this case, clearly there is no history, so what you say is true.)
Re: Show HN: Most Wikipedia articles lead to the same loop
#153From a mathematical perspective, this is actually not that surprising. Think of the act of clicking the first link in the Wikipedia article as a function that takes in the page you're on and outputs another page. If you call this function on itself over and over again (ie use the output of one step as in the input of the next step), you will eventually enter a loop. The proof of this is simple: there are only a finit…
This is the same reason systems with a finite number of states cannot be chaotic Without more information, I don't think this is true. It is true if the transition function between states depends on a finite number of previous ones (WLOG if s_n is a function of only s_{n-1}), but I think that it isn't if the transition depends on an infinite number. (Though, in this case, clearly there is no history, so what you say…
In the case of depending on up to an infinite history, I wouldn't call that system to have a finite number of states any longer.
Re: Show HN: Most Wikipedia articles lead to the same loop
#154Either philosophy is a dead end, then, or it is the base of all knowledge. Depends on whether knowledge is a tree or a graph, which is... a philosophical question! My brain exploded.
Trees are connected acyclic graphs, so knowledge could be both. ;)
Re: Show HN: Most Wikipedia articles lead to the same loop
#155We used to play this as a game back in high school. First one to find the loop won.
Re: Show HN: Most Wikipedia articles lead to the same loop
#156From a mathematical perspective, this is actually not that surprising. Think of the act of clicking the first link in the Wikipedia article as a function that takes in the page you're on and outputs another page. If you call this function on itself over and over again (ie use the output of one step as in the input of the next step), you will eventually enter a loop. The proof of this is simple: there are only a finit…
E.g.
A fish is any member of a paraphyletic group of organisms that consist of all gill-bearing aquatic craniate animals that lack limbs with digits.
Google Inc. (NASDAQ: GOOG) is an American _multinational corporation_ which provides Internet-related products and services [...]
A table is a form of _furniture_ with a flat and satisfactory horizontal upper surface [...]
And so on. If you always walk up the abstraction chain because you're picking the first link (the general category), you'll end up at the root of the categorization tree, which is likely something along the lines of Argument, Logic, Fact etc.
Note however that the current state of wikipedia has a different root loop for me, Logic leads to Philosophy.
(1) or one of a very limited number of loops, I also saw Science Knowledge.
Re: Show HN: Most Wikipedia articles lead to the same loop
#157I seem to have broken it here: http://wikiloopr.com/List%20of%20minor%20planets:%2075001%E2... Wikipedia page: http://en.wikipedia.org/wiki/List_of_minor_planets:_75001%E2... That is, however, a weird Wikipedia page. It seems like the first link is a target to another location on the page, which (I'd assume) would put it in an infinite loop.