jinlisp

16 ms·

1.
by jinlisp 1y ago
If Putnam was really a genius I think he would have been able to communicate precisely some of this insight to mere mortals. It seems that he taught the same course during 10 years and that seems time enough to mature a good introduction
2.
by jinlisp 1y ago
Thanks for such a clear and logical explanation, it is a pleasure to read explanations like this. Anyway, I am always skeptical about how law is applied, sometimes the spirit of the law is bended by the weight of the powerful organizations
3.
by jinlisp 1y ago
Thank you, this is a nice point to consider. Don't know if using the weights could be considered equivalent or implying accepting the terms of services from weights creators.
4.
by jinlisp 1y ago
Both slip and jscl takes the same time in my computer: 63 seconds to run the loop.
5.
by jinlisp 1y ago
This is another comment of the author about maxima in the browser from four months ago: I'm experimenting with WASI and the GC extension for WASM, but that's months from today if we speak about complete port (given my time capacit
6.
by jinlisp 1y ago
It depends of what you need, but for example for calculus is a nice program. There is also sympy and Wolfram Mathematica. For symbolic computation I think that Mathematica is the strongest then maxima and then sympy, but sympy is based on
7.
by jinlisp 1y ago
I was going to ask if maxima (a symbolic computation system) can be implemented in the browser, but it was answered four months ago [1] [1] https://news.ycombinator.com/item?id=42853528
8.
by jinlisp 1y ago
Should it be possible to implement an optimization compiler? so that compiling the code in the web page produces results similar to ECL or sbcl?
9.
by jinlisp 1y ago
When executing (time (loop for i below (expt 10 8) count t)) it takes a long time, sbcl takes less than a second on this. So not useful when speed is required. More: (time (loop for i below 1000000 count t) takes 7 seconds on my computer, s
10.
by jinlisp 1y ago
Solving Queens using J and brute force all permutations. randomboard =: 3 : '? (y,y) $ y' testsolution =: 4 : 0 NB. solution is a list of columns. m =. x n =. #x solution =. y A. i. n regions =. ({&am
11.
by jinlisp 1y ago
Solving Queens in J from a novice J programmer: randomboard =: 3 : '? (y,y) $ y' testsolution =: 4 : 0 m =. x n =. #x n -: # ~. ({&m) <"1 (i. n) ,. y A. (i. n) ) findsolution =:3 : 0 board =:
12.
by jinlisp 1y ago
Solution in J (a few lines of code from a novice J programmer). board =: 3 : '? (y,y) $ y' test =: 4 : 0 m =. x n =. #x n -: # ~. ({&m) <"1 (i. n) ,. 0 A. (i. n) ) findsol =:3 : 0 ns =. 1 i.~
13.
by jinlisp 1y ago
I am thinking about developing in Common Lisp a version of J. And this could be a useful library to use with that program.