On Wed, 9 Feb 2005, Knut M. Wittkowski wrote:
Last Friday, Gregory Chaitin (http://www.umcs.maine.edu/~chaitin/lm.html)
mentioned that there can be no proof that a given code is the shortest for a
problem, even within a language.
I presume he said something more like `for some problems there is n
Last Friday, Gregory Chaitin (http://www.umcs.maine.edu/~chaitin/lm.html)
mentioned that there can be no proof that a given code is the shortest for
a problem, even within a language. Still, the script below, a replacement
of the "TDT", one of the most frequently used tests in genetics
(http://
