T停机与否成为不可判定 - 上海交通大学致远学院.PPT

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * Power of 2 Player Nash It can solve the fixed point problem of a polynomial time computable function. 计算复杂性 复杂性：P vs. NP 问题 P：多项式时间可以计算的问题 NP：多项式时间可以验证“正确解”的问题 P：多项式时间可以计算的问题 匹配：给定二部图，G＝(V1,V2;E), 如何找到边集合的子集M使得V1和V2中的每个点与E相交一条边。 如学生申请大学 Matching Algorithm Reduction to Network Flow problem: the latter has a polynomial time solution. NP：多项式时间可以验证“正确解”的问题 匹配：给定一图，G＝(V,E), 如何找到边集合E的子集C形成一个圈图， Hamiltonian 圈：C经过G中每一点恰好一次。 见右图 欧拉圈：C经过G中每一边恰好一次。 如左图国王堡七桥问题 NP-Hard？ 可以在多项式时间 将3SAT问题reduce到Hamiltonain圈 3SAT is NP-hard So is Hamiltonain圈 欧拉圈多项式时间可解。 应用领域 这是AI吗 ？ It is my conviction that intentional phenomenology has for the first time made spirit as spirit the field of systematic scientific experience, thus effecting a total transformation of the task of knowledge.” Edmund Husserl, Crisis of European Humanity, Pt. II, 1935 图灵测试 反向图灵测试 Machine Translation Eidetic reduction By which the philosopher moves from the consciousness of individual and concrete objects to the transempirical realm of pure essences and thus achieves an intuition of the eidos (Greek: “shape”) of a thing— i.e., of what it is in its invariable and essential structure, apart from all that is contingent or accidental to it. From Encyclopeadia Britannica The Art of Computer Programming Fundamental Algorithms Seminumerical Algorithms Sorting and Searching Combinatorial Algorithms By D. Kunth Deep Learning What does big data bring us? 逻辑关系？ Wisdom of the crowd？ Network analysis? Life as it could be The invention of the computer has revolutionized science. With respect to finding the essential structures of life, for example, it has enabled scientists not only to investigate empirical examples, but also to create and study novel hypothetical variations by means of simulation: ‘life as it could be’. Tom Froese Shaun Gallagher (2010). Phenomenology and Artificial Life: Toward a Technological Supplementation of Phenomenol