Turing Completeness of Bounded-Precision Recurrent Neural Networks Stephen Chung

–Neural Information Processing Systems 

Previous works have proved that recurrent neural networks (RNNs) are Turing-complete.

Similar Docs  Excel Report  more

TitleSimilaritySource
None found