Search

Markov Chains - anyone tested the method?Reply
Flabber First, I am not your mate.. whatever that implies. Second, your feelings seem to have been bruised so may I suggest a little corner time out. Markov chains, ie followers as you call them are very simple to generate for almost any data type. The steps are a base-10 to 3-digit code. Each digit 0 to 9 is coded into a specific code, example 212=5. The program first converts the actual line, ie set of numbers into it's lexicographical index. The index is zero padded so that it'
Jun 4, 2018, 4:41 am - RL-RANDOMLOGIC - Mathematics Forum