News for hackers. Stuff that matters.
Re:Markov Chains Explained by wlievens on Sunday July 06, 2014 @02:27AM (#7993926)
But a file system forms a tree whereas a Markov chain is a directed graph, cycles allowed. Or are you thinking of a file system with cyclical symlinks?
Re:Markov Chains Explained by e12e on Sunday July 06, 2014 @07:50AM (#7994296)
As I understand it you would have, as an example (example as a cycle):

    file: As
    contains: I an a

    file: an
    contains: example

    file: example
    contains: example as
Here "as" points to "example", and "example" points to "example" and to "as". You have your cycle: pick a random file (get example) pick a random word (get as), lookup as (open the "as"-file), pick a random word (get "as" again, then "an" then "example" … ).

No links needed, the words are the links -- for US English, and words no longer that 8 characters, you could this on FAT16.

(The files are vertices, and they contain a list of edges to other vertices, in the form of the name of the vertices).

Re:Markov Chains Explained by jimmaswell on Sunday July 06, 2014 @10:05AM (#7994547)
Yeah, that's how I had it. Newlines separating the words, and the chars that can't go in the filesystem get escaped to base64 or something.