Re: VMs: Criteria for a successful solution

[VMs Archive <vms-archive@xxxxxxxxxxx>]

elvogt@xxxxxxxxxxx wrote:
> Likewise, it's impossible to prove (in the strict sense) the Gibberish 
> hypothesis: Even if you refuted 100 encoding schemes, the 101st one might still 
> turn out to be the solution.

It depends on the gibberish.  The canonical example in my own experience
is the first Beale Cipher: it should have been random gibberish when
decrypted with what should be the wrong key, but it turns out to produce
consistent non-random gibberish, which demonstrates that this non-random
gibberish was in fact encrypted with that "wrong" key.

If there is underlying gibberish in the Voynich and we can "decrypt" well
enough to demonstrate that this gibberish was structured and intentional,
then the gibberish hypothesis can be proven.

	Jim Gillogly
______________________________________________________________________
To unsubscribe, send mail to majordomo@xxxxxxxxxxx with a body saying:
unsubscribe vms-list