相关论文: Computable Closed Euclidean Subsets with and witho…

This paper is an overview of results that show the Brouwer fixed-point theorem (BFPT) to be essentially non-constructive and non-computable. The main results, the counter-examples of Orevkov and Baigger, imply that there is no procedure for…

We prove that if $E \subseteq \mathbb{R}^d$ ($d\geq 2$) is a Lebesgue-measurable set with density larger than $\frac{n-2}{n-1}$, then $E$ contains similar copies of every $n$-point set $P$ at all sufficiently large scales. Moreover,…

In this paper, we apply the machinery developed in arXiv:2401.06641(2) to study the behavior of computable categoricity relativized to non-c.e. degrees. In particular, we show that we can build a computable structure which is not computably…

We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…

A space $X$ is called {\it selectively pseudocompact} if for each sequence $(U_{n})_{n\in \mathbb{N}}$ of pairwise disjoint nonempty open subsets of $X$ there is a sequence $(x_{n})_{n\in \mathbb{N}}$ of points in $X$ such that $cl_X(\{x_n…

Existence of superdecomposable pure-injective modules reflects complexity in the category of finite-dimensional representations over an algebra. Such an existence occurs when an algebra is non-domestic; a conjecture due to M. Prest. G.…

For continuous maps on a compact manifold M, particularly for those that do not preserve the Lebesgue measure m, we define the observable invariant probability measures as a generalization of the physical measures. We prove that any…

This article examines Hilbert spaces constructed from sets whose existence is incompatible with the Countable Axiom of Choice (CC). Our point of view is twofold: (1) We examine what can and cannot be said about Hilbert spaces and operators…

In this first of two papers, strong limits on the accuracy of physical computation are established. First it is proven that there cannot be a physical computer C to which one can pose any and all computational tasks concerning the physical…

We study the existence of non-separable compact spaces that support a measure and are small from the topological point of view. In particular, we show that under Martin's axiom there is a non-separable compact space supporting a measure…

An important theorem of geometric measure theory (first proved by Besicovitch and Davies for Euclidean space) says that every analytic set of non-zero $s$-dimensional Hausdorff measure $\mathcal H^s$ contains a closed subset of non-zero…

This paper defines a new notion of bounded computable randomness for certain classes of sub-computable functions which lack a universal machine. In particular, we define such versions of randomness for primitive recursive functions and for…

We show that the set of Lebesgue integrable functions in $[0,1]$ which are nowhere essentially bounded is spaceable, improving a result from [F. J. Garc\'{i}a-Pacheco, M. Mart\'{i}n, and J. B. Seoane-Sep\'ulveda. \textit{Lineability,…

We examine the relation of BSS-reducibility on subsets of the real numbers. The question was asked recently (and anonymously) whether it is possible for the halting problem H in BSS-computation to be BSS-reducible to a countable set.…

A subset $S$ of a finite abelian group, written additively, is called zero-sumfree if the sum of the elements of each non-empty subset of $S$ is non-zero. We investigate the maximal cardinality of zero-sumfree sets, i.e., the (small) Olson…

The notion of computable reducibility between equivalence relations on the natural numbers provides a natural computable analogue of Borel reducibility. We investigate the computable reducibility hierarchy, comparing and contrasting it with…

We prove that the set of closed orbits in a real reductive representation contains a subset which is open with respect to the real Zariski topology if it has non-empty interior. In particular the set of closed orbits is dense.

We show that universal quantum computation can be achieved in the standard pure-state circuit model while, at any time, the entanglement entropy of all bipartitions is small---even tending to zero with growing system size. The result is…

We show that every countable ideal of degrees that are low for isomorphism is contained in a principal ideal of degrees that are low for isomorphism by adapting an exact pair construction. We further show that within the hyperimmune-free…

The author has recently introduced the class of CNED sets in Euclidean space, generalizing the classical notion of NED sets, and shown that they are quasiconformally removable. A set $E$ is CNED if the conformal modulus of a curve family is…