Commit 9fa478dd authored by Daniel Kochmański's avatar Daniel Kochmański
Browse files

cosmetic: remove invalid character from the comment

parent 689d84a4
......@@ -41,7 +41,7 @@
;; function which is computable but not primitive recursive, providing a
;; counterexample to the belief in the early 1900s that every computable
;; function was also primitive recursive (Dtzel 1991). It grows faster
;; than an exponential function, or even a multiple exponential function.
;; than an exponential function, or even a multiple exponential function.
(defun ackermann (m n)
(declare (type integer m n))
(cond
......@@ -56,7 +56,7 @@
;; calculate the "level" of a point in the Mandebrot Set, which is the
;; number of iterations taken to escape to "infinity" (points that
;; don't escape are included in the Mandelbrot Set). This version is
;; intended to test performance when programming in nave math-style.
;; intended to test performance when programming in naive math-style.
(defun mset-level/complex (c)
(declare (type complex c))
(loop :for z = #c(0 0) :then (+ (* z z) c)
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment