Neural networks-competence and performance

This paper investigates the competence and performance of neural computers. The discrete neural computing methods can neither break the unsolvability barrier nor can ameliorate the complexity of resource (time and space) consumption in computation. Also the introduction of randomization or probabilities along with neural computing cannot improve this situation. Very little is known about analog neural networks as they have not been axiomatized and studied; if one axiomatizes and studies them, one may derive similar conclusions concerning their competence and performance