Related papers: Computability in infinite Galois theory and algori…
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…
Can a probabilistic gambler get arbitrarily rich when all deterministic gamblers fail? We study this problem in the context of algorithmic randomness, introducing a new notion -- almost everywhere computable randomness. A binary sequence…
We study the random \'etale algebra generated by a random polynomial with i.i.d. coefficients distributed according to Haar measure normalized on $\mathbb{Z}_p$. We determine the probability that this random algebra is an unramified field,…
We study the randomness properties of reals with respect to arbitrary probability measures on Cantor space. We show that every non-computable real is non-trivially random with respect to some measure. The probability measures constructed in…
Continuing the line of thought of an earlier work, we provide the first infinite family of quadratic number fields with everywhere unramified Galois extensions of Galois group $SL_2(5)$, the (unique) smallest nonsolvable group for which…
We provide a characterization of infinite algebraic Galois extensions of the rationals with uniformly bounded local degrees, giving a detailed proof of all the results announced in a paper by Checcoli and Zannier and obtaining relevant…
For any class of operators which transform unary total functions in the set of natural numbers into functions of the same kind, we define what it means for a real function to be uniformly computable or conditionally computable with respect…
Consider an algorithm computing in a differential field with several commuting derivations such that the only operations it performs with the elements of the field are arithmetic operations, differentiation, and zero testing. We show that,…
Random number generators are widely used in practical algorithms. Examples include simulation, number theory (primality testing and integer factorization), fault tolerance, routing, cryptography, optimization by simulated annealing, and…
We are now witnessing a rapid growth of a new part of group theory which has become known as "statistical group theory". A typical result in this area would say something like ``a random element (or a tuple of elements) of a group G has a…
This work connects two mathematical fields - computational complexity and interval linear algebra. It introduces the basic topics of interval linear algebra - regularity and singularity, full column rank, solving a linear system, deciding…
For each odd prime $p$, we prove the existence of infinitely many real quadratic fields which are $p$-rational. Explicit imaginary and real bi-quadratic $p$-rational fields are also given for each prime $p$. Using a recent method developed…
According to Haar's Theorem, every compact group $G$ admits a unique (regular, right and) left-invariant Borel probability measure $\mu_G$. Let the Haar integral (of $G$) denote the functional $\int_G:\mathcal{C}(G)\ni f\mapsto \int…
We discuss computability and computational complexity of conformal mappings and their boundary extensions. As applications, we review the state of the art regarding computability and complexity of Julia sets, their invariant measures and…
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…
Given a finite group $\Gamma$, we prove results on the distribution of the prime-to-$q|\Gamma|$ part of fundamental groups of $\Gamma$-covers of the projective line $\mathbb P^1_{\mathbb F_q}$ over a finite field $\mathbb F_q$ as…
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…
Boston, Bush, and Hajir have developed heuristics, extending the Cohen-Lenstra heuristics, that conjecture the distribution of the Galois groups of the maximal unramified pro-p extensions of imaginary quadratic number fields for p an odd…
This paper is a comment on the paper "Quantum Mechanics and Algorithmic Randomness" was written by Ulvi Yurtsever \cite{Yurtsever} and the briefly explanation of the algorithmic randomness of quantum measurements results. There are…
We study the algebraic theory of computable functions, which can be viewed as arising from possibly non-halting computer programs or algorithms, acting on some state space, equipped with operations of composition, {\em if-then-else} and…