I\'m interested in the computational power of neural nets. It is generally accepted that recurrent neural nets are Turing complete. Now I was searching for some papers which proofs this.
I am porting some C code involving an artificial neural network to Java. I have decided to use the Encog framework.
This is a question in a previous exam paper that I have been asked to look at; the slide we have used to learn do not make sense of this. I understand how to use a table to get the Entropy, but not ho
The sensor module in my project consists of a rotating camera, that collects noisy information about moving objects in the surrounding environment.
First I want to say that I\'m really new to neural networks and I don\'t understand it very good ;) I\'ve made my first C# implementation of the backpropagation neural network. I\'ve tested it using
I have a neural network written in Java which uses a sigmoid transfer function defined as follows: private static double sigmoid(double x)
I am using an external library for Artificial Neural Networks in my project.. While testing the ANN, It gave me output of all NaN (not a number in C#)
I am creating a tool for predicting the time and cost of software projects based on past data. The tool uses a neural network to do this and so far, the results are promising, but I think I can do a l
A few simple marks for those who know the answer. I\'m doing revision for开发者_如何学运维 exams at the moment and one of the past questions is:
Closed. This question does not meet Stack Overflow guidelines. It is not currently accepting answers.
加载中,请稍侯......