Are Random Forests Turing-Complete?
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.