It is shown how the enumeration operators in the "graph model" for lambda-calculus (which can function as a programming language for Recursive Function Theory) can be expanded to allow for "random combinators".  The result can then be a model for a new language for random algorithms.