Related papers: Taking the path computably travelled

Simple cosmological models are used to show that gravitation can be quantized as an ordinary gauge system if the Hamilton-Jacobi equation for the model under consideration is separable. In this situation, a canonical transformation can be…

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…

It is shown that the existence of a biseparating map between a large class of spaces of vector-valued continuous functions A(X,E) and A(Y,F) implies that some compactifications of X and Y are homeomorphic. In some cases, conditions are…

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…

A topological space $X$ is called $\Cal A$-real compact, if every algebra homomorphism from $\Cal A$ to the reals is an evaluation at some point of $X$, where $\Cal A$ is an algebra of continuous functions. Our main interest lies on…

Compositionality is a key property for dealing with complexity, which has been studied from many points of view in diverse fields. Particularly, the composition of individual computations (or programs) has been widely studied almost since…

We construct some irreducible representations of the Leavitt path algebra of an arbitrary quiver. The constructed representations are associated to certain algebraic branching systems. For a row-finite quiver, we classify algebraic…

For a ring R, Hilbert's Tenth Problem HTP(R) is the set of polynomial equations over R, in several variables, with solutions in R. We consider computability of this set for subrings R of the rationals. Applying Baire category theory to…

Matrices are typically considered over fields or rings. Motivated by applications in parametric differential equations and data-driven modeling, we suggest to study matrices with entries from a Hilbert space and present an elementary theory…

This paper implements in a simple but rigorous fashion a model of particle interaction involving all paths within a quantum system, both for configuration space and for spin. The model, which we call the space of all paths, leads to a…

We initiate an investigation of structures on the set of real numbers having the property that path components of definable sets are definable. All o\nobreakdash-\hspace{0pt}minimal structures on $(\mathbb{R},<)$ have the property, as do…

We introduce new types of local algorithms, which we call "ASI Algorithms", and use them to demonstrate a link between descriptive and computable combinatorics. This allows us to unify arguments from the two fields, and also sometimes to…

Let $n$ be a positive integer, and let $R$ be a (possibly infinite dimensional) finitely presented algebra over a computable field of characteristic zero. We describe an algorithm for deciding (in principle) whether $R$ has at most finitely…

This note addresses the issue as to which ceers can be realized by word problems of computably enumerable (or, simply, c.e.) structures (such as c.e. semigroups, groups, and rings), where being realized means to fall in the same…

Let $C$ and $A$ be two unital separable amenable simple C*-algebras with tracial rank no more than one. Suppose that $C$ satisfies the Universal Coefficient Theorem and suppose that $\phi_1, \phi_2: C\to A$ are two unital monomorphisms. We…

Quasi algebraically closed fields, or $C_1$ fields, are defined in terms of a low degree condition. Namely, the field $K$ is $C_1$ if every degree $d$ hypersurface of the projective space $\mathbb{P}_K^n$ contains a $K$-point as soon as…

For $\kappa$ a regular uncountable cardinal, the higher Baire and Cantor spaces ${}^\kappa\kappa$ and ${}^\kappa2$ (endowed with the ${<}\kappa$-box topology) have been relatively well-studied, but less is known about the case where…

In this paper we study a new approach to classify mathematical theorems according to their computational content. Basically, we are asking the question which theorems can be continuously or computably transferred into each other? For this…

We consider $m \times s$ matrices (with $m\geq s$) in a real affine subspace of dimension $n$. The problem of finding elements of low rank in such spaces finds many applications in information and systems theory, where low rank is…

We introduce the open degree of a compact space, and we show that for every natural number n, the separable Rosenthal compact spaces of degree n have a finite basis.