4 ms·
> eval(x) Sort of like the number omega, which contains in each digits proofs to every theorem, but is not computable: http://en.wikipedia.org/wiki/Chaitin's_
by buo 13y ago
> eval(x)
Sort of like the number omega, which contains in each digits proofs to every theorem, but is not computable:
http://en.wikipedia.org/wiki/Chaitin's_constant http://en.wikipedia.org/wiki/Chaitin's_constant
- Groxx 13y agoAlso Greenspun's 10th rule of programming: http://c2.com/cgi/wiki?GreenspunsTenthRuleOfProgramming http://c2.com/cgi/wiki?GreenspunsTenthRuleOfProgramming