Current Trends in Theoretical Computer Science最新文献

筛选
英文 中文
On Kolmogorov Machines and Related Issues 柯尔莫哥洛夫机及其相关问题
Current Trends in Theoretical Computer Science Pub Date : 2017-02-01 DOI: 10.1142/9789812794499_0017
Y. Gurevich
{"title":"On Kolmogorov Machines and Related Issues","authors":"Y. Gurevich","doi":"10.1142/9789812794499_0017","DOIUrl":"https://doi.org/10.1142/9789812794499_0017","url":null,"abstract":"I felt honored and uncertain when Grzegorsz Rozenberg, the president of EATCS, proposed that I write a continuing column on logic in computer science in this Bulletin. Writing essays wasn't my favorite subject in high school. After some hesitation, I decided to give it a try. I'll need all the help I can get from you: criticism, comments, queries, suggestions, etc. Andrei Nikolayevich Kolmogorov died a few months ago. In recent years he chaired the Department of Mathematical Logic at the Moscow State University. In a later article or articles, I hope to discuss Kolmogorov's ideas on randomness and information complexity; here let me take up the issue of Kolmogorov machines and their close relatives, Schonhage machines. I believe, we are a bit too faithful to the Turing model. It is often easier to explain oneself in a dialog. To this end, allow me to introduce my imaginary student Quizani.","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116398361","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 48
The challenger-Solver Game: variations on the Theme of P=NP 挑战者-解决者游戏:P=NP主题的变体
Current Trends in Theoretical Computer Science Pub Date : 2017-02-01 DOI: 10.1142/9789812794499_0019
Y. Gurevich
{"title":"The challenger-Solver Game: variations on the Theme of P=NP","authors":"Y. Gurevich","doi":"10.1142/9789812794499_0019","DOIUrl":"https://doi.org/10.1142/9789812794499_0019","url":null,"abstract":"Originally in Bulletin of the European Association for Theoretical Computer Science October 1989, 112-121. Reprinted in 1993 World Scientific book Current Trends in Theoretical Computer Science. pages 245-253 The question P=?NP is the focal point of much research in theoretical computer science. But is it the right question? We find it biased toward the positive answer. It is conceivable that the negative answer is established without providing much evidence for the difficulty of NP problems in practical terms. We argue in favor of an alternative to P=?NP based on the average-case complexity.","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123690778","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 32
CoFI: The Common Framework Initiative for Algebraic Specification and Development CoFI:代数规范和发展共同框架倡议
Current Trends in Theoretical Computer Science Pub Date : 2001-05-01 DOI: 10.1007/BFb0030591
P. Mosses
{"title":"CoFI: The Common Framework Initiative for Algebraic Specification and Development","authors":"P. Mosses","doi":"10.1007/BFb0030591","DOIUrl":"https://doi.org/10.1007/BFb0030591","url":null,"abstract":"","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2001-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124164171","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 92
The Genomics Revolution and its Challenges for Algorithmic Research 基因组学革命及其对算法研究的挑战
Current Trends in Theoretical Computer Science Pub Date : 2000-07-09 DOI: 10.1007/3-540-45022-X_36
R. Karp
{"title":"The Genomics Revolution and its Challenges for Algorithmic Research","authors":"R. Karp","doi":"10.1007/3-540-45022-X_36","DOIUrl":"https://doi.org/10.1007/3-540-45022-X_36","url":null,"abstract":"","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2000-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132335733","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 5
Current Trends in Theoretical Computer Science - Essays and Tutorials 理论计算机科学的当前趋势-论文和教程
Current Trends in Theoretical Computer Science Pub Date : 1993-06-01 DOI: 10.1142/2085
G. Rozenberg, A. Salomaa
{"title":"Current Trends in Theoretical Computer Science - Essays and Tutorials","authors":"G. Rozenberg, A. Salomaa","doi":"10.1142/2085","DOIUrl":"https://doi.org/10.1142/2085","url":null,"abstract":"Part 1 Computational geometry, H. Edelsbrunner et al. Part 2 Algebraic specification, H. Ehrig et al: on the potential role of algebraic specification within computer science, H. Ehrig and P. Pepper linking schemas and module specifications - a proposal, H. Ehrig and M.A. Arbib a short Oxford survey of order sorted algebra, J. Goguen and R. Diaconescu. Part 3 Logic in comptuer science, Y. Gurevich et al: on Kolmogorov machines and related issues Topoi and computation, A. Blass. Part 4 Structural complexity, J. Hartmanis et al Goedel, von Neumann and the P=? NP problem counting hierarchies - polynomial time and constant depth circuits, E.W. Allender and K.W. Wagner. Part 5 Formal language theory, A. Salomaa et al decidability in finite automata parallel communicating grammar systems, L. Santean. (Part contents).","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1993-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126960280","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 17
On IP = PSPACE and Theorems with Narrow Proofs 关于IP = PSPACE及其窄证明定理
Current Trends in Theoretical Computer Science Pub Date : 1990-05-01 DOI: 10.1142/9789812794499_0036
J. Hartmanis, Richard Chang, D. Ranjan, P. Rohatgi
{"title":"On IP = PSPACE and Theorems with Narrow Proofs","authors":"J. Hartmanis, Richard Chang, D. Ranjan, P. Rohatgi","doi":"10.1142/9789812794499_0036","DOIUrl":"https://doi.org/10.1142/9789812794499_0036","url":null,"abstract":"Very recently, it was shown that the class of languages with interactive proofs, IP, is exactly the class PSPACE. This surprising result elegantly places IP in the standard classification of feasible computations. Furthermore, the IP = PSPACE result reveals some very interesting and unsuspected properties of mathematical proofs. In this column, we define the width of a proof in a formal system $cal F$ and show that it is an intuitively satisfying and robust definition. Then, using the IP = PSPACE result, it is seen that the width of a proof (as opposed to the length) determines how quickly one can give overwhelming evidence that a theorem is provable without showing the full proof.","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1990-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130581068","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 7
Gödel, von Neumann and the P =? NP Problem Gödel,冯·诺伊曼和P =?NP问题
Current Trends in Theoretical Computer Science Pub Date : 1989-04-01 DOI: 10.1142/9789812794499_0033
J. Hartmanis
{"title":"Gödel, von Neumann and the P =? NP Problem","authors":"J. Hartmanis","doi":"10.1142/9789812794499_0033","DOIUrl":"https://doi.org/10.1142/9789812794499_0033","url":null,"abstract":"","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1989-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124927826","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 47
Some Observations about Relativization of Space Bounded Computations 关于空间有界计算的相对论性的一些观察
Current Trends in Theoretical Computer Science Pub Date : 1988-05-01 DOI: 10.1142/9789812794499_0031
J. Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell
{"title":"Some Observations about Relativization of Space Bounded Computations","authors":"J. Hartmanis, Richard Chang, Jim Kadin, Stephen G. Mitchell","doi":"10.1142/9789812794499_0031","DOIUrl":"https://doi.org/10.1142/9789812794499_0031","url":null,"abstract":"In this column we explore what relativization says about space bounded computations and what recent results about space bounded computations say about relativization. There is a strong belief in computational complexity circles that problems which can be relativized in two contradictory ways are very hard to solve. We believe that such problems can only be solved by proof techniques that do not relativize. For example, standard diagonalization methods are powerless in these cases [BGS75, HH76, Hop84]. So far only very simple problems with contradictory relativizations have been solved [Har85, Cha90]. Unfortunately, many important problems in complexity theory have contradictory relativizations and have to be viewed as inaccessible to","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1988-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130212604","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Collapsing Hierarchies 崩溃的层次结构
Current Trends in Theoretical Computer Science Pub Date : 1987-09-01 DOI: 10.1142/9789812794499_0030
J. Hartmanis
{"title":"Collapsing Hierarchies","authors":"J. Hartmanis","doi":"10.1142/9789812794499_0030","DOIUrl":"https://doi.org/10.1142/9789812794499_0030","url":null,"abstract":"","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"57 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1987-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125837670","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
Structural Complexity 结构的复杂性
Current Trends in Theoretical Computer Science Pub Date : 1900-01-01 DOI: 10.1142/9789812794499_others04
J. Hartmanis
{"title":"Structural Complexity","authors":"J. Hartmanis","doi":"10.1142/9789812794499_others04","DOIUrl":"https://doi.org/10.1142/9789812794499_others04","url":null,"abstract":"","PeriodicalId":298301,"journal":{"name":"Current Trends in Theoretical Computer Science","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130412874","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书