|
574
|
1 2010-02-05.txt:19:29:35: <oklopol> topology is all about uncountability
|
|
|
2 2010-02-20.txt:17:02:04: <oerjan> that's my intuition on that anyway - the distinction between probability 1 and surely is only needed because of uncountability stuff
|
|
|
3 2010-06-21.txt:21:59:28: <Phantom_Hoover> Uncountability almost certainly factors into it.
|
|
|
4 2010-06-22.txt:19:50:35: <oklopol> oerjan and i have to talk about computable uncountability now
|
|
|
5 2010-06-23.txt:20:15:06: <oklopol> for uncountability (in the real case), notice you can add small enough fluctuations to each element of the sequence
|
|
|
6 2011-09-14.txt:04:37:12: <oklopol> Patashu: i can easily prove the uncountability thing to you if you know what compactness is, otherwise i'll go to work
|
|
|
7 2011-10-12.txt:10:36:29: <CakeProphet> how does that lead to uncountability?
|
|
|
8 2011-10-12.txt:10:39:30: <oerjan> for the rest, see an actual uncountability proof.
|
|
|
9 2011-10-24.txt:07:46:56: <elliott> `addquote <coppro> clearly darth needs something gray and big and proving the uncountability of the reals
|
|
|
10 2011-10-24.txt:07:47:03: <HackEgo> 691) <coppro> clearly darth needs something gray and big and proving the uncountability of the reals
|
|
|
11 2012-05-18.txt:03:00:52: <HackEgo> 646) <coppro> clearly darth needs something gray and big and proving the uncountability of the reals
|
|
|
12 2012-07-03.txt:03:14:01: <HackEgo> *poof* <coppro> clearly darth needs something gray and big and proving the uncountability of the reals
|
