{"title":"Progressions of Theories of Bounded Arithmetic","authors":"Robert A. Di Paola, F. Montagna","doi":"10.1201/9780429187490-5","DOIUrl":"https://doi.org/10.1201/9780429187490-5","url":null,"abstract":"","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123866873","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":"Beyond Gödel’s Theorem: The Failure to Capture Information Content","authors":"S. Cooper","doi":"10.1201/9780429187490-4","DOIUrl":"https://doi.org/10.1201/9780429187490-4","url":null,"abstract":"","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"100 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131459988","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":"Resource-Bounded Measure and Randomness","authors":"K. Ambos-Spies, E. Mayordomo","doi":"10.1201/9780429187490-1","DOIUrl":"https://doi.org/10.1201/9780429187490-1","url":null,"abstract":"We survey recent results on resource-bounded measure and random-ness in structural complexity theory. In particular, we discuss applications of these concepts to the exponential time complexity classes E and E2. Moreover, we treat time-bounded genericity and stochasticity concepts which are weaker than time-bounded randomness but which suuce for many of the applications in complexity theory.","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128828161","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":"Short Course on Logic, Algebra, and Topology","authors":"P. Odifreddi","doi":"10.1201/9780429187490-10","DOIUrl":"https://doi.org/10.1201/9780429187490-10","url":null,"abstract":"","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126327148","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 Convenience of Tilings","authors":"P. E. Boas","doi":"10.1201/9780429187490-12","DOIUrl":"https://doi.org/10.1201/9780429187490-12","url":null,"abstract":"Tiling problems provide for a very simple and transparent mechanism for encod ing machine computations This gives rise to rather simple master reductions showing various versions of the tiling problem complete for various complexity classes We in vestigate the potential for using these tiling problems in subsequent reductions showing hardness of the combinatorial problems that really matter We ilustrate our approach by means of three examples a short reduction chain to the Knapsack problem followed by a Hilbert reduction using similar ingredients Finally we reprove the Deterministic Exponential Time lowerbound for satis ablility in Propositional Dynamic Logic The resulting reductions are relatively simple they do however infringe on the principle of orthogonality of reductions since they abuse extra structure in the in stances of the problems reduced from which results from the fact that these instances were generated by a master reduction previously","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"63 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134263837","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":"Degree Structures in Local Degree Theory","authors":"M. Arslanov","doi":"10.1201/9780429187490-2","DOIUrl":"https://doi.org/10.1201/9780429187490-2","url":null,"abstract":"","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130738563","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":"A Survey of Inductive Inference with an Emphasis on Queries","authors":"W. Gasarch, Carl Smith","doi":"10.1201/9780429187490-8","DOIUrl":"https://doi.org/10.1201/9780429187490-8","url":null,"abstract":"","PeriodicalId":420984,"journal":{"name":"complexity, logic, and recursion theory","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-05-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116549255","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}
京公网安备 11010802042870号
求助内容：
应助结果提醒方式：