Gregory Chaitin, Kurt Gödel, Paradox, Algorithmic Information, Conservation Laws.
program” to be the smallest program (in terms of bits of information) that can produce a given output. Within a formal axiomatic system of size N bits, you show that it is possible to find all elegant programs of size less than N. Can we consider finding such “elegant programs” a formalization of