In this model, imagine that all you had was a restriction that all things are combinations of a set, with N members. What is the lagest factorial expansion I can have before repeating myself. Energy is infinite,
In a self sampled world the number is n^n. I can make a factorial treat that expands out by n for n levels. In a self sampled binomial system that means 2*n coin tosses needed to match a fair coin. That puts the spot of maximum entropy at the mean. Also the spot on entropy maximizing processes.
No comments:
Post a Comment