On Mon, Feb 27, 2012 at 5:23 PM, Charles Perkins <ch...@memetech.com> wrote: > I think of the code size reduction like this: > > A book of logarithm tables may be hundreds of pages in length and yet the > equation producing the numbers can fit on one line. > > VPRI is exploring "runnable math" and is seeking key equations from which the > functionality of those 1MLOC, 10MLOC, 14MLOC can be automatically produced. > > It's not about code compression, its about functionality expansion.
This reminds me of Gregory Chaitin's concept of algorithmic complexity, leading to his results relating to compression, logical irreducibility and "understanding" [1]. [1] G. Chaitin. Meta Math! The Quest for Omega, Vintage Books 2006. _______________________________________________ fonc mailing list fonc@vpri.org http://vpri.org/mailman/listinfo/fonc
