Related papers: On Church's Thesis in Cubical Assemblies
A compact set has computable type if any homeomorphic copy of the set which is semicomputable is actually computable. Miller proved that finite-dimensional spheres have computable type, Iljazovi\'c and other authors established the property…
The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…
This paper investigates the view that digital hypercomputing is a good reason for rejection or re-interpretation of the Church-Turing thesis. After suggestion that such re-interpretation is historically problematic and often involves attack…
Although there is a somewhat standard formalization of computability on countable sets given by Turing machines, the same cannot be said about uncountable sets. Among the approaches to define computability in these sets, order-theoretic…
We formalize an existing computability-theoretic method of presenting first-order structures whose domains have the cardinality of the continuum. Work using these methods until now has emphasized their topological properties. We shift the…
We show that the K-theory spectra of many assemblers, such as the assembler of polytopes in euclidean, hyperbolic or spherical geometry, as well as the assembler of definable sets, are equivalent to the K-theory spectrum of a squares…
We prove a general finiteness statement for the ordered abelian group of tropical functions on skeleta in Berkovich analytifications of algebraic varieties. Our approach consists in working in the framework of stable completions of…
We construct a fully faithful functor from the category of graphs to the category of fields. Using this functor, we resolve a longstanding open problem in computable model theory, by showing that for every nontrivial countable structure S,…
The main aim of this paper is to prove a Bishop-Phelps-Bollob\'as type theorem on the unital uniform algebra A_{w^*u}(B_{X^*}) consisting of all w^*-uniformly continuous functions on the closed unit ball B_{X^*} which are holomorphic on the…
In this paper we develop general techniques for classes of computable real numbers generated by subsets of total computable (recursive functions) with special restrictions on basic operations in order to investigate the following problems:…
In the present paper we prove Liouville-type theorems: non-existence theorems for conformal mappings of complete Riemannian manifolds. In addition, we give an application of these results to the theory of conharmonic transformations. A part…
We extend a dichotomy between 1-basedness and supersimplicity proved in a previous paper. The generalization we get is to arbitrary language, with no restrictions on the topology (we do not demand type-definabilty of the open set in the…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
We introduce a topology on the space of all isomorphism types represented in a given class of countable models, and use this topology as an aid in classifying the isomorphism types. This mixes ideas from effective descriptive set theory and…
The Fitting subgroup of a type-definable group in a simple theory is relatively definable and nilpotent. Moreover, the Fitting subgroup of a supersimple hyperdefinable group has a normal hyperdefinable nilpotent subgroup of bounded index,…
We consider classical representations of integers: Church's function iterators, cardinal equivalence classes of sets, ordinal equivalence classes of totally ordered sets. Since programs do not work on abstract entities and require formal…
We argue that computation is an abstract algebraic concept, and a computer is a result of a morphism (a structure preserving map) from a finite universal semigroup.
Let T be a triangulated category with coproducts, C the full subcategory of compact objects in T. If T is the homotopy category of spectra, Adams proved the following in [Adams71]: All contravariant homological functors C --> Ab are the…
Does combining a finite collection of objects infinitely many times guarantee the construction of a particular object? Here we use recursive function theory to examine the popular scenario of an infinite collection of typing monkeys…