We examine dynamical switching among discrete Turing patterns that enable chemical computing performed by mass-coupled reaction cells arranged as arrays with various topological configurations: three coupled cells in a cyclic array, four coupled cells in a linear array, four coupled cells in a cyclic array, and four coupled cells in a branched array. Each cell is operating as a continuous stirred tank reactor, within which the glycolytic reaction takes place, represented by a skeleton inhibitor-activator model where ADP plays the role of activator and ATP is the inhibitor. The mass coupling between cells is assumed to be operating in three possible transport regimes: (i) equal transport coefficients of the inhibitor and activator (ii) slightly faster transport of the activator, and (iii) strongly faster transport of the inhibitor. Each cellular array is characterized by two pairs of tunable parameters, the rate coefficients of the autocatalytic and inhibitory steps, and the transport coefficients of the coupling. Using stability and bifurcation analysis we identified conditions for occurrence of discrete Turing patterns associated with non-uniform stationary states. We found stable symmetric and/or asymmetric discrete Turing patterns coexisting with stable uniform periodic oscillations. To switch from one of the coexisting stable regimes to another we use carefully targeted perturbations, which allows us to build systems of logic gates specific to each topological type of the array, which in turn enables to perform advanced modes of chemical computing. By combining chemical computing techniques in the arrays with glycolytic excitable channels, we propose a cellular assemblage design for advanced chemical computing.

• Klíčová slova
• bifurcation analysis, chemical computing, coupled cells, discrete Turing patterns, glycolytic oscillations,
• Publikační typ
• časopisecké články MeSH