Re: Hash- Defined
- From: Douglas Eagleson <eaglesondouglas@xxxxxxxxx>
- Date: Fri, 28 Mar 2008 13:55:02 -0700 (PDT)
On Mar 28, 6:54 am, Douglas Eagleson <eaglesondoug...@xxxxxxxxx>
wrote:
a[i] key
for each a[i] a character exists.
a string to be hashed was always the set. Making the functional
algorithm. Any set therefor denotes algorithm as functional relation.
Take the equation; S=A
A mapping a function exists. A string relation as a subset exists. s-
subset S, s equals character string or symbol set.
Algorithm as S=A was to be hashed causing s=a. 'a' as a subset of A
now we cause a function as sequence. So S=
{1,2,3,4,12,16}
s= 1
Sequnece location one causes the function. a.
note: in vernacular, location one as 1 was the key to understanding
in predicate.
the one was third order abstracted one.
So read better the next time.
If I had said s= 22 I would have to apply a character 22 to the set
making all S
.
- Follow-Ups:
- Re: Hash- Defined
- From: Noob
- Re: Hash- Defined
- References:
- Hash- Defined
- From: Douglas Eagleson
- Hash- Defined
- Prev by Date: Re: Hash- Defined
- Next by Date: Re: Hash- Defined
- Previous by thread: Re: Hash- Defined
- Next by thread: Re: Hash- Defined
- Index(es):
Relevant Pages
|
|
