News for hackers. Stuff that matters.
Re:Yann LeCun's comment on AlphaGo and true AI by doctorstupid on Monday March 14, 2016 @07:37AM (#11282228)
This is besides your main point, but I just want to add that the 'problem' of Go is not nearly solved. Rather, nearly solved is the problem of beating a human Go player. There is quite a difference.
Re:Yann LeCun's comment on AlphaGo and true AI by platz on Monday March 14, 2016 @08:08AM (#11282317)
I wouldn't expect global maximums to even be definable for most problems
Re:Yann LeCun's comment on AlphaGo and true AI by emodendroket on Monday March 14, 2016 @10:34AM (#11283087)
I think a "solution" for Go is a program that can play to a win (or a draw, I guess) in any circumstance, right? I mean, like, you can create a tic-tac-toe program that plays perfectly and will never lose, but you cannot do this for go.
Re:Yann LeCun's comment on AlphaGo and true AI by drdeca on Monday March 14, 2016 @11:00AM (#11283196)
... Yet.

Growth mindset.

Re:Yann LeCun's comment on AlphaGo and true AI by jacquesm on Monday March 14, 2016 @08:53AM (#11282545)
> the 'problem' of Go is not nearly solved.

And it is very likely that it will never be, the number of combinations is simply too large.

Re:Yann LeCun's comment on AlphaGo and true AI by zardo on Monday March 14, 2016 @03:52PM (#11285087)
That doesn't (necessarily) mean a proof can't be found that a certain ruleset leads to optimal play. Tic-tac-toe can be solved without examing the entire state space of the game.
Re:Yann LeCun's comment on AlphaGo and true AI by jacquesm on Monday March 14, 2016 @05:40PM (#11285780)
That's mostly because of trivial symmetry and even taking that into account Go space is in the most literal sense astronomic, simple numbers don't work in describing just how large it is.