GOLF
发表于 2025-3-21 20:08:10
书目名称Computability and Complexity in Analysis影响因子(影响力)<br> http://impactfactor.cn/if/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis影响因子(影响力)学科排名<br> http://impactfactor.cn/ifr/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis网络公开度<br> http://impactfactor.cn/at/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis网络公开度学科排名<br> http://impactfactor.cn/atr/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis被引频次<br> http://impactfactor.cn/tc/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis被引频次学科排名<br> http://impactfactor.cn/tcr/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis年度引用<br> http://impactfactor.cn/ii/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis年度引用学科排名<br> http://impactfactor.cn/iir/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis读者反馈<br> http://impactfactor.cn/5y/?ISSN=BK0232029<br><br> <br><br>书目名称Computability and Complexity in Analysis读者反馈学科排名<br> http://impactfactor.cn/5yr/?ISSN=BK0232029<br><br> <br><br>
FLING
发表于 2025-3-21 20:44:41
http://reply.papertrans.cn/24/2321/232029/232029_2.png
首创精神
发表于 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
Frequency
发表于 2025-3-22 04:43:20
http://reply.papertrans.cn/24/2321/232029/232029_4.png
Hangar
发表于 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.
易于交谈
发表于 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
http://reply.papertrans.cn/24/2321/232029/232029_7.png
d-limonene
发表于 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
猛击
发表于 2025-3-23 04:18:24
http://reply.papertrans.cn/24/2321/232029/232029_9.png
挖掘
发表于 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