Re:Unprovability comes to machine learning
by red75prime on Wednesday January 09, 2019 @10:57PM
(#18871408)
To be more concise. The undecidability of the halting problem has no practical effect, barring usual considerations about fundamental research.
[ Parent
| on HN ]
There are no comments on this comment yet.