A Brief Overview of Deep Learning
yyue.blogspot.com
yyue.blogspot.com
Biological neurons are indeed more powerful than (most) artificial neural network models because these models discard important characteristics of biological neurons:
* Spiking: Most artificial models are 'rate-based', where they gloss over the spiking behaviour of neurons by only modelling the firing rate. This discards all the various kinds of spiking behaviours (intrinsically spiking, resonators, bursting, etc.) as well as the relative timing of spikes. The relative timing is the basis for spike-timing dependent plasticity (STDP), which enables Hebbian learning and long-term potentiation -- two of the ways that networks learn to wire themselves together and process information.
* Conduction delays: Biological neural networks have a delay between when a spike is generated at the axon hillock and when it arrives at the postsynaptic neuron's dendritic arbour. This delay acts as a kind of like delay line memory in computers, where information can be 'stored' in-transit for short periods of time (in the ballpark of 0.5-40ms). And because different axons have different delays, information can be integrated over time by having one axon with a short delay and one with a long delay both end up at the same postsynaptic neuron.
What I mean is that Finite state machines are less powerful computationally than context free grammars. A FSM cannot compute certain things that a CFG can. Further, a CFG can't compute certain things that a Turing machine can. But we do know that Neural networks like the ones being used for Deep Learning can compute anything a Turing machine can, and anything a Turing machine can compute, so can the NN. They're equivalent.
So the real question is this: do those features (spiking, conduction delays) actually make biological neural networks capable of computing something that Turing Machines and Artificial Neural Networks cannot?
I hypothesize the answer is "no". A Turing machine could simulate any of those features you've mentioned, and therefore an ANN could also simulate them. (But I would love to be wrong about it, that would be amazing if human minds could do something that no machine would ever be capable of!)
I was speaking before on a neuron-for-neuron basis. In computation-theoretic terms, I presume a spiking neural network model such as Izhikevich E.M. (2003) is equally powerful to a rate-based model such as Graves et al. (2014), in that they're both equivalent to a Turing machine.
(At least I assume Izhikevich's model can be, though I'm not aware of any proofs or demonstrations of it performing arbitrary computations.)
Also, keep in mind that saying something is 'Turing complete' only says that a machine is capable of computing anything that any other universal Turing machine can perform. It doesn't say anything about how efficiently it can do it. For example, a conventional computer and a quantum computer can both do integer factorization. But a quantum computer can do it much more efficiently, being able to do it in polynomial time. A quantum computer is therefore more powerful, even if they're both equivalent machines in computation-theoretic terms.
Are Turing machines proven to be able to compute anything computable, so isn't this known absolutely to be a "no"?
Maybe there is indeed a way to solve the halting problem using a type of computation we can't quite imagine yet. And maybe the human brain is capable of that kind of computation. I don't even know if we know the answers to those questions. I suspect not.
This is where computer science starts to get all philosophical, which is pretty awesome.
But that's not to say they're not powerful. They're an interesting area of research and you can certainly do some interesting work with them.
[1]: http://spectrum.ieee.org/robotics/artificial-intelligence/ma...
[1] http://www.cs.toronto.edu/~fritz/absps/imagenet.pdf
[2] http://www.image-net.org/challenges/LSVRC/2012/results.html (Look for SuperVision)