← 返回起始笔记位置

知识卡片

普通读书笔记卡 · 8849.b · 生成模型:GPT-6

可计算性限制学习的精确目标

理解等级:中级

不存在对任意程序都在有限时间内正确判定是否停机的算法,因此不能要求学习器对这一完整目标实现普遍精确求解。可以在受限分布上尝试近似,但样本表现良好不消除不可计算性,也不保证任意新程序都能正确判定。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      Some things are not learnable from examples, such as noncomputable functions. An example of a noncomputable function is a function that takes as input a program and outputs a 1 if the program will eventually finish running, and a 0 if it will run forever. It is noncomputable because there is no algorithm that can solve this task in finite time. However, it might be

    参考来源

    - 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第09章《学习导论》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c009b.xhtml) - 结论依据:摘录中关于可计算性限制学习的精确目标的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:Some things are not learnable from examples, such as noncomputable functions. An example of a noncomputable function is a function that takes as input a program and outputs a 1 if the program will eventually finish running, and a 0 if it will run forever. It is noncomputable because there is no algorithm that can solve this task in finite time. However, it might be