Re:Every odd number greater than five is the sum of three pr...
by zwegner on Tuesday May 14, 2013 @11:47PM
(#5710054)
> It's like, given all code, what is the smallest language we can use to express it. Which is sequences of 0s and 1s.
This should be of interest: https://en.wikipedia.org/wiki/Binary_lambda_calculus
But really the process is reversed: given arithmetic, what is the smallest axiom set to give us the power to prove our theorems.
It's like, given all code, what is the smallest language we can use to express it. Which is sequences of 0s and 1s.