回顾创造未来的思想

W. Gasarch
{"title":"回顾创造未来的思想","authors":"W. Gasarch","doi":"10.1145/3471469.3471473","DOIUrl":null,"url":null,"abstract":"What are the most important papers in computer science? What are the most important 46 papers in computer science? Yikes! Far more than 46 seem to qualify. Picking out the top 46 papers in computer science is the task that befallen Harry Lewis (henceforth Harry). I suspect it was both a burden (gee, which ones to omit?) and a joy (Wow, these papers are insightful!). He used two (probably more) criteria that helped him cut it down (1) he prefers short readable papers to long unreadable ones (don't we all!), and (2) no paper past 1980 (arbitrary but firm cutoff). There were also absurd financial constraints based on how much the rights to republish a paper costs. In some cases a paper that is available online for free cost too much to put into a book. See my comment on Turing's 1936 paper. This book is a collection of the 46 most important papers in computer science, in the opinion of Harry, relative to some constraints. The complete list is at the end of the review. While I am sure many readers will think why isn't X in the list, or why is X in the list, or I never heard of X, I suspect that 2/3 of the people reading this review will agree with 2/3 of the papers on the list. I would urge people to read the book AND THEN have an intelligent debate about which papers should or should not be in it.","PeriodicalId":387985,"journal":{"name":"ACM SIGACT News","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Review of Ideas that Created the Future\",\"authors\":\"W. Gasarch\",\"doi\":\"10.1145/3471469.3471473\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"What are the most important papers in computer science? What are the most important 46 papers in computer science? Yikes! Far more than 46 seem to qualify. Picking out the top 46 papers in computer science is the task that befallen Harry Lewis (henceforth Harry). I suspect it was both a burden (gee, which ones to omit?) and a joy (Wow, these papers are insightful!). He used two (probably more) criteria that helped him cut it down (1) he prefers short readable papers to long unreadable ones (don't we all!), and (2) no paper past 1980 (arbitrary but firm cutoff). There were also absurd financial constraints based on how much the rights to republish a paper costs. In some cases a paper that is available online for free cost too much to put into a book. See my comment on Turing's 1936 paper. This book is a collection of the 46 most important papers in computer science, in the opinion of Harry, relative to some constraints. The complete list is at the end of the review. While I am sure many readers will think why isn't X in the list, or why is X in the list, or I never heard of X, I suspect that 2/3 of the people reading this review will agree with 2/3 of the papers on the list. I would urge people to read the book AND THEN have an intelligent debate about which papers should or should not be in it.\",\"PeriodicalId\":387985,\"journal\":{\"name\":\"ACM SIGACT News\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-06-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ACM SIGACT News\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/3471469.3471473\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ACM SIGACT News","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/3471469.3471473","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

计算机科学中最重要的论文是什么?计算机科学中最重要的46篇论文是什么?呵!符合条件的人数似乎远远超过46人。挑选出计算机科学领域排名前46位的论文是哈利•刘易斯(Harry Lewis)的任务。我怀疑这既是一种负担(哎,哪些可以省略?)也是一种快乐(哇,这些论文真有见地!)他使用了两个(可能更多)标准来帮助他减少数量(1)他更喜欢短可读的论文,而不是长不可读的论文(我们都不是!),(2)没有1980年以后的论文(武断但严格的限制)。此外,基于论文转载权的成本,还有一些荒谬的财务限制。在某些情况下,一篇可以在网上免费获得的论文要花太多的钱才能写成一本书。请看我对图灵1936年论文的评论。这本书是计算机科学中46篇最重要论文的集合,在Harry看来,相对于一些限制。完整的清单在评论的最后。虽然我相信很多读者会想为什么X不在列表中,或者为什么X在列表中,或者我从未听说过X,但我怀疑2/3的阅读本文的人会同意列表中2/3的论文。我会敦促人们阅读这本书,然后就哪些论文应该或不应该出现在书中展开一场明智的辩论。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Review of Ideas that Created the Future
What are the most important papers in computer science? What are the most important 46 papers in computer science? Yikes! Far more than 46 seem to qualify. Picking out the top 46 papers in computer science is the task that befallen Harry Lewis (henceforth Harry). I suspect it was both a burden (gee, which ones to omit?) and a joy (Wow, these papers are insightful!). He used two (probably more) criteria that helped him cut it down (1) he prefers short readable papers to long unreadable ones (don't we all!), and (2) no paper past 1980 (arbitrary but firm cutoff). There were also absurd financial constraints based on how much the rights to republish a paper costs. In some cases a paper that is available online for free cost too much to put into a book. See my comment on Turing's 1936 paper. This book is a collection of the 46 most important papers in computer science, in the opinion of Harry, relative to some constraints. The complete list is at the end of the review. While I am sure many readers will think why isn't X in the list, or why is X in the list, or I never heard of X, I suspect that 2/3 of the people reading this review will agree with 2/3 of the papers on the list. I would urge people to read the book AND THEN have an intelligent debate about which papers should or should not be in it.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Brief Introduction to Quantum Computing for Undergraduate Students: Lecture One SIGACT News Complexity Theory Column 120 Guest Column: Structure in Communication Complexity and Constant-Cost Complexity Classes The Book Review Column Open Problems Column
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1