LispForum

Thanks, yeah, the minimization is something that rings the bell to me. But what do you mean when you say "analytically solvable" - this must be my laps of technical language, I don't know what does it mean when applied to function, can you please explain or have a link to an article?

If they will be used simultaneously, how then the printer will choose which to use for printing? :/

This question isn't strictly in CL's domain, if moderators find it a better place - please move it. So, the wiki article and many examples of gradient descent suggest that the way to calculate the function that is the fastest way to get to the local minimum is by iteratively approaching it in hopes ...

You really don't want that to happen for all lists because it will break too many other things potentially... This sounds like a rather peculiar task for some of your custom data / purpose. I'd just go with format'ing them with whatever style you like, else you might have to change too much of other...

http://psg.com/~dlamkins/sl/chapter06.html Looks like this should help you.

Generally, all variables are defined on package level; if that's global enough for you, then yes (they may be shared between different functions). http://www.lispworks.com/documentation/HyperSpec/Body/m_defpar.htm here's more info about it, but it is more common to call these dynamic variables , not...

Some times people use "?" in a function name to signal that the function will return a boolean or a generalized boolean value. But your variant looks more like a manga style smiley :) I didn't encounter this kind of naming before. On the same note, the below are also valid function names: ...

What you refer to is commonly known as binding. I.e. An identifier in environment (a term in the program code) which is bound (refers to) some value. E.g. in CL: (let ((foo 42)) (princ foo)) In the case above let creates an environment which inherits all bindings from the surrounding environments an...

The parameter of the array? Sorry, that sounds confusing. Do you want to just print an array, or a member of array? If so: (princ #(1 2 3)) ; prints the array #(1 2 3) (princ (aref #(1 2 3) 1)) ; prints the second member of the array, i.e. 2 Note that this isn't very precise to call this an array, b...

Imagine that "a" (the parameter in foo function) is a function. Then what will happen ? Is it possible to send it like the above code ? My code? Won't compile, unless you have defined a + function that can take a function as an argument. This code is correct ? No, (#'_step ...) expression...