11-24-2016, 04:00 PM
The best64.rule set is small enough to examine by eye.
"Append" rules like $0 will always change the input word.
But "overwrite" rules like the o0d above won't change the input word if it already begins with "d".
Why have the unchanged word waste the time going throught ten thousand spins when it could be rejected and move on to the next input word?
Similarly "replace" rules like se3 will leave input words with "e" in them unchanged.
For "slow" algorithms there is a time payoff in rejecting unchanged words.
"Append" rules like $0 will always change the input word.
But "overwrite" rules like the o0d above won't change the input word if it already begins with "d".
Why have the unchanged word waste the time going throught ten thousand spins when it could be rejected and move on to the next input word?
Similarly "replace" rules like se3 will leave input words with "e" in them unchanged.
For "slow" algorithms there is a time payoff in rejecting unchanged words.