Name: Anonymous 2014-05-25 20:36
unsigned long hash(unsigned char *str)
{
unsigned int hash = 0;
int c;
while (c = *str++)
{
hash += c;
}
return hash;
}
Spent hours designing it. It is safer than md5!
unsigned long hash(unsigned char *str)
{
unsigned int hash = 0;
int c;
while (c = *str++)
{
hash += c;
}
return hash;
}
Dendritic trees are a lot more than a hash functionHow exactly? Of course the learning algorithm is unknown, but it's result is just a hash function, whose key feature is mapping high-dimensional data (dendritic tree samples up to 100,000 bits) to 1 bit. In effect brain can quickly determine correlations between up to 100000 different entities (i.e. it can compare up to 100,000 human faces at once).