= 27d567bc2d48d9f40e9ccc20ea370b15)
timtyler comments on Automated theorem proving by learning from examples - Less Wrong Discussion
You are viewing a comment permalink. View the original post to see all comments and the full post content.
= 783df68a0f980790206b9ea87794c5b6)
Loading…= b715d02e85f7b3b4ae65ca3d3e450868)
Subscribe to RSS Feed
Powered by Reddit
= f037147d6e6c911a85753b9abdedda8d)
You are viewing a comment permalink. View the original post to see all comments and the full post content.
Comments (9)
Most theorems are not presented in a very machine-friendly format, I believe.
Yes but parsing theorems (at least at the syntactic level) should be no harder than parsing English, and we do lots of reasonably smart text mining, and even some reasonable natural language translation.
Math theorems are hard-going for many humans. Machines think differently - but may well find them challenging too. I'm not sure this area is particularly low-hanging.