Mathematician GregoryChaitin defines elegance in computer programming in this way: A computer program written in a given language is elegant if no smaller program written in the same language has the same output. He goes on to prove that it is impossible to prove that a given program above a certain very low level of complexity is elegant.
Mathematician GregoryChaitin defines elegance in computer programming in this way: A computer program written in a given language is elegant if no smaller program written in the same language has the same output. He goes on to prove that it is impossible to prove that a given program above a certain very low level of complexity is elegant.
https://wiki.c2.com/?ChaitinElegance
And he gave some examples in his book.
http://jillian.rootaction.net/~jillian/science/chaitin/www.c...
See the example code in LISP here:
https://github.com/darobin/chaitin-lisp