In article <6c266f36-9aef-4a3f-b8d5-4e81d8e5a72d@r28g2000yqj.googlegroups.com>, WM <mueckenh@rz.fh-augsburg.de> wrote:
> On 30 Okt., 13:32, William Hughes <wpihug...@gmail.com> wrote: > > > > The list has tried infinitely often to extend the string of ones by > > > another one. The result is insufficient. What should be done, if > > > infinitely many attempts have failed? > > > > Stop beating a dead horse and use a method (e.g. inductive definition) > > that will not fail. > > Every natural number of 1's can be reached by induction. > The infinite string cannot be reached by induction.
It can by the sort of induction mathematicians use:
IF there is a 1 in position 1, and if whenever there is a 1 in position n there is also a 1 in position n+1, THEN there is a 1 in every position indexed by N.
Looks like induction gives the lie to WM on that one! --
