Comment

Comment by Onavo

> We know that any theorem that is provable at all (in the chosen foundation of mathematics) can be found by patiently enumerating all possible proofs.

Which computer science theorem is this from?

parent Onavo 1 year ago

Comment by Onavo

Discussion