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

GOLF

書目名稱Computability and Complexity in Analysis影響因子(影響力)




書目名稱Computability and Complexity in Analysis影響因子(影響力)學(xué)科排名




書目名稱Computability and Complexity in Analysis網(wǎng)絡(luò)公開度




書目名稱Computability and Complexity in Analysis網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Computability and Complexity in Analysis被引頻次




書目名稱Computability and Complexity in Analysis被引頻次學(xué)科排名




書目名稱Computability and Complexity in Analysis年度引用




書目名稱Computability and Complexity in Analysis年度引用學(xué)科排名




書目名稱Computability and Complexity in Analysis讀者反饋




書目名稱Computability and Complexity in Analysis讀者反饋學(xué)科排名

FLING

首創(chuàng)精神

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

Hangar

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.

易于交談

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

易于交談

d-limonene

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

猛擊

挖掘

δ-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