Are Random Forests Turing-Complete? Is the random forests algorithm Turing-complete? As in, can any algorithm be represented by a given "tree" in the forest?
No, they're not Turing complete.  The handle inputs of a fixed size.  Also, they can't loop, so will always halt -- it follows that they don't have the ability to perform Turing-complete computation.