相关论文: Turing Incomparability in Scott Sets

Let K be a self-similar or self-affine set in R^d, let \mu be a self-similar or self-affine measure on it, and let G be the group of affine maps, similitudes, isometries or translations of R^d. Under various assumptions (such as separation…

We construct certain non-degenerate maps and sets, mainly in the complex-analytic category. For example, we show that for every countable subset S in an irreducible complex space X there exists a holomorphic map from the unit disk to X such…

Given a countable structure $\mathcal{A}$, the degree spectrum of $\mathcal{A}$ is the set of all Turing degrees which can compute an isomorphic copy of $\mathcal{A}$. One of the major programs in computable structure theory is to determine…

We call an $\alpha \in \mathbb{R}$ regainingly approximable if there exists a computable nondecreasing sequence $(a_n)_n$ of rational numbers converging to $\alpha$ with $\alpha - a_n < 2^{-n}$ for infinitely many $n \in \mathbb{N}$. We…

Turing machines and spin models share a notion of universality according to which some simulate all others. Is there a theory of universality that captures this notion? We set up a categorical framework for universality which includes as…

We show in ZF that: (i) Every subcompact metrizable space is completely metrizable, and every completely metrizable space is countably subcompact. (ii) A metrizable space X=(X,T) is countably compact iff it is countably subcompact relative…

We introduce the notion of indivisible sequences and show that to any indivisible sequence $\{S, \Psi: S \to R\}$ we can associate faithfully flat ring maps $R \to R'$ that are not descendable. As a corollary, we obtain the first example of…

If $\mathcal P$ is a family of filters over some set $I$, a topological space $X$ is \emph{sequencewise $\mathcal P$-\brfrt compact} if, for every $I$-indexed sequence of elements of $X$, there is $F \in \mathcal P$ such that the sequence…

We prove that the solvable radical of a finite group G coincides with the set of elements y having the following property: for any x in G the subgroup of G generated by x and y is solvable. We present analogues of this result for finite…

We construct an increasing $\omega$-sequence $(a_n)$ of Turing degrees which forms an initial segment of the Turing degrees, and such that each~$a_{n+1}$ is diagonally noncomputable relative to $a_n$. It follows that the~$\mathsf{DNR}$…

Friedman and Stanley developed the notion of Borel reducibility and illustrated its use in comparing classification problems for some familiar classes of countable structures. For many embeddings, the fact that the embedding is $1-1$ on…

It is possible to enumerate all computer programs. In particular, for every partial computable function, there is a shortest program which computes that function. f-MIN is the set of indices for shortest programs. In 1972, Meyer showed that…

For every space $X$ let $\mathcal K(X)$ be the set of all compact subsets of $X$. Christensen \cite{c:74} proved that if $X, Y$ are separable metrizable spaces and $F\colon\mathcal{K}(X)\to\mathcal{K}(Y)$ is a monotone map such that any…

The T and Y-systems are ubiquitous structures in classical and quantum integrable systems. They are difference equations having a variety of aspects related to commuting transfer matrices in solvable lattice models, q-characters of…

We prove, for stably computably enumerable formal systems, direct analogues of the first and second incompleteness theorems of G\"odel. A typical stably computably enumerable set is the set of Diophantine equations with no integer…

It is consistent that for every function f:R x R-> R there is an uncountable set A subseteq R and two continuous functions f_0,f_1:D(A)-> R such that f(alpha, beta) in {f_0(alpha, beta),f_1(alpha, beta)} for every (alpha, beta) in A^2,…

A computable structure A is x-computably categorical for some Turing degree x, if for every computable structure B isomorphic to A there is an isomorphism f:B -> A with f computable in x. A degree x is a degree of categoricity if there is a…

We show that it is consistent to have an uncountable sequential group of intermediate sequential order while no countable such groups exist. This is proved by adding $\omega_2$ Cohen reals to a model of $\diamondsuit$.

Let $G$ be a finite group. A faithful $G$-variety $X$ is called strongly incompressible if every dominant $G$-equivariant rational map of $X$ onto another faithful $G$-variety $Y$ is birational. We settle the problem of existence of…

Turing's famous 'machine' framework provides an intuitively clear conception of 'computing with real numbers'. A recursive counterexample to a theorem shows that the theorem does not hold when restricted to computable objects. These…