Skip to main content

All Questions

5 questions with no upvoted or accepted answers
Filter by
Sorted by
Tagged with
9 votes
0 answers
306 views

Coding third-order objects via second-order ones

As is well-known, the language of second-order arithmetic only has variables for natural numbers and sets of natural numbers. Higher-order objects, like functions on $\mathbb{R}$, have to be ...
Sam Sanders's user avatar
  • 4,359
3 votes
0 answers
87 views

Is the probability distribution of a graphon given as a graph limit computable?

Let $G_i$ be a sequence of finite graphs that is Cauchy in the space of graphons. That is, for every $\epsilon \in \mathbb Q_+$ there is a $N \in \mathbb N$ such that $$\forall n, m > N. \delta_\...
Christopher King's user avatar
3 votes
0 answers
186 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 \...
Amin's user avatar
  • 128
2 votes
0 answers
142 views

Can a path in Kleene's $\mathcal{O}$ enumerate all of the computable reals via uniform diagonalization?

It's a well-known fact that there are computable diagonalization functions on Baire space $\mathbb{B} = \mathbb{N}^\mathbb{N}$ (i.e., functions which take a sequence $(r_i)_{i\in \mathbb{N}}$ of ...
James E Hanson's user avatar
2 votes
0 answers
103 views

Buridan's principle in computable analysis

In (Lamport, 2012), Lamport proposes the principle A discrete decision based upon an input having a continuous range of values cannot be made within a bounded length of time. I think it could be ...
MaudPieTheRocktorate's user avatar