3 ms·
The difference between being better than humans at simple games and harder games like Go is scale. We thought this wouldn't happen for generations but here we a
by karmakaze 6y ago
The difference between being better than humans at simple games and harder games like Go is scale. We thought this wouldn't happen for generations but here we are.
I don't see the how the sorts of problems presented as being qualitatively different as ones we can already solve. The problem is scale and having the problem formally defined. We'll separate the english-to-machine readable form as a separate step as I don't think that's the 'math' part of the challenge--specifically excluding math word problems.
We will develop better representations and search strategies and meta-strategy searching abilities and make advances in improving their runtimes as hardware devices continue to get faster allowing research to accelerate.
For the example question, a machine could have picked a special case, right triangles where a^2 + b^2 = c^2 and the area a*b/2. Now choose a^2, b^2 as whole numbers, say 2 and 3 ==> c = root(5) with area 3.
As noted in other comments, it would then have to take this premise and algebraically extend to all n>3 which I believe we have inductive provers as one example can do.
- deleted 6y ago[deleted]