# HG changeset patch # User HackBot # Date 1341285590 0 # Node ID 9bbbacaadc8dfa183a9aaf45429e934c8b5f0750 # Parent efd0daadabdb4401972e6b9ca1c6e4e991e77e06 pastelog uncountability diff -r efd0daadabdb -r 9bbbacaadc8d paste/paste.13197 --- /dev/null Thu Jan 01 00:00:00 1970 +0000 +++ b/paste/paste.13197 Tue Jul 03 03:19:50 2012 +0000 @@ -0,0 +1,12 @@ +2010-02-05.txt:19:29:35: topology is all about uncountability +2010-02-20.txt:17:02:04: 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: Uncountability almost certainly factors into it. +2010-06-22.txt:19:50:35: oerjan and i have to talk about computable uncountability now +2010-06-23.txt:20:15:06: 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: 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: how does that lead to uncountability? +2011-10-12.txt:10:39:30: for the rest, see an actual uncountability proof. +2011-10-24.txt:07:46:56: `addquote clearly darth needs something gray and big and proving the uncountability of the reals +2011-10-24.txt:07:47:03: 691) clearly darth needs something gray and big and proving the uncountability of the reals +2012-05-18.txt:03:00:52: 646) clearly darth needs something gray and big and proving the uncountability of the reals +2012-07-03.txt:03:14:01: ​*poof* clearly darth needs something gray and big and proving the uncountability of the reals