发布求助
文献互助 智能选刊 最新文献

Computability and Complexity最新文献

筛选
英文 中文
Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday 可计算性与复杂性——献给罗德尼·g·唐尼60岁生日的随笔
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1
A. Day, M. Fellows, Noam Greenberg, B. Khoussainov, A. Melnikov, Frances A. Rosamond
{"title":"Computability and Complexity - Essays Dedicated to Rodney G. Downey on the Occasion of His 60th Birthday","authors":"A. Day, M. Fellows, Noam Greenberg, B. Khoussainov, A. Melnikov, Frances A. Rosamond","doi":"10.1007/978-3-319-50062-1","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"73 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":"117270727","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}
引用次数: 11
On the Reals Which Cannot Be Random 论不可能随机的现实
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_36
Liang Yu, Yizheng Zhu
{"title":"On the Reals Which Cannot Be Random","authors":"Liang Yu, Yizheng Zhu","doi":"10.1007/978-3-319-50062-1_36","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_36","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"14 6 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":"130512817","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}
引用次数: 1
A Survey on Universal Computably Enumerable Equivalence Relations 关于普遍可计算可数等价关系的综述
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_25
U. Andrews, S. Badaev, A. Sorbi
{"title":"A Survey on Universal Computably Enumerable Equivalence Relations","authors":"U. Andrews, S. Badaev, A. Sorbi","doi":"10.1007/978-3-319-50062-1_25","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_25","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"38 9 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":"130939020","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}
引用次数: 33
Strength and Weakness in Computable Structure Theory 可计算结构理论的优缺点
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_20
Johanna N. Y. Franklin
{"title":"Strength and Weakness in Computable Structure Theory","authors":"Johanna N. Y. Franklin","doi":"10.1007/978-3-319-50062-1_20","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_20","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"15 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":"127731047","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
Effectively Existentially-Atomic Structures 有效存在-原子结构
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_16
A. Montalbán
{"title":"Effectively Existentially-Atomic Structures","authors":"A. Montalbán","doi":"10.1007/978-3-319-50062-1_16","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_16","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"43 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":"124538860","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}
引用次数: 6
Enumeration Reducibility and Computable Structure Theory 枚举可约性与可计算结构理论
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_19
Alexandra A. Soskova, M. Soskova
{"title":"Enumeration Reducibility and Computable Structure Theory","authors":"Alexandra A. Soskova, M. Soskova","doi":"10.1007/978-3-319-50062-1_19","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_19","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"119 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":"122470724","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
Weakly Represented Families in Reverse Mathematics 逆数学中的弱表示族
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_13
R. Hölzl, Dilip Raghavan, F. Stephan, Jing Zhang
{"title":"Weakly Represented Families in Reverse Mathematics","authors":"R. Hölzl, Dilip Raghavan, F. Stephan, Jing Zhang","doi":"10.1007/978-3-319-50062-1_13","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_13","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"18 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":"127158866","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
Complexity with Rod 杆的复杂性
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_8
L. Fortnow
{"title":"Complexity with Rod","authors":"L. Fortnow","doi":"10.1007/978-3-319-50062-1_8","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_8","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"84 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":"124952496","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
There Are No Maximal d.c.e. wtt-degrees 没有最大的d.c.e. wtt度
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_28
Guohua Wu, M. Yamaleev
{"title":"There Are No Maximal d.c.e. wtt-degrees","authors":"Guohua Wu, M. Yamaleev","doi":"10.1007/978-3-319-50062-1_28","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_28","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"1 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":"128883083","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}
引用次数: 2
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信