{"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}
{"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}
{"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}
{"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}
{"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}
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}
{"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}
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}