I thought i had posted already

Acronym trees. How do they work as hashes and as not hashes but hierarchies most like hidden Markov probabilities? But also not. Looking for a lively discussion when I can return soon I gotta work out to free my mind on this subject. Also Monte Carlo infallibility what's that about? How are the two related and why or why not and/or both?