In article <adaa005c-c180-4ce0-8d2c-81da912c6b3b@w12g2000yqj.googlegroups.com>, Charlie-Boo <shymathguy@gmail.com> wrote:
> On Jun 24, 8:49 am, Aatu Koskensilta <aatu.koskensi...@uta.fi> wrote: > > Charlie-Boo <shymath...@gmail.com> writes: > > > On Jun 15, 2:15 am, "Peter Webb" > > > > >> No. You cannot form a list of all computable Reals. > > > > > Of course you can - it's just the list of Turing Machines. > > > > No, it's not. > > I asked for a counterexample, to no avail. Don't you think you should > substantiate your statement or retract it? > > Each Turing Machine represents some computable real (all computable > reals are included) and you can list those Turing Machines. The > Turing Machine represents it as well as any other system of > representation.
Aren't there Turing machines that don't represent any real at all? > > C-B > > > -- > > Aatu Koskensilta (aatu.koskensi...@uta.fi) > > > > "Wovon man nicht sprechan kann, dar ber muss man schweigen" > > - Ludwig Wittgenstein, Tractatus Logico-Philosophicus
