Related papers: Constructive Limits of Cantor's Diagonal Method: C…
We examine various categorical structures that can and cannot be constructed. We show that total computable functions can be mimicked by constructible functors. More generally, whatever can be done by a Turing machine can be constructed by…
Diagonalization in the spirit of Cantor's diagonal arguments is a widely used tool in theoretical computer sciences to obtain structural results about computational problems and complexity classes by indirect proofs. The Uniform…
An algorith to count, or alternatively generate, all k-element transversals of a set system is presented and compared with three known methods. For special cases it works in output-linear time.
We reprove the countable splitting lemma by adapting Nawrotzki's algorithm which produces a sequence that converges to a solution. Our algorithm combines Nawrotzki's approach with taking finite cuts. It is constructive in the sense that…
We provide a characterization of when a countably infinite set of finite sets contains an infinite sunflower. We also show that the collection of such sets is Turing equivalent to the set of programs such that whenever the program converges…
We present a boundary integral method for numerical computation of the capacity of generalized condensers. The presented method applies to a wide variety of generalized condenser geometry including the cases when the plates of the…
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…
Functors with an instance of the Traversable type class can be thought of as data structures which permit a traversal of their elements. This has been made precise by the correspondence between traversable functors and finitary containers…
Data vectors generalise finite multisets: they are finitely supported functions into a commutative monoid. We study the question if a given data vector can be expressed as a finite sum of others, only assuming that 1) the domain is…
The bandwidth of a signal is an important physical property that is of relevance in many signal- and information-theoretic applications. In this paper we study questions related to the computability of the bandwidth of computable…
We construct a trigonometric series converging to zero everywhere on a subsequence, with coefficients tending to zero. We show that any such series must satisfy that the subsequence is very sparse, and that the support of the related…
For a fixed root of a quiver, it is a very hard problem to construct all or even only one indecomposable representation with this root as dimension vector. We investigate two methods which can be used for this purpose. In both cases we get…
We define the notion of ordinal computability by generalizing standard Turing computability on tapes of length $\omega$ to computations on tapes of arbitrary ordinal length. We show that a set of ordinals is ordinal computable from a finite…
The aim of this paper is to find an upper bound for the box-counting dimension of uniform attractors for non-autonomous dynamical systems. Contrary to the results in literature, we do not ask the symbol space to have finite box-counting…
We prove that these Cantor sets are made up of transcendental numbers, apart from their endpoints $0$ and $1$, under some arithmetical assumptions on the data. To that purpose, we establish a criterion of linear independence over the field…
Given a strong limit cardinal $\lambda$ of countable cofinality, we show that if every $\lambda$-coanalytic subset of the generalised Cantor space ${}^{\lambda}2$ has the $\lambda$-$\mathsf{PSP}$, then there is an inner model with…
The set of integer number lists with finite length, and the set of binary trees with integer labels are both countably infinite. Many inductively defined types also have countably many elements. In this paper, we formalize the syntax of…
In a one-counter automaton (OCA), one can produce a letter from some finite alphabet, increment and decrement the counter by one, or compare it with constants up to some threshold. It is well-known that universality and language inclusion…
Discussions surrounding the nature of the infinite in mathematics have been underway for two millennia. Mathematicians, philosophers, and theologians have all taken part. The basic question has been whether the infinite exists only in…
We define several notions of a limit point on sequences with domain a barrier in $[\omega]^{<\omega}$ focusing on the two dimensional case $[\omega]^2$. By exploring some natural candidates, we show that countable compactness has a number…