You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
There ought to be a way to simulate a stack in a smarter way with perceptrons, ideally with a finite number of perceptrons and arbitrary depth of stack.
Possible solution:
Could we just store a binary number as non-percpetron based data? Then use a bunch of bit_prod and bit_sum functions to do arbitrary binary multiplication since multiplication by 2 (then add bit) is PUSH and multiplication by 1/2 (after reading the 1s position) is POP.
The text was updated successfully, but these errors were encountered:
There ought to be a way to simulate a stack in a smarter way with perceptrons, ideally with a finite number of perceptrons and arbitrary depth of stack.
Possible solution:
Could we just store a binary number as non-percpetron based data? Then use a bunch of
bit_prod
andbit_sum
functions to do arbitrary binary multiplication since multiplication by 2 (then add bit) is PUSH and multiplication by 1/2 (after reading the 1s position) is POP.The text was updated successfully, but these errors were encountered: