Related papers: Infinite time decidable equivalence relation theor…
We show that, from the topological point of view, 2-tape B\"uchi automata have the same accepting power as Turing machines equipped with a B\"uchi acceptance condition. The Borel and the Wadge hierarchies of the class RAT_omega of…
At a first glance the Theory of computation relies on potential infinity and an organization aimed at solving a problem. Under such aspect it is like Mendeleev theory of chemistry. Also its theoretical development reiterates that of this…
For a quantum group, we study those right coideal subalgebras, for which all irreducible representations are one-dimensional. If a right coideal subalgebra is maximal with this property, then we call it a Borel subalgebra. Besides the…
(1) There is a finitely presented group with a word problem which is a uniformly effectively inseparable equivalence relation. (2) There is a finitely generated group of computable permutations with a word problem which is a universal…
We introduce a type $B$ analogue of the nil Temperley-Lieb algebra in terms of generators and relations, that we call the (extended) nil-blob algebra. We show that this algebra is isomorphic to the endomorphism algebra of a Bott-Samelson…
In classical prime number theory several asymptotic relations are considered to be "equivalent" to the prime number theorem. In the setting of Beurling generalized numbers, this may no longer be the case. Under additional hypotheses on the…
We define notions of generically and coarsely computable relations and structures and functions between structures. We investigate the existence and uniqueness of equivalence structures in the context of these definitions
This work explores the deformation theory of algebraic structures in a very general setting. These structures include commutative, associative algebras, Lie algebras, and the infinity versions of these structures, the strongly homotopy…
We define an equivalence relation on propositions and a proof system where equivalent propositions have the same proofs. The system obtained this way resembles several known non-deterministic and algebraic lambda-calculi.
We consider notions of space complexity for Infinite Time Turing Machines (ITTMs) that were introduced by B. L\"owe and studied further by J. Winter. We answer several open questions about these notions, among them whether low space…
We show that the uniform measure-theoretic ergodic decomposition of a countable Borel equivalence relation $(X, E)$ may be realized as the topological ergodic decomposition of a continuous action of a countable group $\Gamma…
In this paper, we have compared r.e. sets based on their enumeration orders with Turing machines. Accordingly, we have defined novel concept uniformity for Turing machines and r.e. sets and have studied some relationships between uniformity…
In this paper we extend previous studies of selection principles for families of open covers of sets of real numbers to also include families of countable Borel covers. The main results of the paper could be summarized as follows: 1. Some…
Contrary to the classical case, the relation between quantum programming languages and quantum Turing Machines (QTM) has not being fully investigated. In particular, there are features of QTMs that have not been exploited, a notable example…
Within the program of finding axiomatizations for various parts of computability logic, it was proved earlier that the logic of interactive Turing reduction is exactly the implicative fragment of Heyting's intuitionistic calculus. That sort…
We prove that orbit equivalence relations (ERs, for brevity) of generically turbulent Polish actions are not Borel reducible to ER s of a family which includes Polish actions of S_\infty, the group of all permutations of N, and is closed…
In this paper, a notion of Schauder equivalence relation $\mathbb R^\mathbb N/L$ is introduced, where $L$ is a linear subspace of $\mathbb R^\mathbb N$ and the unit vectors form a Schauder basis of $L$. The main theorem is to show that the…
Motivated by statistical practice, category theory terminology is used to introduce Borel data structures and study exchangeability in an abstract framework. A generalization of de Finetti's theorem is shown and natural transformations are…
A type-2 computable real function is necessarily continuous; and this remains true for relative, i.e. oracle-based computations. Conversely, by the Weierstrass Approximation Theorem, every continuous f:[0,1]->R is computable relative to…
A $\lambda$-calculus is introduced in which all programs can be evaluated in probabilistic polynomial time and in which there is sufficient structure to represent sequential cryptographic constructions and adversaries for them, even when…