Thanks, thinking twice perhaps HN could be both: a thread to spawn spices and at the same time a threat to them. As we all know Knowledge is a double-edged sword.
Recently in this post (*) I was talking about an idea, openlag, I was suggesting a similar model for microsoft and Revolutions Analytics, It seems I nail it.
Thank, that is interesting, to solve it: The lagged software should be given patch to critical bugs as soon as they are available, and the time lag for some products could be something like six months depending on the product. That is the company should provide patch for the critical bugs in the old version if such patch are available or help to solve that. The idea is that the company only keep the advantage of new features not taking advantage of critical bugs to sell the new version.
What I don't like about Nim is that there is not a repl. In Lisp and Clojure you don't need to compile things.
Could someone give a brief comparison between Clojure and Nim? Let's suppose that we implement Clojure in Nim is this a crazy idea?, What about implementing Shen in Nim?. Many people complain because sbcl is not easy to use with C++ libraries, could an implementation in Nim amilliorate those problems?. Many more questions arise but those mentioned are enough.
The author was looking for help to develop a minimal battery of tests that any new implementation should have to pass, but there were no voluntaries. Anyway, I think that becoming BSD can help to gather more souls.
The current licensing doesn't has a name, the author states in the html page of the standard certain restrictions to fork the code, it has to pass some test, but those tests are not clearly defined and there are other restrictions that move people away from Shen. Choosing a BSD license solve the problem of giving a clear answer to the license of Shen and promotes cooperation.
I just copied a post from the Shen group: I've now begun collecting on the pledges. £2583.52 was pledged, but I'll honour my side as soon as I've collected £2500, which should be reached if people keep to their pledges. You can follow the progress on http://www.shenlanguage.org/total.htm.
All the money is being used to systematically upgrade stlib; instituting a series of monographs in computer science documenting the library. The first is in graph theory.
The basic idea is to construct a kernel with 40 functions in such a way that the language is easily portable. With those 40 functions Shen is like a mixture of Lisp, prolog and typep racket.
If you imagine the same game but with a million doors and in the end there are only two doors, then you realize that there is a strong asymmetry and that the initial door is special. Going to the limit, with infinite doors to choose, the best thing you can do is choose the initial door, all the other doors are just to confuse you.
How do you know that you are going to write 1000 lines a week? Once you begin to write code you it can happen that the code is more easy to write than to explain and then you can code hundreds of lines in little time, but also it could happen that the code requires very special attention and sophistication, a tough problem, here you can only write a few lines but those are crucial or very important to write for efficiency or memory constraints. What I would suggest is to distribute your time according to the complexity of the modules or parts of the problem, but prior to that you need to have a good understanding of logic and internal structure of the code you are going to develop, and this is also another problem that you must address in your distribution of time.
There is a tension to use your time in the best way. Recently someone asked in reddit Haskell what's the best language to learn to obtain some statistics and finance, my answer was R. Computer Science should be related to some field in which you are an expert or know about. One extreme side of the coin is being too pragmatic the other extreme is wasting your time in the hippies things.
The difficulty is putting the real amount of time in research and in getting the tools that will me your goal became a reality, that's a touch problem.
What if we compute the value of a person life at a certain age as the difference between the life expectancy and his age. Then ten very old people could be less valuable than one child? That axiom is sound and your claim doesn't hold.
Thanks for the information, seems like facebook is a big data source for social experiment but there is some doubts about the legality of collecting and analyzing the data for psychological experiments. Being a lisper, by hobby, I see great opportunities for Lisp to become a very useful tool for sentiment analysis.
An example of eigenvalues: Suppose you take a polynomial of x and then you change x for -x, you obtain a new polynomial. Some polynomials doesn't change they are associated to eigenvalue 1, other change sign they are associated to eigenvalue -1, those are the only ways in which a polynomial gets transformed into a multiple of itself when changing sign. And what happens with the others polynomials? Well, you can write any of them as a sum of those with even exponents (those that doesn't change when changing the sign of x) and those with odd exponents (those are the ones that change sign), so any polynomial can be expressed as the sum of an even polynomial and an odd polynomial in a unique way. In the same way, taken the conjugate of a complex number the part that doesn't change is the real part (associate to eigenvalue 1) and the part that change sign is the imaginary part (associate to eigenvalue -1) and every complex number is written as the sum of its real and imaginary part. Take a matrix and computes its transpose, the matrix can be expressed as a sum of a symmetric matrix (corresponding to eigenvalue 1, doesn't change with the transpose operator) and an antisymmetric matrix (change the sign, associated to eigenvalue -1). Finally take for example any function of x and consider the function obtained when you change x to -x, then any function can be expressed in a unique way as the sum of a even function (corresponding to eigenvalue 1, that is doesn't change with that transformation) and an odd function (associate to eigenvalue -1, that is change sign). For example our familiar function exponential of x is the sum of the hyperbolic cosiness and the hyperbolic sinus.
This way you are near the Euler Formula:
e^x = cosh(x) + sinh(x) (real case)
e^it = cos(t) + i sin(t) (complex case)
I must add that in this example the transformation satisfies that applied two times is the identity, that is called involution A^2=1 and the only eigenvalues K are those that K^2=-1 that is 1 and -1.