Re: Primes: Randomness and Prime Twin Proof

Martin Winer wrote:
Then, you have to include all of this "work with prime twins"
in your proof. Don't be mysterious about it! Supposing that
you know something that we don't know, how would you expect
us to understand and accept your proof if you don't tell us?

http://www.rankyouragent.com/primes/primes.htm#_Toc129077444

Heh, I see that I was unwise to wade into this discussion at
all. Probably I'll make things worse by saying anything more,
but ok, here goes:

Your definition of mr is baffling to me. I wish that you would
actually *define* what you mean by the reduction operation,
instead of just giving examples of it. Frankly, I think there will
be difficulties making it well-defined (i.e. assuring that mr exists
for any given string) but nobody can know one way or the other
until you make clear exactly what you mean, i.e. make the
definition explicit. It doesn't help that your notation has
problems, e.g. does
100... mean 100100100100... (3-digit repeating pattern)
or do the dots mean you keep repeating the zeroes? And when
you say
110100100101100... (every 3rd and 5th)
I've looked at this quite a while and I still can't figure out every
3rd and 5th *what*. I admit, I'm sometimes dense about such
things, but could you explain your comment? Also (again) is
that whole string your repeating pattern?

Anyhow, as far as I understand what you're doing, it seems to
me that the procedure of taking unions of repeating strings does
*not* result in strings that are random. If a bit is on at position
m in one of the bitstrings in the union, and the repeating pattern
in that string is n bits long, then bits nk + m, for k = 0,1,2,...
are all guaranteed to be on in the infinite union, and that is
certainly *not* "random" by any reasonable definition of the
term. I didn't try to read much further so I don't really know
whether this is truly a fatal objection -- indeed, the pattern of
primes is *not* random, it has to obey the repeating patterns
of the sieve of Eratosthenes -- so maybe this particular objection
doesn't matter. But your lack of clarity here doesn't inspire one
to much confidence.

.

Relevant Pages

  • Re: Well Ordering the Reals
    ... >> Which is of the same cardinality as the set of all hyperintegers. ... The ellipses can represent a bit string of any ... > distant limit points with a repeating pattern. ... > infinite range of bits, and compare and manipulate that string ...
    (sci.math)
  • Re: value of unknown type
    ... converting it to a string implicitely or explicitely? ... specific type inference / checking algorithm depends on the ... specifically as some kind of union type. ...
    (comp.lang.functional)
  • Re: Cannot post string "union select" php form
    ... i am trying to figure it out why i cannot post string "union select" ... every time i try to post data which content union and select .. ... i guess the server i am using has some kind of filter and if a post ... Do you have some PHP code showing this? ...
    (comp.lang.php)
  • Re: value of unknown type
    ... converting it to a string implicitely or explicitely? ... Actually, you don't have an "unknown" value, you have a value of type ... "implicit union type"). ... I admit that I do not understand what Stefan and then you mean ...
    (comp.lang.functional)
  • Re: Cannot post string "union select" php form
    ... i am trying to figure it out why i cannot post string "union select" ... every time i try to post data which content union and select .. ... i guess the server i am using has some kind of filter and if a post ... so i think the problem is with string which i am posting ... ...
    (comp.lang.php)
Quantcast