The busy beaver Turing machine is taken as a generic TM. The remarkable thing happening here is this: without any higher control, asynchronously (here mimicked by randomness), one TM is multiplied into 3 TM while they all work, eventually on the same tape. No conflict appear!
Let me repeat: one computer, during its activity, is multiplied into 3 computers which work, in the same time. This feat is done without any higher control and there are never conflicts which appear. All computers work asynchronously and eventually they arrive to read and write on the same tape.
If you want tot experiment, then click on "fork me on github" and copy the gh-pages branch of the repo. Then look in the dynamic folder for the script moving_random_metabo_bb.sh. In a terminal type "bash moving_random_metabo_bb.sh", then type "church3bb.mol". You shall get the file church3bb.html which you can see by using a js enabled browser.
The sh script calls an awk script, which produces the html file. The awk script is check_1_mov2_rand_metabo_bb.awk. Open it with a text editor and you shall see at the beginning all kinds of parameters which you can change (before calling the sh script), so that you may alter the duration, the speed, change between deterministic and random algorithms.
Finally, you also need a mol file to play. For this demo has been used the mol file church3bb.mol. You can also open it with a text editor and play with it.
The algorithm has been run in the non deterministic regime ( wei_L3T=1;
wei_A3TFI3T=1;
wei_FO3T=1;
wei_FO2TFOET=1;
wei_FOFOE=1;
wei_LFOELFO=1;
wei_AFOAFOE=1;
wei_PROP=1;
wei_FIFO=1;
wei_FIFOE=1;
wei_AL=1;
wei_blank=1;
wei_head=0;
wei_turing=1;
).
