Related papers: The typical Turing degree
The set of the first Hilbert coefficients of parameter ideals relative to a module--its Chern coefficients--over a local Noetherian ring codes for considerable information about its structure--noteworthy properties such as that of…
In this article, we study a notion of the extraction rate of Turing functionals that translate between notions of randomness with respect to different underlying probability measures. We analyze several classes of extraction procedures: a…
We study the relationship between the Tor-regularity and the local-regularity over a positively graded algebra defined over a field which coincide if the algebra is a standard graded polynomial ring. In this case both are characterizations…
We will find a lower bound on the recognition complexity of the theories that are nontrivial relative to some equivalence relation (this relation may be equality), namely, each of these theories is consistent with the formula, whose sense…
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in the presence of linked data structures, 2) shape analysis…
It is well-known the Lebesgue \cite{Lebesgue, Zygmund} test for trigonometric Fourier series. Taberski \cite{Taberski1, Taberski2} considered real-valued Lebesgue locally integrable functions $f$, such that \begin{equation*} \lim_{T \to…
A topological space $X$ is Baire if the Baire Category Theorem holds for $X$, i.e., the intersection of any sequence of open dense subsets of $X$ is dense in $X$. One of the interesting problems for the space $B_1(X)$ of all Baire-one…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
We study the problem of differentiation of integrals for certain bases in the infinite-dimensional torus $\mathbb{T}^\omega$. In particular, for every $p_0 \in [1,\infty)$, we construct a basis $\mathcal{B}$ which differentiates…
We study integer-valued multiplicative dynamics driven by i.i.d. prime multipliers and connect their macroscopic statistics to universal codelengths. We introduce the Multiplicative Turing Ensemble (MTE) and show how it arises naturally -…
This is yet another version of the course notes in chao-dyn/9407003. Here we change the universal Turing machine that is used to measure program-size complexity so that the constants in our information-theoretic incompleteness theorems are…
Computably enumerable equivalence relations (ceers) received a lot of attention in the literature. The standard tool to classify ceers is provided by the computable reducibility $\leq_c$. This gives rise to a rich degree-structure. In this…
In this paper we study the behaviour of modules over finite dimensional algebras whose endomorphism algebra is a division ring. We show that there are finitely many such modules in the module category of an algebra if and only if the length…
1) We introduce random discrete Morse theory as a computational scheme to measure the complicatedness of a triangulation. The idea is to try to quantify the frequence of discrete Morse matchings with a certain number of critical cells. Our…
We give a function field specific, algebraic proof of the main results of class field theory for abelian extensions of degree coprime to the characteristic. By adapting some methods known for number fields and combining them in a new way,…
Let $R$ be a Cohen--Macaulay local $K$-algebra or a standard graded $K$-algebra over a field $K$ with a canonical module $\omega_R$. The trace of $\omega_R$ is the ideal $tr(\omega_R)$ of $R$ which is the sum of those ideals…
Thin Lie algebras are infinite-dimensional graded Lie algebras $L=\bigoplus_{i=1}^{\infty}$, with $\dim(L_1)=2$ and satisfying a covering property: for each $i$, each nonzero $z\in L_i$ satisfies $[zL_1]=L_{i+1}$. It follows that each…
It is studied a connection between the separability and the countable chain condition of spaces with the $L$-property (a topological space $X$ has the $L$-property if for every topological space $Y$, separately continuous function…
Language modeling, a central task in natural language processing, involves estimating a probability distribution over strings. In most cases, the estimated distribution sums to 1 over all finite strings. However, in some pathological cases,…
The study of the word problems of groups dates back to Dehn in 1911, and has been a central topic of study in both group theory and computability theory. As most naturally occurring presentations of groups are recursive, their word problems…