Supplementary for Turing Completeness of Bounded-Precision Recurrent Neural Networks Stephen Chung

Turing Machine is moving right. The proof is similar to that of Theorem 1 but with more neurons. The general idea of the proof is that the required update can be constructed as a two-step process. In the first step, we apply the equations used in the proof of Theorem 1 for neurons from 1. to 6. Therefore, the equations for neurons from 1. to 6. are The update equations for 1. to 6. are the same as that in the proof of Theorem 1, except: 4. T ape neurons. The proof is similar to that of Theorem 2 but with more neurons.