introduction to computing and programming in python a.pptVIP

下载本文档

3
0
约2.81万字
约 70页
2016-03-05 发布于广东
举报
版权申诉

introduction to computing and programming in python a.ppt

1、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。。
2、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击这里二次下载。
3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
4、该文档为VIP文档，如果想要下载，成为VIP会员后，下载免费。
5、成为VIP后，下载本文档将扣除1次下载权益。下载后，不支持退款、换文档。如有疑问请联系我们。
6、成为VIP后，您将拥有八大权益，权益包括：VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
7、VIP文档为合作方或网友上传，每下载1次，网站将根据用户上传文档的质量评分、类型等，对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档

introduction to computing and programming in python a

The Traveling Salesman Problem Imagine that you’re a sales person, and you’re responsible for a bunch of different clients. Let’s say 30—half the size of our optimization problem. To be efficient, you want to find the shortest path that will let you visit each client exactly once, and not more than once. Being a smart graduate of this class, you decide to write a program to do it. The Traveling Salesman Problem currently can’t be solved The best known algorithm that gives an optimal solution for the Traveling Salesman Problem is O(n!) (That’s factorial) There are algorithms that are better that give close-to but not-guaranteed-best paths For 30 cities, the number of steps to be executed is 265,252,859,812,191,058,636,308,480,000,000 (30!) The Traveling Salesman Problem is real. For example, several manufacturing problems actually become this problem, e.g. moving a robot on a factory floor to process things in an optimal order. Class P, Intractable, and Class NP Many problems (like sorting) can be solved with an order of complexity that’s a polynomial, like O(n2) We call that Class P problems. Other problems, like optimization, have known solutions but are so hard and big that we know that we just can’t solve them a reasonable amount of time for even reasonable amounts of data. We call these intractable Still other problems, like Traveling Salesman Problem seem intractable, but maybe there’s a solution in Class P that we just haven’t found yet. We call these class NP Then there are impossible problems There are some problems that are provably impossible. We know that no algorithm can ever be written to solve this problem. The most famous of these is the Halting Problem Which is, essentially, to write a program to completely understand and debug another program. The Halting Problem We’ve written programs that can read another program and even write a new program. Can we write a program that will input another program (say, from a file) and tell us if the program will