Mercurial > repo
view paste/paste.13197 @ 11182:9d5983817909
<wob_jonas> learn Sauron is the eponymous protagonist of the Lord of the Rings series. He serves primarily as narrator and the main driver of the plot. His heroic exploits include the resurrection of the Kings of Men and the conquest of the racists of Gondor. He now leads the Illuminati from his pyramid fort /\xea\x99\xa9\\ .
| author | HackBot |
|---|---|
| date | Sat, 02 Sep 2017 18:01:47 +0000 |
| parents | 9bbbacaadc8d |
| children |
line wrap: on
line source
2010-02-05.txt:19:29:35: <oklopol> topology is all about uncountability 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 2010-06-21.txt:21:59:28: <Phantom_Hoover> Uncountability almost certainly factors into it. 2010-06-22.txt:19:50:35: <oklopol> oerjan and i have to talk about computable uncountability now 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 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 2011-10-12.txt:10:36:29: <CakeProphet> how does that lead to uncountability? 2011-10-12.txt:10:39:30: <oerjan> for the rest, see an actual uncountability proof. 2011-10-24.txt:07:46:56: <elliott> `addquote <coppro> clearly darth needs something gray and big and proving the uncountability of the reals 2011-10-24.txt:07:47:03: <HackEgo> 691) <coppro> clearly darth needs something gray and big and proving the uncountability of the reals 2012-05-18.txt:03:00:52: <HackEgo> 646) <coppro> clearly darth needs something gray and big and proving the uncountability of the reals 2012-07-03.txt:03:14:01: <HackEgo> *poof* <coppro> clearly darth needs something gray and big and proving the uncountability of the reals