Get our free extension to see links to code for papers anywhere online!Free add-on: code for papers everywhere!Free add-on: See code for papers anywhere!
Abstract:We overview dataflow matrix machines as a Turing complete generalization of recurrent neural networks and as a programming platform. We describe vector space of finite prefix trees with numerical leaves which allows us to combine expressive power of dataflow matrix machines with simplicity of traditional recurrent neural networks.
* 6 pages, accepted for presentation at LearnAut 2017: Learning and
Automata workshop at LICS (Logic in Computer Science) 2017 conference.
Preprint original version: April 9, 2017; minor correction: May 1, 2017