Optimal simulation of automata by neural nets

DOI10.1007/3-540-59042-0_85zbMath1379.68223OpenAlexW1533739098MaRDI QIDQ4596634

Piotr Indyk

Publication date: 4 December 2017

Published in: STACS 95 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-59042-0_85

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (11)

Subrecursive neural networks ⋮ Three analog neurons are Turing universal ⋮ Quasi-periodic \(\beta\)-expansions and cut languages ⋮ Energy Complexity of Recurrent Neural Networks ⋮ Positive Neural Networks in Discrete Time Implement Monotone-Regular Behaviors ⋮ Automata complete computation with Hodgkin-Huxley neural networks composed of synfire rings ⋮ Analog neuron hierarchy ⋮ Cut Languages in Rational Bases ⋮ The case for hypercomputation ⋮ The computational limits to the cognitive power of the neuroidal tabula rasa ⋮ Frontier between decidability and undecidability: A survey

This page was built for publication: Optimal simulation of automata by neural nets