Need advice for testing of hypotheses related to the self-citation method

[oshfdk]

So even if there exists an input bit sequence (coin toss outcomes) that causes  SCM to output an exact copy of the VMS (which I doubt, but let's assume it does), in order to show that the VMS "has no meaning" one would have to show that this magical bit sequence is not a meaningful message.

There are two "little" problems with this that make it impossible:
1) Thinking in terms of bits and transducers would be anachronistic at a time when cryptography was at the mono-alphabetic substitution (with homophones and nulls) stage,
2) The bit sequence would need to be reconstructed from the VMS in order to recover the message. With multiple possible sources for each target word of the SCM it can't be done. You can't unscramble eggs.

We can replace bits with coin tosses and transducers with whatever concept similar to transducers existed in the XV century. I don't know what transducers are anyway.

As for the unscrambability of the cipher, the below is a very simple (although quite verbose) self-citation cipher based on Voynich script. I think it is readable. Usual disclaimer: I don't think this is how VMS is encoded.

   

This scheme is a pain to encode/decode, and I guess it's much more complicated than the actual cipher of the Voynich manuscript, but it shows that in principle it doesn't take advanced tech to encode text via self-citation.