找回密码
 To register

QQ登录

只需一步,快速开始

扫一扫,访问微社区

Titlebook: Handbook of Computability and Complexity in Analysis; Vasco Brattka,Peter Hertling Book 2021 Springer Nature Switzerland AG 2021 Computati

[复制链接]
查看: 30115|回复: 47
发表于 2025-3-21 19:30:25 | 显示全部楼层 |阅读模式
书目名称Handbook of Computability and Complexity in Analysis
编辑Vasco Brattka,Peter Hertling
视频video
概述Computability and complexity theory are two central areas of research in mathematical logic and theoretical computer science.Researchers and graduate students will appreciate the book‘s systematic int
丛书名称Theory and Applications of Computability
图书封面Titlebook: Handbook of Computability and Complexity in Analysis;  Vasco Brattka,Peter Hertling Book 2021 Springer Nature Switzerland AG 2021 Computati
描述.Computable analysis is the modern theory of computability and complexity in analysis that arose out of Turing‘s seminal work in the 1930s. This was motivated by questions such as: which real numbers and real number functions are computable, and which mathematical tasks in analysis can be solved by algorithmic means?.Nowadays this theory has many different facets that embrace topics from computability theory, algorithmic randomness, computational complexity, dynamical systems, fractals, and analog computers, up to logic, descriptive set theory, constructivism, and reverse mathematics. In recent decades computable analysis has invaded many branches of analysis, and researchers have studied computability and complexity questions arising from real and complex analysis, functional analysis, and the theory of differential equations, up to (geometric) measure theory and topology..This handbook represents the first coherent cross-section through most active research topics on the more theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapte
出版日期Book 2021
关键词Computational complexity; Algorithmic randomness; Computability; Domain theory and analysis; Computable
版次1
doihttps://doi.org/10.1007/978-3-030-59234-9
isbn_softcover978-3-030-59236-3
isbn_ebook978-3-030-59234-9Series ISSN 2190-619X Series E-ISSN 2190-6203
issn_series 2190-619X
copyrightSpringer Nature Switzerland AG 2021
The information of publication is updating

书目名称Handbook of Computability and Complexity in Analysis影响因子(影响力)




书目名称Handbook of Computability and Complexity in Analysis影响因子(影响力)学科排名




书目名称Handbook of Computability and Complexity in Analysis网络公开度




书目名称Handbook of Computability and Complexity in Analysis网络公开度学科排名




书目名称Handbook of Computability and Complexity in Analysis被引频次




书目名称Handbook of Computability and Complexity in Analysis被引频次学科排名




书目名称Handbook of Computability and Complexity in Analysis年度引用




书目名称Handbook of Computability and Complexity in Analysis年度引用学科排名




书目名称Handbook of Computability and Complexity in Analysis读者反馈




书目名称Handbook of Computability and Complexity in Analysis读者反馈学科排名




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

0票 0.00%

Perfect with Aesthetics

 

0票 0.00%

Better Implies Difficulty

 

0票 0.00%

Good and Satisfactory

 

0票 0.00%

Adverse Performance

 

1票 100.00%

Disdainful Garbage

您所在的用户组没有投票权限
发表于 2025-3-21 23:56:38 | 显示全部楼层
,Eine Kinderlehre während der Nacht, has about the approximation, one gets several natural classes between these two classes of real numbers. In this paper we review the most natural classes which have been investigated over the past decades with respect to this viewpoint. Most of these classes can be characterized in different ways,
发表于 2025-3-22 01:54:33 | 显示全部楼层
发表于 2025-3-22 08:26:54 | 显示全部楼层
2190-619X re theoretical side of the field. It contains 11 chapters grouped into parts on computability in analysis; complexity, dynamics, and randomness; and constructivity, logic, and descriptive complexity. All chapte978-3-030-59236-3978-3-030-59234-9Series ISSN 2190-619X Series E-ISSN 2190-6203
发表于 2025-3-22 10:09:15 | 显示全部楼层
Computability of Real Numbers has about the approximation, one gets several natural classes between these two classes of real numbers. In this paper we review the most natural classes which have been investigated over the past decades with respect to this viewpoint. Most of these classes can be characterized in different ways,
发表于 2025-3-22 15:11:50 | 显示全部楼层
发表于 2025-3-22 20:53:12 | 显示全部楼层
Theory and Applications of Computabilityhttp://image.papertrans.cn/h/image/421069.jpg
发表于 2025-3-22 22:03:30 | 显示全部楼层
发表于 2025-3-23 03:42:11 | 显示全部楼层
发表于 2025-3-23 09:05:18 | 显示全部楼层
Handbook of Computability and Complexity in Analysis978-3-030-59234-9Series ISSN 2190-619X Series E-ISSN 2190-6203
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 SITEMAP 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-5-15 11:59
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表