设为首页收藏本站
开启辅助访问 切换到窄版

 找回密码
 To register

QQ登录

只需一步，快速开始

扫一扫，访问微社区

  • ALL
  • Journals
  • Books

派博传思国际中心 »期刊书目

› BOOKS
› BOOKS with Alphabet C (Ca, Cb,Cc, Cd, Ce…... )

1234567下一页
返回列表

Titlebook: Computability and Complexity in Analysis; 4th International Wo Jens Blanck,Vasco Brattka,Peter Hertling Conference proceedings 2001 Springe

[复制链接]
查看: 40984|回复: 63
发表于 2025-3-21 20:08:10 | 显示全部楼层 |阅读模式
书目名称Computability and Complexity in Analysis
副标题4th International Wo
编辑Jens Blanck,Vasco Brattka,Peter Hertling
视频videohttp://file.papertrans.cn/233/232029/232029.mp4
概述Includes supplementary material:
丛书名称Lecture Notes in Computer Science
图书封面Titlebook: Computability and Complexity in Analysis; 4th International Wo Jens Blanck,Vasco Brattka,Peter Hertling Conference proceedings 2001 Springe
描述The workshop on Computability and Complexity in Analysis, CCA 2000, was hosted by the Department of Computer Science of the University of Wales Swansea, September 17{19, 2000. It was the fourth workshop in a successful series of workshops: CCA’95 in Hagen, Germany, CCA’96 in Trier, Germany, and CCA’98 in Brno, Czech Republic. About 40 participants from the countries United Kingdom, Germany, Japan, Italy, Russia, France, Denmark, Greece, and Ireland contributed to the success of this meeting. Altogether, 28 talkswere p- sented in Swansea. These proceedings include 23 papers which represent a cro- section through recent research on computability and complexity in analysis. The workshop succeeded in bringing together people interested in computability and complexity aspects of analysis and in exploring connections with nume- cal methods, physics and, of course, computer science. It was rounded o by a number of talks and papers on exact computer arithmetic and by a competition of v e implemented systems. A report on this competition has been included in these proceedings. We would like to thank the authors for their contributions and the referees for their careful work, and we hope for
出版日期Conference proceedings 2001
关键词Analysis; Arithmetic; C++ programming language; Complexity Theory; Computability; Computational Complexit
版次1
doihttps://doi.org/10.1007/3-540-45335-0
isbn_softcover978-3-540-42197-9
isbn_ebook978-3-540-45335-2Series ISSN 0302-9743 Series E-ISSN 1611-3349
issn_series 0302-9743
copyrightSpringer-Verlag Berlin Heidelberg 2001
The information of publication is updating

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




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




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




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




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




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




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




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




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




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




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

0票 0.00%

Perfect with Aesthetics
2.jpg
 

0票 0.00%

Better Implies Difficulty
3.jpg
 

1票 100.00%

Good and Satisfactory
4.jpg
 

0票 0.00%

Adverse Performance
5.jpg
 

0票 0.00%

Disdainful Garbage
您所在的用户组没有投票权限
GOLF
回复

举报

发表于 2025-3-21 20:44:41 | 显示全部楼层
FLING
回复

举报

发表于 2025-3-22 02:12:46 | 显示全部楼层
A Survey of Exact Arithmetic Implementationsons for the performance differences displayed by some of the competing systems at this years CCA Exact Arithmetic Competition..Because the practical aspects of the field of exact arithmetic are at an early stage, and many of the systems are prototypes, we have not discussed: portability, user-interf
首创精神
回复

举报

发表于 2025-3-22 04:43:20 | 显示全部楼层
Frequency
回复

举报

发表于 2025-3-22 11:59:47 | 显示全部楼层
Banach-Mazur Computable Functions on Metric Spacesspaces satisfying suitable computability conditions. Additionally, we prove that the image of a computable, computably convergent sequence under a Banach-Mazur computable function is again computably convergent.
Hangar
回复

举报

发表于 2025-3-22 14:26:00 | 显示全部楼层
Effective Contraction Theorem and Its Application we present an effective version of the contraction theorem. We show that if the contraction is a computable function on an effectively locally compact metric space, then the fixed point is a computable point on the space. Many facts on computability can be proved by using the effective contraction
易于交谈
回复

举报

发表于 2025-3-22 18:18:56 | 显示全部楼层
易于交谈
回复

举报

发表于 2025-3-22 22:11:13 | 显示全部楼层
On the Computational Content of the Krasnoselski and Ishikawa Fixed Point Theoremsed with the fixed point theory of nonexpansive selfmappings . of convex sets . in normed spaces. We study Krasnoselski and more general so-called Krasnoselski-Mann iterations which converge to fixed points of . under certain compactness conditions. But, as we show, already for uniformly convex space
d-limonene
回复

举报

发表于 2025-3-23 04:18:24 | 显示全部楼层
猛击
回复

举报

发表于 2025-3-23 06:23:38 | 显示全部楼层
δ-Approximable FunctionsBSS machine . when its comparisons are against −δ rather than 0, we study classes of functions . for which ϕ. → . in some sense (pointwise, uniformly, etc.). The main equivalence results show that this notion coincides with Type 2 computability when the convergence speed is recursively bounded. Fina
挖掘
回复

举报

下一页 »
1234567下一页
返回列表
 关于派博传思  派博传思旗下网站  友情链接
派博传思介绍 公司地理位置 论文服务流程 影响因子官网 吾爱论文网 大讲堂 北京大学 Oxford Uni. Harvard Uni.
发展历史沿革 期刊点评 投稿经验总结 SCIENCEGARD IMPACTFACTOR 派博系数 清华大学 Yale Uni. Stanford Uni.
QQ|Archiver|手机版|小黑屋| 派博传思国际 ( 京公网安备110108008328) GMT+8, 2025-7-12 08:28
Copyright © 2001-2015 派博传思   京公网安备110108008328 版权所有 All rights reserved
快速回复 返回顶部 返回列表