Computing in Verotoxin.

We develop an excitable automata model of a protein verotoxin and demonstrate that logic gates and circuits are realised in the model via interacting patterns of excitation. By sampling potential input pairs of nodes, we calculate frequencies of logic gates which occurred in the verotoxin model for various parameters of node excitation rules. We show that overall the gates can be arranged in the following hierarchy of descending frequencies: AND>OR>AND-NOT>XOR. We demonstrate realisations of one-bit half-adder and controlled-not gates and estimate memory capacity of the verotoxin molecule.