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

Computability and Complexity最新文献

筛选
英文 中文
Computable Model Theory over the Reals 实数上的可计算模型理论
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_22
A. Morozov
{"title":"Computable Model Theory over the Reals","authors":"A. Morozov","doi":"10.1007/978-3-319-50062-1_22","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_22","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"25 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":"122844492","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
Some Questions in Computable Mathematics 可计算数学中的几个问题
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_4
D. Hirschfeldt
{"title":"Some Questions in Computable Mathematics","authors":"D. Hirschfeldt","doi":"10.1007/978-3-319-50062-1_4","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_4","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"79 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":"129537044","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
Introduction to Autoreducibility and Mitoticity 自还原性和有丝分裂性简介
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_5
Christian Glaßer, D. Nguyen, A. Selman, M. Witek
{"title":"Introduction to Autoreducibility and Mitoticity","authors":"Christian Glaßer, D. Nguyen, A. Selman, M. Witek","doi":"10.1007/978-3-319-50062-1_5","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_5","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"35 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":"129828116","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}
引用次数: 3
On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets 论可计算枚举集的强有界图灵度
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_34
K. Ambos-Spies
{"title":"On the Strongly Bounded Turing Degrees of the Computably Enumerable Sets","authors":"K. Ambos-Spies","doi":"10.1007/978-3-319-50062-1_34","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_34","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":" 47","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132187776","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}
引用次数: 3
Parallel and Serial Jumps of Weak Weak König's Lemma 弱弱König引理的平行和连续跳跃
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_15
L. Bienvenu, R. Kuyper
{"title":"Parallel and Serial Jumps of Weak Weak König's Lemma","authors":"L. Bienvenu, R. Kuyper","doi":"10.1007/978-3-319-50062-1_15","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_15","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"14 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":"125423029","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}
引用次数: 3
On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals 论Barmpalias和Lewis-Pye的作品:D.C.E.真实的推导
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_39
Joseph S. Miller
{"title":"On Work of Barmpalias and Lewis-Pye: A Derivation on the D.C.E. Reals","authors":"Joseph S. Miller","doi":"10.1007/978-3-319-50062-1_39","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_39","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"168-169 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":"121285667","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
Prequel to the Cornell Computer Science Department 康奈尔计算机科学系的前传
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_3
A. Nerode
{"title":"Prequel to the Cornell Computer Science Department","authors":"A. Nerode","doi":"10.1007/978-3-319-50062-1_3","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_3","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"95 8 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":"127990878","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
The Complexity of Complexity 复杂中的复杂
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_6
E. Allender
{"title":"The Complexity of Complexity","authors":"E. Allender","doi":"10.1007/978-3-319-50062-1_6","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_6","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":"123923694","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}
引用次数: 39
On Being Rod's Graduate Student 作为罗德的研究生
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_9
K. Ng
{"title":"On Being Rod's Graduate Student","authors":"K. Ng","doi":"10.1007/978-3-319-50062-1_9","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_9","url":null,"abstract":"","PeriodicalId":309016,"journal":{"name":"Computability and Complexity","volume":"12 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":"126086965","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
Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions 递归有界DNR函数的图灵度和Muchnik度
Computability and Complexity Pub Date : 1900-01-01 DOI: 10.1007/978-3-319-50062-1_40
S. G. Simpson
{"title":"Turing Degrees and Muchnik Degrees of Recursively Bounded DNR Functions","authors":"S. G. Simpson","doi":"10.1007/978-3-319-50062-1_40","DOIUrl":"https://doi.org/10.1007/978-3-319-50062-1_40","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":"129900522","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
首页 上一页 下一页 尾页
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学术官方微信