“第七章 人工智能的发展历程”版本间的差异
来自cslt Wiki
(→视频展示) |
(→高级读者) |
||
(相同用户的2个中间修订版本未显示) | |||
第39行: | 第39行: | ||
*王东,利节,许莎《人工智能》第一章 “神奇的人工智能”,第六章“学习你的思维” [http://aibook.cslt.org] | *王东,利节,许莎《人工智能》第一章 “神奇的人工智能”,第六章“学习你的思维” [http://aibook.cslt.org] | ||
*尼克,人工智能简史[https://e.jd.com/30410197.html][https://github.com/rmlzy/my-ebook/blob/master/%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD%E7%AE%80%E5%8F%B2.pdf] | *尼克,人工智能简史[https://e.jd.com/30410197.html][https://github.com/rmlzy/my-ebook/blob/master/%E4%BA%BA%E5%B7%A5%E6%99%BA%E8%83%BD%E7%AE%80%E5%8F%B2.pdf] | ||
− | *贲可荣,陈火旺. 自动定理证明:十年回顾. 《 计算机科学 》 , 1993 [https:// | + | *贲可荣,陈火旺. 自动定理证明:十年回顾. 《 计算机科学 》 , 1993 [https://www.jsjkx.com/CN/Y1993/V20/I4/19] |
− | *Karp R M. Reducibility among combinatorial problems[M]//Complexity of computer computations. Springer, Boston, MA, 1972: 85-103. [https:// | + | *Karp R M. Reducibility among combinatorial problems[M]//Complexity of computer computations. Springer, Boston, MA, 1972: 85-103. [https://link.springer.com/chapter/10.1007/978-1-4684-2001-2_9] |
− | * Jeff Dean: AI isn't as smart as you think -- but it could be | TED [http://aigraph.cslt.org/courses/07/AI_is_not_smart] | + | * Jeff Dean: AI isn't as smart as you think -- but it could be | TED [http://aigraph.cslt.org/courses/07/AI_is_not_smart.mp4] |
2023年8月8日 (二) 08:55的最后版本
教学资料
扩展阅读
- 维基百科:人工智能简史[2][3]
- 百度百科:自动定理证明[4]
- ELIZA chat bot [5][6]
- 百度百科:理查德·卡普 [7]
- 百度百科:专家系统 [8][9]
- 百度百科:爱德华·费根鲍姆[10][11]
- 百度百科:人工神经网络[12]
- 人工神经网络与反向传播算法[13]
视频展示
演示链接
- ELIZA chatbot [19]
开发者资源
- ELIZA python code [20]
高级读者
- AI简史[21][22]
- "ELIZA — A Computer Program for the Study of Natural Language Communication between Man and Machine," Communications of the Association for Computing Machinery 9 (1966): 36-45. [23]
- 王东,利节,许莎《人工智能》第一章 “神奇的人工智能”,第六章“学习你的思维” [24]
- 尼克,人工智能简史[25][26]
- 贲可荣,陈火旺. 自动定理证明:十年回顾. 《 计算机科学 》 , 1993 [27]
- Karp R M. Reducibility among combinatorial problems[M]//Complexity of computer computations. Springer, Boston, MA, 1972: 85-103. [28]
- Jeff Dean: AI isn't as smart as you think -- but it could be | TED [29]