On Jun 15, 2:15 am, "Peter Webb" <webbfam...@DIESPAMDIEoptusnet.com.au> wrote: > "|-|ercules" <radgray...@yahoo.com> wrote in message > > news:87ocucFrn3U1@mid.individual.net... > > > Consider the list of increasing lengths of finite prefixes of pi > > > 3 > > 31 > > 314 > > 3141 > > .... > > > Everyone agrees that: > > this list contains every digit of pi (1) > > Sloppy terminology, but I agree with what I think you are trying to say. > > > as pi is an infinite digit sequence, this means > > > this list contains every digit of an infinite digit sequence (2) > > Again sloppy, but basically true. > > > similarly, as computable digit sequences contain increasing lengths of ALL > > possible finite prefixes > > Not "similarly", but if you are claiming that all Reals which have finite > decimal expansions can be listed, this is correct. > > > the list of computable reals contain every digit of ALL possible infinite > > sequences (3) > > No. You cannot form a list of all computable Reals.
Of course you can - it's just the list of Turing Machines.
His mistake is simply that he is saying that a finite sequence of digits contains an infinite sequence of digits.
C-B
> If you could do this, > then you could use a diagonal argument to construct a computable Real not in > the list. > > > > > OK does everyone get (1) (2) and (3). > > No. (3) is not true, as it is based on a false premise (that the computable > Reals can be listed). > > > > > There's no need for bullying (George), it's just a maths theory. Address > > the statements and questions and add your own. > > > Herc > > -- > > If you ever rob someone, even to get your own stuff back, don't use the > > phrase > > "Nobody leave the room!" ~ OJ Simpson- Hide quoted text - > > - Show quoted text -
