> Someone wrote:
> >>If N neurons have to meet up accurately with N locations, there are
> >>N! (that's a factorial) ways of doing this. Given that N is very
I've haven't learned about factorials yet.
But shouldn't this be ((n*n)-n)/2?
(for the number of connections? It would eliminate counting a path both
"To mangle the Turing Test... If ya can't tell, it doesn't matter."
-a very wise comment from 'Tangent of the Arc' (moc.1cb at llahd)