Turing complete neural computation based on synaptic plasticity
Fig 4
The nodes and edges of the graph represent the states and transitions of the machine, respectively. An edge from q to q′ labelled by represent the transition . In other words, if the machine is in computational state q, reads input a and has counter states , then it will move to computational state q′ and performs counter operations o1, o2. This 2-counter machine recognizes the language {0n1n0n: n > 0}, i.e., the sequences of bits beginning with a strictly positive number of 0’s followed by the same number of 1’s and followed by the same number of 0’s again.