English
Related papers

Related papers: Computable structures on topological manifolds

200 papers

We study computable topological spaces and semicomputable and computable sets in these spaces. In particular, we investigate conditions under which semicomputable sets are computable. We prove that a semicomputable compact manifold $M$ is…

Logic · Mathematics 2017-01-18 Zvonko Iljazović , Igor Sušić

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…

Logic · Mathematics 2023-07-10 Djamel Eddine Amir , Mathieu Hoyrup

We investigate conditions under which a co-computably enumerable closed set in a computable metric space is computable and prove that in each locally computable computable metric space each co-computably enumerable compact manifold with…

Logic in Computer Science · Computer Science 2015-07-01 Zvonko Iljazovic

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…

Logic · Mathematics 2013-08-09 Matthew P. Szudzik

The topological properties of a set have a strong impact on its computability properties. A striking illustration of this idea is given by spheres and closed manifolds: if a set $X$ is homeomorphic to a sphere or a closed manifold, then any…

Logic · Mathematics 2022-02-11 Djamel Eddine Amir , Mathieu Hoyrup

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…

Logic in Computer Science · Computer Science 2022-09-07 Pedro Hack , Daniel A. Braun , Sebastian Gottwald

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…

Logic · Mathematics 2024-11-25 Emmanuel Rauzy

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…

Logic in Computer Science · Computer Science 2015-07-01 Klaus Weihrauch , Nazanin Tavana-Roshandel

A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable. It is known that if a semi-computable set S is a compact…

Logic in Computer Science · Computer Science 2015-07-01 Konrad Burnik , Zvonko Iljazovic

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…

Logic · Mathematics 2019-08-20 Russell Miller

An \'{e}tale space over a topological space $Y$ is defined as a local homeomorphism from a topological space $X$ into $Y$. They often come up in topos theory because of the equivalence between sheaves and \'{e}tale spaces over a space. In…

Logic · Mathematics 2026-05-01 Matthew de Brecht

Computational topology is an area that revisits topological problems from an algorithmic point of view, and develops topological tools for improved algorithms. We survey results in computational topology that are concerned with graphs drawn…

Computational Geometry · Computer Science 2017-09-06 Éric Colin de Verdière

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…

Logic in Computer Science · Computer Science 2015-07-01 Robert Rettinger , Klaus Weihrauch

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…

Logic · Mathematics 2025-11-07 Jason Block , Russell Miller

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…

Logic · Mathematics 2015-03-04 Arno Pauly

This paper introduces abstractions that are meaningful for computers and that can be built and used according to computers' own criteria, i.e., computable abstractions. It is analyzed how abstractions can be seen to serve as the building…

Artificial Intelligence · Computer Science 2015-03-31 Alejandro Sanchez Guinea

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…

Logic · Mathematics 2025-04-16 Heer Tern Koh , Alexander Melnikov , Keng Meng Ng

We investigate the computability (in the sense of computable analysis) of the topological pressure $P_{\rm top}(\phi)$ on compact shift spaces $X$ for continuous potentials $\phi:X\to {\mathbb R}$. This question has recently been studied…

Dynamical Systems · Mathematics 2021-05-14 Michael Burr , Suddhasattwa Das , Christian Wolf , Yun Yang

The basic notions of quantum mechanics are formulated in terms of separable infinite dimensional Hilbert space $\mathcal{H}$. In terms of the Hilbert lattice $\mathcal{L}$ of closed linear subspaces of $\mathcal{H}$ the notions of state and…

Logic in Computer Science · Computer Science 2023-06-22 Eike Neumann , Martin Pape , Thomas Streicher

The dynamics of symbolic systems, such as multidimensional subshifts of finite type or cellular automata, are known to be closely related to computability theory. In particular, the appropriate tools to describe and classify topological…

Dynamical Systems · Mathematics 2019-06-06 Silvere Gangloff , Alonso Herrera , Cristobal Rojas , Mathieu Sablik
‹ Prev 1 2 3 10 Next ›