In the paper I consider abstract machine of reaction-diffusion computing. This machine is constructed by using process algebra. Further, I propose proof-theoretic interpretation of process calculus within the framework of Belousov-Zhabotinsky reaction. I show that some proofs simulating the behaviour of Belousov-Zhabotinsky reaction are circular. This means that the derivation tree simulating the behaviour tree of Belousov-Zhabotinsky reaction has cycles, i.e. some derivable formulas occur among top premisses.
JavaScript is turned off in your web browser. Turn it on to take full advantage of this site, then refresh the page.