Unprovability comes to machine learning

Editorial Material

关键词: INDEPENDENCE;   

DOI  :  10.1038/d41586-019-00012-4

来源: SCIE

【 摘 要 】

Scenarios have been discovered in which it is impossible to prove whether or not a machine-learning algorithm could solve a particular problem. This finding might have implications for both established and future learning algorithms.

【 授权许可】

Free