Theory of neuromata.

A finite automaton?the so-called neuromaton, realized by a finite discrete recurrent neural network, working in parallel computation mode, is considered. Both the size of neuromata (i.e., the number of neurons) and their descriptional complexity (i.e., the number of bits in the neuromaton representa...

पूर्ण विवरण

ग्रंथसूची विवरण

में प्रकाशित:	Journal of the ACM 45, 1 (1998).
मुख्य लेखक:	íma, Jiří
स्वरूप:	लेख
भाषा:	English
विषय:	Theory of computation. Computation by abstract devices. Models of computation. Automata (e.g., finite, push-down, resource-bounded). Relations between models. Self-modifying machines (e.g., neural networks). Mathematical logic and formal languages. Formal languages. Theory.