     (eval `(define-registered ~symb (out ~num)))))
       
 ;; Define atom generators for the problem
-(defn mom-atom-generators
+(defn dm-atom-generators
   [num-bits-n]
   (list
     (fn [] (lrand-nth (list 'boolean_and

    ))

;; Create test cases
(defn mom-test-cases
  [num-bits-n]
  (for [num1 (range (expt 2 num-bits-n))
        num2 (range (expt 2 num-bits-n))]

;; digital-multiplier.clj
;; an example problem for clojush, a Push/PushGP system written in Clojure
;; Tom Helmuth, thelmuth@cs.umass.edu
;;
;; This is code for the digital multiplier problem, as defined in:
;;    Walker, J.A.; Miller, J.F., "The Automatic Acquisition, Evolution and
;;    Reuse of Modules in Cartesian Genetic Programming," Evolutionary
;;    Computation, IEEE Transactions on , vol.12, no.4, pp.397,417, Aug. 2008
;;
;; The n-bit digital multiplier takes 2 n-bit numbers and outputs their
;; product. So, this problem requires 2*n bits of input and 2*n bits of output.
;; The input is stored in a vector as the first item on the auxiliary stack, and
;; the output is stored in a vector as the second item on the auxiliary stack.
