Re: Primes: Randomness and Prime Twin Proof

Your proof is not complete until you can justify the reasoning
behind how you make this choice, between cases that can be
treated probabilistically and cases that cannot. I think you will
not find that an easy task.
Thanks for this Russell. You're so very right. In fact, I was leading
the conversation in this direction. Take a coin flip. Odds are 50 50
that it'll be heads. But really, in this case, probability is just an
estimation of some algorithm that we don't know. For example, if we
knew the speed of the flippers thumb, trajectories, weights, distances
et al, we would know with certainty if it would be heads or not.

Suppose that we had a 'truly random' coin. That is a coin where it was
impossible in any way to know the outcome without flipping it first.
Then probability is no longer an estimate of a knoweable algorithm, it
IS the algorithm.

So back to my question, the slot machine with 1 in 2 odds, 1 in 3 odds,
1 in 4 odds ... I wanted the person I posted this to to answer it
himself to force him to see my point, but, ok, here's the answer.
Q: given such a machine as described above, is there a point where one
will never win again?
A: If the machine is pseudo random, then the answer is "Don't know"
because we don't know the algorithm. If the machine is truly random,
the answer is "NO" because we always have a non zero probability try in
a 'truly random' distribution.

The question now is: what the hell is truly random, and does it exist?
You may all be suprised to know that I used to think NO. I thought
there was only 'sufficiently complex to avoid easy categorization', but
no such thing as random. My work with prime twins shows that Pat(n)
gets as close to 'random' as you choose to get... hence there is such a
thing as random.

You need to go back and rethink your assumptions.
'fraid not.
It's so refreshing to see such an open mind... especially in a
person so unfamiliar with a well-developed field of study.

Newtonian physics was a well developed field of study in 1920. The
study of physics was deemed 'closed'. If the game on this forum wasn't
"let's show the neophyte how stupid he is" and instead was "let's learn
from each other" I may not need to make such responses to jar people
into thinking compared with dismissing me as a neophyte (which this
gentleman was attempting to do)

.

Relevant Pages

  • Re: Deterministic Algorithm for Random Number Generation Using Coin Flips
    ... -the algorithm can guarantee that there is 0 probability that the ... algorithm will run forever. ... (or assuming the coins were not labeled: toss #1, toss #2, or toss ... Take a red coin and a green coin and toss ...
    (sci.math)
  • Re: Algorithm For Ensuring p & q Sufficiently Large For n in RSA
    ... probability of mathematical failure just means that you are getting your ... contract for an algorithm, then it should do that, ... adverse effect is less than chance of all of you spontaneously ...
    (sci.crypt)
  • Re: Probability of coins
    ... What is the expected number times that the algorithm flips the strange coin in terms of p simulate one fair coin toss? ... tosses is the Wiener-Shannon information in one toss. ... Since the probability of this is 2p, ...
    (sci.math)
  • Re: Primes algorithm
    ... > method which is generally used, as far as I know, is the Miller-Rabin ... > algorithm, ... > that a given number is composite, then it is definitely composite; ... A number is prime with a probability equal to either 0 or to 1. ...
    (sci.crypt)
  • Re: Deterministic Algorithm for Random Number Generation Using Coin Flips
    ... Is there some algorithm, using only coin flips (and assuming that the ... -the algorithm can guarantee that there is 0 probability that the ... (or assuming the coins were not labeled: toss #1, toss #2, or toss ...
    (sci.math)