In article <ac6dd774-919c-4017-9570-21d6cd73b123@ra8g2000pbc.googlegroups.com>, Graham Cooper <grahamcooper7@gmail.com> wrote:
> On Jun 2, 12:32 am, "LudovicoVan" <ju...@diegidio.name> wrote: > > "Graham Cooper" <grahamcoop...@gmail.com> wrote in message > > > > > Here is an alternate take that seems to fall on deaf ears. > > > > > The list of computable reals contains every digit sequence of ALL > > > LENGTHS. > > > > > Good 'nuff! > > > > Good for what? > > By the Church Turing thesis you cannot find a superset of computable > reals. > > > > > By the diagonal argument, it is simply false: > > It trivially holds until you can find a ANTIDIAGONAL containing some > digit that is not a computable sequence. Which digit is that?
A digit is not ever a sequence, though may be part of one. --
