Related papers: Pointed computations and Martin-L\"of randomness
We extend the algorithms of Robinson, Smyth, and McKee--Smyth to enumerate all real-rooted integer polynomials of a fixed degree, where the first few (at least three) leading coefficients are specified. Additionally, we introduce new linear…
We study the probability that a random polynomial with integer coefficients is reducible when factored over the rational numbers. Using computer-generated data, we investigate a number of different models, including both monic and non-monic…
We consider the problem of computing the measure of a regular language of infinite binary trees. While the general case remains unsolved, we show that the measure of a language defined by a first-order formula with no descendant relation or…
While graphs and abstract data structures can be large and complex, practical instances are often regular or highly structured. If the instance has sufficient structure, we might hope to compress the object into a more succinct…
Using an iterative tree construction we show that for simple computable subsets of the Cantor space Hausdorff, constructive and computable dimensions might be incomputable.
Continued fractions with prescribed structures on sequences of their partial quotients have been intensively studied in the literature. As far as an integer sequence, especially a randomly generated one is concerned, an attractive question…
The paper is the second of our series of notes aimed to bring back in circulation some bright ideas of early modern set theory, mainly due to Harrington and Sami, which have never been adequately presented in set theoretic publications. We…
We introduce two families of transcendental numbers which we call finite factorial (FF) and partially finite factorial (PFF) numbers respectively, with the former one being subfamily of the latter one. These numbers arise naturally from…
We study Martin-L\"{o}f random (ML-random) points on computable probability measures on sample and parameter spaces (Bayes models). We consider variants of conditional randomness defined by ML-randomness on Bayes models and those of…
About fifty years ago Mahler proved that if $\alpha>1$ is rational but not an integer and if $0<l<1$ then the fractional part of $\alpha^n$ is $>l^n$ apart from a finite set of integers $n$ depending on $\alpha$ and $l$. Answering…
Algorithmic theories of randomness can be related to theories of probabilistic sequence prediction through the notion of a predictor, defined as a function which supplies lower bounds on initial-segment probabilities of infinite sequences.…
Van Lambalgen's theorem states that a pair $(\alpha,\beta)$ of bitsequences is Martin-L\"of random if and only if $\alpha$ is Martin-L\"of random and $\beta$ is Martin-L\"of random relative to $\alpha$. In [Information and Computation 209.2…
Let $S$ be a rational fraction and let $f$ be a polynomial over a finite field. Consider the transform $T(f)=\operatorname{numerator}(f(S))$. In certain cases, the polynomials $f$, $T(f)$, $T(T(f))\dots$ are all irreducible. For instance,…
According to the math tea argument, there must be real numbers that we cannot describe or define, because there are uncountably many real numbers, but only countably many definitions. And yet, the existence of pointwise-definable models of…
Let $R_\alpha$ be an irrational rotation of the circle, and code the orbit of any point $x$ by whether $R_\alpha^i(x)$ belongs to $[0,\alpha)$ or $[\alpha,1)$ -- this produces a Sturmian sequence. A point is undetermined at step $j$ if its…
Solomonoff's central result on induction is that the posterior of a universal semimeasure M converges rapidly and with probability 1 to the true sequence generating posterior mu, if the latter is computable. Hence, M is eligible as a…
Given any 1-random set $X$ and any $r\in(0,1)$, we construct a set of intrinsic density $r$ which is computable from $r\oplus X$. For almost all $r$, this set will be the first known example of an intrinsic density $r$ set which cannot…
A sequence $x_1,\dots,x_n,\dots$ of discrete-valued observations is generated according to some unknown probabilistic law (measure) $\mu$. After observing each outcome, one is required to give conditional probabilities of the next…
Within the last fifteen years, a program of establishing relationships between algorithmic randomness and almost-everywhere theorems in analysis and ergodic theory has developed. In harmonic analysis, Franklin, McNicholl, and Rute…
Constructing $r$-th nonresidue over a finite field is a fundamental computational problem. A related problem is to construct an irreducible polynomial of degree $r^e$ (where $r$ is a prime) over a given finite field $\mathbb{F}_q$ of…