Theory of neuromata
From MaRDI portal
Publication:3841043
DOI10.1145/273865.273914zbMath0902.68170OpenAlexW1966509406MaRDI QIDQ3841043
Publication date: 10 November 1998
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: http://www.acm.org/pubs/contents/journals/jacm/1998-45/
Learning and adaptive systems in artificial intelligence (68T05) Formal languages and automata (68Q45)
Related Items
General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results, 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, Analog neuron hierarchy, Cut Languages in Rational Bases, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal, The computational limits to the cognitive power of the neuroidal tabula rasa, Continuous-Time Symmetric Hopfield Nets Are Computationally Universal
