Analog neuron hierarchy

DOI10.1016/j.neunet.2020.05.006zbMath1468.68099OpenAlexW3022075953WikidataQ95647870 ScholiaQ95647870MaRDI QIDQ1982432

Jiří Šíma

Publication date: 8 September 2021

Published in: Neural Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.neunet.2020.05.006

zbMATH Keywords

recurrent neural networkTuring machineChomsky hierarchydeterministic context-free languageanalog neuron hierarchy

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Classical models of computation (Turing machines, etc.) (68Q04) Networks and circuits as models of computation; circuit complexity (68Q06)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Computing with truly asynchronous threshold logic networks
• Analog computation via neural networks
• A family of universal recurrent networks
• Quasi-periodic \(\beta\)-expansions and cut languages
• On the computational power of neural nets
• The dynamic universality of sigmoidal neural networks
• Subrecursive neural networks
• Theory of neuromata
• Efficient simulation of finite automata by neural nets
• Computational power of neural networks: a characterization in terms of Kolmogorov complexity
• Optimal simulation of automata by neural nets
• General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results
• Energy Complexity of Recurrent Neural Networks
• Three analog neurons are Turing universal

This page was built for publication: Analog neuron hierarchy