Related papers: A note on computable \'{e}tale spaces
In computable topology, a represented space is called computably discrete if its equality predicate is semidecidable. While any such space is classically isomorphic to an initial segment of the natural numbers, the computable-isomorphism…
We propose a definition of computable manifold by introducing computability as a structure that we impose to a given topological manifold, just in the same way as differentiability or piecewise linearity are defined for smooth and PL…
We investigate what it means for a (Hausdorff, second-countable) topological group to be computable. We compare several potential definitions in the literature. We relate these notions with the well-established definitions of effective…
We show some basic results on the characterization of quasi-Polish spaces in terms of spaces of ideals, with an emphasis on the connections with computable topology.
This article is a fundamental study in computable analysis. In the framework of Type-2 effectivity, TTE, we investigate computability aspects on finite and infinite products of effective topological spaces. For obtaining uniform results we…
In this work, we show that the \'{e}tale sectional number (\text{\'{E}tale-sec$(-)$}), i.e., the sectional number in the category of topological spaces with the \'{e}tale quasi Grothendieck topology (as defined in arXiv:2410.22515), is…
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…
Given a represented space (in the sense of TTE theory), an appropriate representation is constructed for the Moschovakis extension of its carrier (with paying attention to the cases of effective topological spaces and effective metric…
Represented spaces form the general setting for the study of computability derived from Turing machines. As such, they are the basic entities for endeavors such as computable analysis or computable measure theory. The theory of represented…
This article is a fundamental study in computable measure theory. We use the framework of TTE, the representation approach, where computability on an abstract set X is defined by representing its elements with concrete "names", possibly…
When can a model of a physical system be regarded as computable? We provide the definition of a computable physical model to answer this question. The connection between our definition and Kreisel's notion of a mechanistic theory is…
We generalize the notion of a small sheaf of sets over a topological space or manifold to define the notion of a small stack of groupoids over an \'etale topological or differentiable stack. We then provide a construction analogous to the…
The TTE computability notion in effective metric spaces is usually defined by using Cauchy representations. Under some weak assumptions, we characterize this notion in a way which avoids using the representations.
In 1957, Lacombe initiated a systematic study of the different possible notions of "computable topological spaces". However, he interrupted this line of research, settling for the idea that "computably open sets should be computable unions…
While there is a well-established notion of what a computable ordinal is, the question which functions on the countable ordinals ought to be computable has received less attention so far. We propose a notion of computability on the space of…
We define and study an effective version of the Wadge hierarchy in computable quasi-Polish spaces which include most spaces of interest for computable analysis. Along with hierarchies of sets we study hierarchies of k-partitions which are…
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…
We investigate the effectivizations of several equivalent definitions of quasi-Polish spaces and study which characterizations hold effectively. Being a computable effectively open image of the Baire space is a robust notion that admits…
We begin the systematic study of decision problems for finitely generated groups given by a solution to their word problem. We relate this to the study of computable analysis on the space of marked groups. We point out that several distinct…
We define E-theory for separable C*-algebras over second countable topological spaces and establish its basic properties. This includes an approximation theorem that relates the E-theory over a general space to the E-theories over finite…