Related papers: Left computably enumerable reals and initial segme…
The \emph{index set} of a computable structure $\mathcal{A}$ is the set of indices for computable copies of $\mathcal{A}$. We determine the complexity of the index sets of various mathematically interesting structures, including arbitrary…
This paper presents categorical formulations of Turing, Medvedev, Muchnik, and Weihrauch reducibilities in Computability Theory, utilizing Lawvere doctrines. While the first notions lend themselves to a smooth categorical presentation,…
Consider a universal Turing machine that produces a partial or total function (or a binary stream), based on the answers to the binary queries that it makes during the computation. We study the probability that the machine will produce a…
We study the complexity of deterministic and probabilistic inversions of partial computable functions on the reals.
We consider the partition of a finite Coxeter group $W$ into left cells with respect to a weight function $L$. In the equal parameter case, Lusztig has shown that the representations carried by the left cells are precisely the so-called…
The class of uniformly computable real functions with respect to a small subrecursive class of operators computes the elementary functions of calculus, restricted to compact subsets of their domains. The class of conditionally computable…
This paper studies left invertibility of discrete-time linear I/O quantized linear systems of dimension 1. Quantized outputs are generated according to a given partition of the state-space, while inputs are sequences on a finite alphabet.…
In this paper, we introduce a foundation for computable model theory of rational Pavelka logic (an extension of {\L}ukasiewicz logic) and continuous logic, and prove effective versions of some theorems in model theory. We show how to reduce…
Let K be a henselian valued field of characteristic 0. Then K admits a definable partition on each piece of which the leading term of a polynomial in one variable can be computed as a definable function of the leading term of a linear map.…
The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction…
We study C*-algebras generated by left regular representations of right LCM one-relator monoids and Artin-Tits monoids of finite type. We obtain structural results concerning nuclearity, ideal structure and pure infiniteness. Moreover, we…
Let $M$ be a maximal subalgebra of a Lie algebra $L$ and $A/B$ a chief factor of $L$ such that $B \subseteq M$ and $A \not \subseteq M$. We call the factor algebra $M \cap A/B$ a $c$-section of $M$. All such $c$-sections are isomorphic, and…
Following a line of research initiated in \cite{BBNN}, I describe a general framework for turning reduction concepts of relative computability into diagrams forming an analogy with the Cicho\'n diagram for cardinal characteristics of the…
We establish a connection between constructible representations (arising in the study of left cells in Weyl groups) and Catalan numbers.
In this Chapter, using Riccati equation as our main example, we tried to demonstrate at least some of the ideas and notions introduced in Chapter 1 - integrability in quadratures, conservation laws, etc. Regarding transformation group and…
We investigate the satisfiability and finite satisfiability problem for probabilistic computation-tree logic (PCTL) where operators are not restricted by any step bounds. We establish decidability for several fragments containing…
Chaitin's number Omega is the halting probability of a universal prefix-free machine, and although it depends on the underlying enumeration of prefix-free machines, it is always Turing-complete. It can be observed, in fact, that for every…
Let $\alpha\in\,]0,1[$. We prove that the existence of the conformable fractional derivative $T_{\alpha}f$ of a function $f:[0,\infty[\,\longrightarrow \mathbb{R}$ introduced by Khalil et al. in [R. Khalil, M. Al Horani, A. Yousef, M.…
We show that the theory of the partial order of computably enumerable equivalence relations (ceers) under computable reduction is 1-equivalent to true arithmetic. We show the same result for the structure comprised of the dark ceers and the…
We combine harmonic analysis and operator algebraic techniques to give a concise argument that the left regular representation of a locally compact group is cyclic if and only if the group is first countable, a result first proved by…