Re: etc



imaginatorium@xxxxxxxxxxxxx wrote:
David Marcus wrote:
imaginatorium@xxxxxxxxxxxxx wrote:
David Marcus wrote:

Why not? If I generate one a second and keep doing it forever, then I
will have generated an infinite number of digits.

You will? But you just said above that you won't. You won't ever
finish, so there is no end, no point at which anything will have been
"generated".

Sorry. Wrong tense of the verb. I should have said, "I will generate".

Uh, don't think that works either. ("I will generate", in the absence
of any possible state in which "I will have generated", seems to be
false.)

Why? Anyway, since we are doing thought experiments, I don't see why I
can't imagine stepping out of time to consider the entire output of the
infinite process.

Consider the obvious algorithm for finding an even prime greater than
2:

Set x to 4
loop ( if x is prime, end with SUCCESS; else add 2 to x)

The only exit from this program is a successful one, so if I run it, I
assert "I will find an even prime greater than 2". Are you claiming
that your algorithm for "generating this infinite number of digits"
will end before mine? If not I suggest your "generation" is certainly
not going to be more successful than my search for an even prime
greater than 2.

I think you have to be _very_ careful here: careless talk fills the
crank heart with hope. Surely the reason for the axiom of infinity is
exactly something like the impossibility of "generating" the infinite
set by some sort of process.

(I've used 'algorithm' and 'process' interchangeably - perhaps it
should be 'process', because by normal definition an algorithm
necessarily terminates.)

I certainly didn't mean to imply the process ever ends. I'm just
defining a sequence. The range of the sequence is an infinite set. Of
course, you need the axiom of infinity to define a sequence.

Your algorithm runs forever. However, it doesn't produce any output
during this time. My process does.

--
David Marcus
.



Relevant Pages

  • Re: Chex Wat: Pi is "random" and "not predictable"?
    ... their output sequence. ... The fact is that an algorithm can also be used to ... first was about the probability of finding an apparent match. ... They may be matched within e at an infinite ...
    (talk.origins)
  • "Algorithmic Randomness, Quantum Physics, and Incompleteness"
    ... all finite sequences are to be found infinitely often and ... different members of the infinite set of random numbers. ... Just using random numbers with initial digits 1 thru 9, ... it generated by a shorter input algorithm than the length ...
    (sci.logic)
  • Re: New countable infiniity logic
    ... No, not only doesn't Dec3 have an infinite number of digits in it, it ... Does that array have any characters in it? ... // Finite sequence of digits ...
    (sci.math)
  • Re: New countable infiniity logic
    ... No, not only doesn't Dec3 have an infinite number of digits in it, it ... Does that array have any characters in it? ... // Finite sequence of digits ...
    (sci.logic)
  • Re: The Indescribable Random Numbers
    ... exists that generates the sequence f. ... numbers must be uncountably infinite. ... Cantor's diagonalisation process is not an algorithm in the sense most ... I agree that computing pi to n decimal places is unbounded as n ...
    (sci.math)