well-founded floundering

[Marc LeBrun]

 >=Jim Nastos
 > Even though the set of integer sequences is uncountable, you can always
 > be sure that the set of *submitted* sequences is countable (in fact
 > finite.)

Why *always*?  One could imagine that, someday, using quantum computers, 
you could submit uncountable superpositions of sequences.

(I can't wait for the corresponding superseeker!)

OK, OK, back to the "grinstone" for me too!