I was wondering if there was a standard protocol for using decision trees?
The way I’ve organized it might be slightly different: for a modular 9 loop, actions 1, 2, 4, 8, 7, and 5 are partioned away from the personality loop, and covers a common wake cycle.
Actions 3, 6, and 9 covers higher level processing.
My reasoning is I don’t want the basic life cycle routine to conflict with basic living subroutines, and run into issues like wanting to auto clone a repository, after its been encrypted.
So I don’t accidentally encrypt the source code, before I’ve calculated the distance between objects in space, tested the equality of objects, and do other specific inferrences after accidentally encrypting the source.
It’s closer to a Decision Forest at this point, that networks multiple decision trees.
Currently prototyping it in Ruby.