We have neurons as functions. Now we could find the smallest function.
A = N(s) ; where s is a single input is the smallest. (It is also describes a computer.)
Note that s is a data stream where s[t-1] -> s[t] -> s[t+1] forever.
The possible function here are few. We can integrate and differentiate using simple functions i and d (dt is always equal to 1 here)
A = d(s) and A = i(s) ; are the first functions.
A = n(s) ; negates s
A = not(s) ; arithmetic not (if s = 0 then A = last s else A = 0)
A = wasz(s) ; A = last s if s=0 else A = 0
A = wasg(s); A = last s if s>0 else A = 0
A = wasl(s) ; A = last s if s<0 else A = 0
Now if we double the inputs it opens up a new world.
A = f(s1,s2) ; now we can do arithmetic
A = s1 o s2 ; where o is any operator
Now make a platform with a computer and three headers. This makes the machinery of functions.
Let O be output, I and R be inputs.
Here is the sequence:
Node function
Initialize if needed
Loop
Read I
Read R
Do function of I and R
Write O
GOTO Loop ; Do this forever
This loop is what makes numbers move and become data streams.
Here are some tree functions:
(+,-,o,a,is,gt,lt,waseq,wasgt,waslt)
These combine into tree functions that can match any neuron, input to synapse.
There are also some switches:
(z,g.l,dz,dg,dl,wasz,wasg,wasl,done)
These detect a condition and switch R into O if the condition is met and set O to zero otherwise.
Step 3 is making an algebra and an animachine programming system out of this.
Harold
A = N(s) ; where s is a single input is the smallest. (It is also describes a computer.)
Note that s is a data stream where s[t-1] -> s[t] -> s[t+1] forever.
The possible function here are few. We can integrate and differentiate using simple functions i and d (dt is always equal to 1 here)
A = d(s) and A = i(s) ; are the first functions.
A = n(s) ; negates s
A = not(s) ; arithmetic not (if s = 0 then A = last s else A = 0)
A = wasz(s) ; A = last s if s=0 else A = 0
A = wasg(s); A = last s if s>0 else A = 0
A = wasl(s) ; A = last s if s<0 else A = 0
Now if we double the inputs it opens up a new world.
A = f(s1,s2) ; now we can do arithmetic
A = s1 o s2 ; where o is any operator
Now make a platform with a computer and three headers. This makes the machinery of functions.
Let O be output, I and R be inputs.
Here is the sequence:
Node function
Initialize if needed
Loop
Read I
Read R
Do function of I and R
Write O
GOTO Loop ; Do this forever
This loop is what makes numbers move and become data streams.
Here are some tree functions:
(+,-,o,a,is,gt,lt,waseq,wasgt,waslt)
These combine into tree functions that can match any neuron, input to synapse.
There are also some switches:
(z,g.l,dz,dg,dl,wasz,wasg,wasl,done)
These detect a condition and switch R into O if the condition is met and set O to zero otherwise.
Step 3 is making an algebra and an animachine programming system out of this.
Harold
Last edited: