搜索资源列表
C Algorithm_配套源码Robert Sedgewick
- 这是Donald Kunth(计算机科学学术界最最有名的大师级人物,曾获图灵奖及其他无数科技奖项)的弟子Robert Sedgewick的名著C算法一书的配套源码-Kunth (computer science academic gurus of the most famous figures, won the Turing Award and countless other technology awards) Robert Sedgewick the disciples of the fam
turing
- 人工智能的重要入门书籍,介绍图灵机模型,已经当今数字计算机在进行图灵测试遇到的困难,前进的方向,书中有很多生动的原理与逻辑分析,对于开阔眼界,拓展思维,了解人工智能基础很有帮助.-artificial intelligence important portal books on the Turing Machine model, have today's digital computer Turing test during the difficulties encountered, t
Turingmachine
- 图灵机的模拟程序,计算机初学者必学的。快来看看吧 -Turing machine simulation program, a beginner must learn the computer. Come see and see
fd2dxKin2
- 二维,捕食与被捕食模型的数值模拟,能够做出图灵斑状图来-2D Turning Pattern
Computers-Then-and-Now
- ACM图灵讲座,年代比较久远,但是讲的东西比较好,可以看看,还可以学学英语!-ACM Turing lecture, s more distant, but talking about something better, you can see, you can also learn English!
floyerr
- 称为弗洛伊德算法,插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。改算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-To find the shortest path between vertices given weighted graph
Turing10110111
- 模拟实现图灵状态机的010110111011110……,也就是每个0之间都比前一个多一个1。-Analog implementation of a the Turing state machine 010110111011110 ......, that is, each between 0 than the previous one more 1.
SAGA
- Floyd算法又称为弗洛伊德算法,插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
FW
- Floyd算法又称为弗洛伊德算法,插点法,是一种用于寻找给定的加权图中顶点间最短路径的算法。该算法名称以创始人之一、1978年图灵奖获得者、斯坦福大学计算机科学系教授罗伯特·弗洛伊德命名。-Floyd algorithm, also known as Freud algorithm, the insertion point method is an algorithm used to find the shortest path between vertices given weighted g
聊天机器人完美版
- 用html实现一个简单的机器人聊天功能.主要是调用了图灵的api接口。做的一个小玩具,以后还会更新。(Using HTML to achieve a simple chat function of the robot, mainly calling the Turing API interface. Make a little toy, and it will be renewed later)
手机端图灵测试
- 图灵机器人安卓手机端测试,附上源码,运行请使用eclipse!