3 ms·
There is a correspondence between proofs and programs (curry-howard) so I guess if there are non computable functions, there are non computable proofs?
by elcomet 7y ago
There is a correspondence between proofs and programs (curry-howard) so I guess if there are non computable functions, there are non computable proofs?