|
|
|
|
|
|
by TeMPOraL
4054 days ago
|
|
|
All Turing-complete languages are equivalent and can solve the same set of problems. The issue is not whether you can or can't do it, but how much work it will take and how painful the process will be. Also when you learn some Lisp, you start to realize how often people are greenspuning[0] things in their projects. [0] - http://en.wikipedia.org/wiki/Greenspun%27s_tenth_rule |
|
|