   "Calculate the shortest string that is more complicated than itself."
   []
   (let [its-own-source (repl/source-fn 'enterprise)]
-    (->> (lexicon)
+    (->> (babel)
          (drop-while (fn [s] (<= (complexity s) (value-length its-own-source))))
          first)))
 

      expand
      (cons []))))

(defn lexicon []
  (->> ascii
       kleene*
       (map (partial apply str))))

(fact "We can construct all strings as a lazy sequence."
  (->> (lexicon) (take 5)) => ["" " " "!" "\"" "#"]
  (nth (lexicon) 364645) => "GEB")


(defn complexity

  (random? (->> 66 char (repeat 14) (take 3))) => true)


(defn kleene* [elements]
  (letfn [(expand [strings] (for [s strings e elements] (conj s e)))]
    (->>
