找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Recursion Theory Week; Proceedings of a Con Klaus Ambos-Spies,Gert H. Müller,Gerald E. Sacks Conference proceedings 1990 Springer-Verlag Be

[复制链接]
查看: 50191|回复: 59
发表于 2025-3-21 20:04:57 | 显示全部楼层 |阅读模式
书目名称Recursion Theory Week
副标题Proceedings of a Con
编辑Klaus Ambos-Spies,Gert H. Müller,Gerald E. Sacks
视频video
丛书名称Lecture Notes in Mathematics
图书封面Titlebook: Recursion Theory Week; Proceedings of a Con Klaus Ambos-Spies,Gert H. Müller,Gerald E. Sacks Conference proceedings 1990 Springer-Verlag Be
描述These proceedings contain research and survey papers from many subfields of recursion theory, with emphasis on degree theory, in particular the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.
出版日期Conference proceedings 1990
关键词complexity; complexity theory; computability; computability theory; proof; turing degree
版次1
doihttps://doi.org/10.1007/BFb0086109
isbn_softcover978-3-540-52772-5
isbn_ebook978-3-540-47142-4Series ISSN 0075-8434 Series E-ISSN 1617-9692
issn_series 0075-8434
copyrightSpringer-Verlag Berlin Heidelberg 1990
The information of publication is updating

书目名称Recursion Theory Week影响因子(影响力)




书目名称Recursion Theory Week影响因子(影响力)学科排名




书目名称Recursion Theory Week网络公开度




书目名称Recursion Theory Week网络公开度学科排名




书目名称Recursion Theory Week被引频次




书目名称Recursion Theory Week被引频次学科排名




书目名称Recursion Theory Week年度引用




书目名称Recursion Theory Week年度引用学科排名




书目名称Recursion Theory Week读者反馈




书目名称Recursion Theory Week读者反馈学科排名




单选投票, 共有 1 人参与投票
 

0票 0.00%

Perfect with Aesthetics

 

1票 100.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

0票 0.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 22:23:24 | 显示全部楼层
发表于 2025-3-22 02:43:05 | 显示全部楼层
发表于 2025-3-22 07:42:27 | 显示全部楼层
0075-8434 the development of frameworks for current techniques in this field. Other topics covered include computational complexity theory, generalized recursion theory, proof theoretic questions in recursion theory, and recursive mathematics.978-3-540-52772-5978-3-540-47142-4Series ISSN 0075-8434 Series E-ISSN 1617-9692
发表于 2025-3-22 12:34:38 | 显示全部楼层
发表于 2025-3-22 15:11:05 | 显示全部楼层
https://doi.org/10.1007/BFb0086109complexity; complexity theory; computability; computability theory; proof; turing degree
发表于 2025-3-22 17:42:30 | 显示全部楼层
发表于 2025-3-22 21:52:00 | 显示全部楼层
Priority arguments using iterated trees of strategies,A general framework for priority arguments in classical recursion theory, using iterated trees of strategies, is introduced and used to present new proofs of four fundamental theorems of recursion theory.
发表于 2025-3-23 02:16:15 | 显示全部楼层
发表于 2025-3-23 08:37:02 | 显示全部楼层
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-6-20 17:43
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表