Skip to content
GitLab
Projects
Groups
Snippets
Help
Loading...
Help
Help
Support
Community forum
Keyboard shortcuts
?
Submit feedback
Contribute to GitLab
Sign in / Register
Toggle navigation
Open sidebar
Karsten Poeck
cl-bench
Commits
9fa478dd
Commit
9fa478dd
authored
Feb 13, 2016
by
Daniel Kochmański
Browse files
cosmetic: remove invalid character from the comment
parent
689d84a4
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
2 additions
and
2 deletions
+2
-2
files/math.lisp
files/math.lisp
+2
-2
No files found.
files/math.lisp
View file @
9fa478dd
...
...
@@ -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 na
v
e math-style.
;; intended to test performance when programming in na
i
ve math-style.
(
defun
mset-level/complex
(
c
)
(
declare
(
type
complex
c
))
(
loop
:for
z
=
#c
(
0
0
)
:then
(
+
(
*
z
z
)
c
)
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
.
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment