In article <email@example.com>, Charlie-Boo <firstname.lastname@example.org> wrote:
> It is trivial to calculate in binary (using only 0 and 1) and output > any desired string surrounded by 2 whenever we want, then immediately > erase one of the 2's. Thus every real number will be defined by some > TM.
How does one calculate one of those many reals that one cannot calculate, the inaccessible ones? Note that most reals are inaccessible, uncountably many of them, with only countably many being accessible.