News for hackers. Stuff that matters.

A comment on AlphaGo Beats Lee Sedol in Final Game. Parent comment

Re:AlphaGo Beats Lee Sedol in Final Game by Tloewald on Tuesday March 15, 2016 @04:41PM (#11292813)
Even harder and more common problem -- given code, give a plain English description of what it is intended to do, and describe any shortcomings of the implementation.
[ Parent | on HN ]
Re:AlphaGo Beats Lee Sedol in Final Game by codeulike on Tuesday March 15, 2016 @05:12PM (#11293039)
Yeah e.g. you could get it to check whether it could go into an infinite loop.

Oh wait .... https://en.wikipedia.org/wiki/Halting_problem

[ Parent | on HN ]
Re:AlphaGo Beats Lee Sedol in Final Game by Retra on Tuesday March 15, 2016 @07:23PM (#11293810)
You could for all practical purposes. The Halting problem only generally applies when you're considering all possible programs, but you really only need consider the well-written ones, because then you can filter out the poorly written ones.
[ Parent | on HN ]