Re: Cardinality of Set of Computable Numbers?

From: |-|erc (trymyform_at_wwwadamskingdom.com)
Date: 12/27/03 

Date: Sat, 27 Dec 2003 20:47:43 +1000

        ----------------------------- <^> <(·¿·)> <^> -----------------------------

"Russell Easterly" <logiclab@comcast.net> wrote >

> Let x initally be (0).
> If s has the form 111...111(0) and the length of the initial segment of s
> is longer or equal to the length of the initial segment of x then take the
> initial segment of s, append a 1, and make this new string the initial
> segment of x.
>
> Examples:
>
> s x
> (0) 1(0)*
> 1(0)* 11(0)
> 11(0) 111(0)
>
> Prove that x differs from every member of S.

Isn't x just equal to a different s, note *.
A new number has to be a function of the list, not a single member.

Herc

Relevant Pages

  • Re: Cardinality of Set of Computable Numbers?
    ... >> segment of s is longer or equal to the length of the initial ... >> Prove that x differs from every member of S. ... >> x differs from every s that does not end with. ... each binary string represents a natural number in base 1. ...
    (comp.theory)
  • Re: Cardinality of Set of Computable Numbers?
    ... > The diagonal method can be converted into the computable number proof. ... Let S be a set and every member of S be a RM computable number. ... If s has the form 111...111and the length of the initial segment of s ... Prove that x differs from every member of S. ...
    (comp.theory)
  • Re: Cantor Confusion
    ... >> The infinite initial segment differs from each finite initial ... >> segment by having an element that is not in the finite initial segment. ... There is no single number where it differs from *all* finite segments. ... > counting along the sequence of natural numbers. ...
    (sci.math)
  • Re: Cardinality of Set of Computable Numbers?
    ... > segment of s is longer or equal to the length of the initial ... > Prove that x differs from every member of S. ... > x differs from every s that does not end with. ... each binary string represents a natural number in base 1. ...
    (comp.theory)
  • Re: Cardinality of Set of Computable Numbers?
    ... > of s is longer or equal to the length of the initial segment of x then ... > Prove that x differs from every member of S. ... > x differs from every s that does not end with. ... member of S (at least not using your technique). ...
    (comp.theory)