The computable-analysis tag has no usage guidance.

**0**

votes

**0**answers

70 views

### Weak Topology and Domain Theory: Which topology on the function domain restricts to the weak topology on C([0,1])?

Let $\mathbb{IR}$ be the interval domain over the set $\mathbb{R}$ of real numbers, defined by:
$$\mathbb{IR} := \{ [a,b] \mid a, b \in \mathbb{R}, a \leq b\} \cup \{ \mathbb{R}\},$$
and ordered by ...

**2**

votes

**0**answers

150 views

### Banach spaces: A ball being a subset of the interior of the union of two balls

Let $X$ be a separable reflexive Banach space and let $A$, $B_1$, and $B_2$ be three closed balls in $X$. Is there a `handy' necessary and sufficient condition for checking whether $A \subseteq (B_1 \...

**4**

votes

**1**answer

103 views

### Are these two definitions of arithmetical hierarchy of real numbers equivalent?

Zheng and Weihrauch (http://www-sst.informatik.tu-cottbus.de/~wwwti/zheng/publications/1999/mfcs99.pdf) define a real number $x$ to be $\Sigma_n$ if and only if there is a computable function $f:\...

**4**

votes

**1**answer

120 views

### Is the following product-like space a Polish space?

Let $\mathcal{M}_1(\mathbb R)$ denote the space of Borel probability measures on $\mathbb R$. The space is a Polish space (a space which admits a complete, separable, metric) using, say the Levy-...

**1**

vote

**1**answer

100 views

### floating point representation via the perspective of TTE/computable analysis

Floating point numbers are not compatible with the usual theory of type 2 theory of effectivity (TTE), and not even the real-RAM model; there are functions that are computable in one model but not ...

**10**

votes

**1**answer

602 views

### Is this property equivalent to Lusin's property (N) for continuous functions?

A function $F:[0,1]\rightarrow\mathbb{R}$ satisfies Lusin's (N) property if for every measure zero set $A\subseteq [0,1]$, $F(A)$ has measure zero. (This includes the assertion that $F(A)$ is ...

**17**

votes

**1**answer

609 views

### An NP-hard $n$ fold integral

We are given rational numbers $[c_1, c_2, \ldots, c_n]$ and $v$ from the interval $[0,1]$.
Consider the $n$-fold integral
$$
J = \int_{\theta_1 \in I_1, \theta_2 \in I_2 \ldots, \theta_n \in I_n} d\...

**12**

votes

**1**answer

699 views

### Can nonstandard analysis be used to prove results in constructive or computable analysis?

Nonstandard analysis is a useful tool which can be used to prove a number of results in analysis.
Question
Can it also be used to prove results in computable or constructive analysis?
If ...

**5**

votes

**1**answer

237 views

### tennenbaum phenomena for the reals?

Let $\mathfrak{M} = \langle R, +,\times,> \rangle$ be such that $R$ is the set of real numbers and $\mathfrak{M} \models RA^1$ (the first-order axioms for the reals). Do we have characterisations ...

**11**

votes

**1**answer

360 views

### The complexity of the leading fractional bit of a power of a rational number

On a mailing list (math-fun) that I subscribe to Dan Asimov asked what's the most efficient way to calculate the leading decimal digits (say 10 of them) of $(p/q)^n \bmod 1$ where $p$ and $q$ are ...

**5**

votes

**2**answers

696 views

### Simple example of a sequence without computable modulus of convergence

Can anyone give a simple example of a sequence that converges, but there's no computable function that gives $N$ as a function of $\epsilon$, i.e., the modulus of convergence is not computable?
In ...

**2**

votes

**0**answers

290 views

### Computable distribution on [0,1] with C-infinity distribution function

Does anyone know of an easily-describable distribution on $[0,1]$ with a density $p$ (with respect to Lebesgue measure) that satisfies the following properties:
$p$ is $C^\infty$
$p(0) = a$, $p(1) = ...

**4**

votes

**5**answers

631 views

### Uncomputability of the identity relation on computable real numbers

Let $f_{=}$ be a function from $\mathbb{R}^{2}$ be defined as follows:
(1) if $x = y$ then $f_{=}(x,y) = 1$;
(2) $f_{x,y} = 0$ otherwise.
I would like to have a proof for / a reference to a textbook ...

**10**

votes

**3**answers

1k views

### Differentiability of computable functions

Call a computable function a total function $\mathbb{R} \to \mathbb{R}$, for which there exists a Turing machine outputting arbitrary close approximation to $f(x)$ given arbitrary close approximation ...