nautical 发表于 2025-3-26 22:56:40

Effective Contraction Theorem and Its Applicationtheorem. We give, in this paper, three examples, the effective implicit function theorem, the result on computability of self similar sets by Kamo and Kawamura, and computability of the Takagi function.

avulsion 发表于 2025-3-27 03:26:03

Lauro Cortigiani,Eugenio Picano-Fourier coefficients of an effectively integrable function . form a computable sequence of reals. It is also proved that ...., where ... is the partial sum of the Walsh-Fourier series, Fine-converges effectively locally uniformly to ..

investigate 发表于 2025-3-27 06:52:11

http://reply.papertrans.cn/24/2321/232029/232029_33.png

一小块 发表于 2025-3-27 12:50:08

Lauro Cortigiani,Eugenio Picanos (equipped with the total sequential continuous functions as morphisms) turns out to be bicartesian-closed. It contains all countably-based ..-spaces. Thus, a reasonable computability theory is possible on important non countably-based topological spaces as well as on non topological spaces.

Nonconformist 发表于 2025-3-27 15:04:39

Pathogenetic Mechanisms of Stresses,al time computability. This paper show the fixed point theorem for such non-computably separable spaces. This theorem is proved with iteration of Type-2 functionals. As an example of that, this paper shows that Takagi function is a polynomial time computable function.

课程 发表于 2025-3-27 18:52:16

http://reply.papertrans.cn/24/2321/232029/232029_36.png

FLEET 发表于 2025-3-28 00:02:32

The Uniformity Conjecturenjecture are compared with some known results about closeness of approximation from Liouville, Baker, Waldschmidt, Thue-Siegel-Roth. A few of many practical computational consequences are stated. Also the problem of searching for a possible counterexample to the Uniformity Conjecture is discussed and some preliminary results are given.

Palpable 发表于 2025-3-28 05:06:41

Admissible Representations of Limit Spacess (equipped with the total sequential continuous functions as morphisms) turns out to be bicartesian-closed. It contains all countably-based ..-spaces. Thus, a reasonable computability theory is possible on important non countably-based topological spaces as well as on non topological spaces.

GLUT 发表于 2025-3-28 09:20:02

http://reply.papertrans.cn/24/2321/232029/232029_39.png

Mediocre 发表于 2025-3-28 11:54:07

http://reply.papertrans.cn/24/2321/232029/232029_40.png
页: 1 2 3 [4] 5 6 7
查看完整版本: Titlebook: Computability and Complexity in Analysis; 4th International Wo Jens Blanck,Vasco Brattka,Peter Hertling Conference proceedings 2001 Springe