History of AI课件.ppt

  1. 1、本文档共22页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
History of AI Foundations from related fields 精品文档 Philosophy (400 B.C-) Socrates-Plato-Aristotle Socrates: “I want to know what is characteristic of piety which makes all actions pious...that I may have it to turn to, and to use as a standard whereby to judge your actions and those of other men” (algorithm) Aristotle: Try to formulate laws of rational part of the mind. Believed in another part, intuitive reason 精品文档 Philosophy: Dualism vs. materialism Rene Descartes (1596-1650): dualism (part of mind that is outside of nature) Materialism. Wilhelm Leibniz (1646-1716) built a mechanical device to carry out mental operations; could not produce interesting results 精品文档 Philosophy: Source of knowledge Empiricism (Francis Bacon 1561-1626) John Locke (1632-1704): “Nothing is in the understanding which was not in the senses” David Hume (1711-1776): Principle of induction: General rules from repeated associations between their elements Bertrand Russell (1872-1970): Logical positivism: All knowledge can be characterized by logical theories connected, ultimately, to observed sentences that correspond to sensory inputs 精品文档 Logic George Boole (1815-1864): formal language for making logical inference Gottlob Frege (1848-1925): First-order logic (FOL) Computability David Hilbert (1862-1943): Problem #23: is there an algorithm for deciding the truth of any logical proposition involving the natural numbers? Kurt Godel (1906-1978): No: undecidability (yes for FOL) Alan Turing (1912-1954): which functions are computable? Church-Turing thesis: any computable function is computable via a Turing machine No machine can tell in general whether a given program will return an answer on a given input, or run forever Mathematics 精品文档 Mathematics… Intractability Polynomial vs. exponential (Cobham 1964; Edmonds 1965) Reduction (Dantzig 1960, Edmonds 1962) NP-completeness (Steven Cook 1971, Richard Karp 1972) Contrasts “Electronic Super-Brain” 精品文档 Mathematics… Probability Gerolamo Cardano

文档评论(0)

liuxiaoyu98 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档