Each node would represent a logic gate, would take inputs from some nodes and pass their outputs to other nodes.
true (1) : can be thought of as propagating a true value through the graph
false (0) : can be thought of as propogating false to the nodes it is connected to.
The advantage of this is that you can make cycles:
false [0] -> not -> [0/1 alternating between the two] -> not
Thus we can create a makeshift register.
The value (0/1) between two nodes doesn't change until something around them changes, in other words this is a propagator network. So we can keep some values as memory and modify them over time:
Now we only need to take one boolean input, use that to modify register values and only then accept another input. This allows us to simulate memory using lofic gates, and control flow can be done by abusing the updating mechanic.
mondano
commented
1 year ago
Each node would represent a logic gate, would take inputs from some nodes and pass their outputs to other nodes.
true (1) : can be thought of as propagating a true value through the graph false (0) : can be thought of as propogating false to the nodes it is connected to.
The advantage of this is that you can make cycles: false [0] -> not -> [0/1 alternating between the two] -> not
Thus we can create a makeshift register.
The value (0/1) between two nodes doesn't change until something around them changes, in other words this is a propagator network. So we can keep some values as memory and modify them over time:
Now we only need to take one boolean input, use that to modify register values and only then accept another input. This allows us to simulate memory using lofic gates, and control flow can be done by abusing the updating mechanic.
Source for wonderful introduction to the concept and images: https://youtu.be/Fg5En6pbsDA