Mathematics – Number Theory
Scientific paper
2003-01-24
Fundamenta Informaticae 56 (2003) 273--284
Mathematics
Number Theory
Scientific paper
We show how to determine the $k$-th bit of Chaitin's algorithmically random real number $\Omega$ by solving $k$ instances of the halting problem. From this we then reduce the problem of determining the $k$-th bit of $\Omega$ to determining whether a certain Diophantine equation with two parameters, $k$ and $N$, has solutions for an odd or an even number of values of $N$. We also demonstrate two further examples of $\Omega$ in number theory: an exponential Diophantine equation with a parameter $k$ which has an odd number of solutions iff the $k$-th bit of $\Omega$ is 1, and a polynomial of positive integer variables and a parameter $k$ that takes on an odd number of positive values iff the $k$-th bit of $\Omega$ is 1.
Kieu Tien D.
Ord Toby
No associations
LandOfFree
On the existence of a new family of Diophantine equations for $\bf Ω$ does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with On the existence of a new family of Diophantine equations for $\bf Ω$, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the existence of a new family of Diophantine equations for $\bf Ω$ will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-709653