# What are the irrational numbers that are generatable by a Turing machine? [duplicate]

Assume generating means that for all $$k$$ there exists $$N_k$$ such that after $$N_k$$ steps the $$k$$th cell on the tape consists of the $$k$$th digit of $$\pi$$'s binary expansion and will stay there forever.

Can such a machine exist? can it not?

EDIT

Is this true for every irrational number?

So this is true for $$\pi$$ since there exists a Turing machine to calculate the $$k$$th digit of $$pi$$ so we can construct a machine that calls the prior machine to calculate digit by digit.

But this can not be true for all irrational numbers since there are uncountably many irrational numbers and only countably many turing machines.

From this we can conclude that $$\pi$$ is among a special countable set of irrational numbers, call it $$G$$, that are generatable in the sense above.

Do we know what is the set $$G = \{ g \in \mathbb{R} \setminus \mathbb{Q} : g$$ is generatable $$\}$$ in a mathematical sense or a more informative way? We know $$\pi \in G$$ and we know $$G$$ is countable. Is there more to the picture?

• There is an algorithm to compute the digits of $\pi$. This algorithm can be implemented on a Turing machine. – Hendrik Jan Jun 17 at 9:13
• Thanks let me expand the question please, Is this true for every irrational number? – Oren Jun 17 at 9:15
• It is a question of computability, whether there exists an algorithm to find the digits. There exist uncomputable numbers. – Hendrik Jan Jun 17 at 9:18
• It was already asked here: cs.stackexchange.com/questions/91847/… – Albert Hendriks Jun 17 at 9:52
• @reinierpost That is not true, that question is not about finite numbers but about irrational numbers. Read further than the title. – Albert Hendriks Jun 17 at 13:28