@chigo A different way to looking at this is "graph reduction", but most of uxn's opcode fail at this, but still an interesting idea if you're interested in parallel computing, is to have a stack of interaction between nodes(operations between registers?), and reduce for as long there are reduceable items on the stack.
If your entire system is based on the IN six reduction rules, you have something like linear combinators.
Gregory's Server
@chigo A different way to looking at this is "graph reduction", but most of uxn's opcode fail at this, but still an interesting idea if you're interested in parallel computing, is to have a stack of interaction between nodes(operations between registers?), and reduce for as long there are reduceable items on the stack.
If your entire system is based on the IN six reduction rules, you have something like linear combinators.
https://wiki.xxiivv.com/site/interaction_nets.html