Computation of the 4th and 5th Fibonacci numbers. The visualisation takes 5-10 min to finish. Let it unroll, then scroll further.
As in the demo about a factorial computation, here is simulated a 2 inputs, 2 outputs function, namely (a,b) - - > (b, a+b). There is a graph which expresses this, which is then "abstracted" (i.e. linked to two abstraction nodes), then a Church number n is applied and all is applied to two Church numbers 1. Finally, the free out nodes are applied to successor graphs and then to Church numbers 0. This is the same approach as the one used for the factorial, actually the mol file used here (fibo.mol) is a modification of the file lisfact_2_mod.mol. The number n=4 makes that eventually the computation will give two numbers, 5 and 8, which represent the 4th and 5th Fibonacci numbers.
I used the same script as the one from the busy beaver demos (see further). 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; ).
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 "fibo.mol". You shall get the file fibo.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 fibo.mol. You can also open it with a text editor and play with it.
