Related papers: A Variant Of Chaitin's Omega function
We prove that, assuming $\mathrm{ZF}$, and restricted to any pointed set, Chaitin's $\Omega_U:x\mapsto \Omega_U^x=\sum_{U^x(\sigma)\downarrow}2^{-|\sigma|}$ is not injective for any universal prefix-free Turing machine $U$, and that…
We present a new method for expressing Chaitin's random real, Omega, through Diophantine equations. Where Chaitin's method causes a particular quantity to express the bits of Omega by fluctuating between finite and infinite values, in our…
The halting probability of a Turing machine,also known as Chaitin's Omega, is an algorithmically random number with many interesting properties. Since Chaitin's seminal work, many popular expositions have appeared, mainly focusing on the…
A Chaitin Omega number is the halting probability of a universal Chaitin (self-delimiting Turing) machine. Every Omega number is both computably enumerable (the limit of a computable, increasing, converging sequence of rationals) and random…
A fruitful way of obtaining meaningful, possibly concrete, algorithmically random numbers is to consider a potential behaviour of a Turing machine and its probability with respect to a measure (or semi-measure) on the input space of binary…
The halting probability of a Turing machine is the probability that the machine will halt if it starts with a random stream written on its one-way input tape. When the machine is universal, this probability is referred to as Chaitin's omega…
A method to solve the problem f(x) = 0 efficiently on any n-dimensional domain Omega under very broad hypoteses is proposed. The position of the root of f, assumed unique, is found by computing the center of mass of an Omega-shaped object…
We show that a large collection of special functions, in particular Nielsen's beta function, are generalized Stieltjes functions of order 2, and therefore logarithmically completely monotonic. This includes the Laplace transform of…
A coarse description of a subset A of omega is a subset D of omega such that the symmetric difference of A and D has asymptotic density 0. We study the extent to which noncomputable information can be effectively recovered from all coarse…
Let $f$ be a function on a bounded domain $\Omega \subseteq \mathbb{R}^n$ and $\delta$ be a positive function on $\Omega$ such that $B(x,\delta(x))\subseteq \Omega$. Let $\sigma(f)(x)$ be the average of $f$ over the ball $B(x,\delta(x))$.…
We study integrals of the form $\int_{\Omega}f\left( d\omega_1 , \ldots , d\omega_m \right), $ where $m \geq 1$ is a given integer, $1 \leq k_{i} \leq n$ are integers and $\omega_{i}$ is a $(k_{i}-1)$-form for all $1 \leq i \leq m$ and $…
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…
We generalize the concept of randomness in an infinite binary sequence in order to characterize the degree of randomness by a real number D>0. Chaitin's halting probability \Omega is generalized to \Omega^D whose degree of randomness is…
We show that there is always a uniformly antisymmetric f:A-> {0,1} if A subset R is countable. We prove that the continuum hypothesis is equivalent to the statement that there is an f:R-> omega with |S_x| <= 1 for every x in R. If the…
Karamata's integral representation for slowly varying functions is extended to a broader class of the so-called $\psi$-locally constant functions, i.e. functions $f(x)>0$ having the property that, for a given non-decreasing function $\psi…
We prove some results on the behavior of infinite sums of the form $\Sigma f\circ T^n(x)\frac{1}{n}$, where $T:S^1\to S^1$ is an irrational circle rotation and $f$ is a mean-zero function on $S^1$. In particular, we show that for a certain…
In this paper we obtain a precise formula for the $1$-level density of $L$-functions attached to non-Galois cubic Dedekind zeta functions. We find a secondary term which is unique to this context, in the sense that no lower-order term of…
We prove a necessary optimality condition of Euler--Lagrange type for the calculus of variations with Omega derivatives, which turns out to be sufficient under jointly convexity of the Lagrangian.
It would be a heavenly reward if there were a method of weighing theories and sentences in such a way that a theory could never prove a heavier sentence (Chaitin's Heuristic Principle). Alas, no satisfactory measure has been found so far,…
We examine the computable part of the differentiability hierarchy defined by Kechris and Woodin. In that hierarchy, the rank of a differentiable function is an ordinal less than omega_1 which measures how complex it is to verify…