Computational power of various models of recurrent neural networks.
收藏数据链接：
官方服务：
资源简介：
FSA, TM and TM/poly(A) stand for finite state automata, Turing machines and Turing machines with polynomial advice (which are super-Turing), respectively. REG, P and P/poly are the complexity classes decided in polynomial time by these three models of computation. The results in the case of classical computation can be found in [1–7, 19–24]. Results in alternative infinite computational frameworks have also been obtained [25–35].
创建时间：
2019-10-16
