On 2010-06-20, Mike Terry <email@example.com> wrote: > Not so - the "very simple algorithm" you are suggesting requires > "the input list" in its raw (infinite) form as input. As such, this > is not an algorithm that can be implemented on a Turing machine.
(According to some definitions of Turing machine it can, as some definitions permit the input present on the tape initially to be arbitrary, including having infinitely many nonblank cells)
I agree that it certainly does not fit the more restricted type of Turing machine permitted in the definition of computable real, as those permit only a finite input. That input is a specification denoting precision, digit number, or similar depending on exactly which definition of computable real is employed.