2005-09-28.txt:21:57:24: <Wildhalcyon> Im working on the mechanics for the word "lots" right now. It roughly means "uncountable" - so if you say "There are lots of lights" there are more than enough for any task you could possibly use them for. Think of "lots" as aleph-null
2005-11-03.txt:04:34:41: <GregorR> All the numbers between 0 and 3 is (uncountably) infinite.
2006-06-04.txt:17:28:17: <jix> yeah you get uncountable inifinite many positions
2006-08-06.txt:01:24:37: <Razor-X> You still have an uncountable number of elements, but if you have an infinity of infinities, it's intuitively easy to see that this set has more than an infinity of elements....
2006-08-06.txt:19:22:20: <ihope> Apparently the number of quantum gates is uncountable, and QBF is countable in every way, I think...
2006-09-06.txt:00:28:03: <ihope> If you need uncountably many, you're on your own.
2007-05-04.txt:01:04:06: <lament> however, you do have uncountable free time :)
2007-05-04.txt:01:43:45: <pikhq> As is distance. That doesn't mean that distance is uncountable.
2007-07-07.txt:23:14:36: <ihope> What if the range is uncountable?
2007-07-07.txt:23:14:44: <oklopol> oerjan: if it's a real -> real function, that's uncountable as ihope said
2007-07-07.txt:23:14:50: <oerjan> computable things are not uncountable
2007-08-01.txt:22:02:16: <ihope> Yes, but I can't turn on an uncountably infinite number of points.
2007-08-11.txt:23:45:14: <oklokok> can an ISM solve the halting problem of a superturing machine in uncountable time? :P
2007-12-02.txt:03:03:54: <oerjan> an uncountable number in fact
2008-02-01.txt:17:31:19: <ais523> uncountably infinite, in fact
2008-03-21.txt:23:26:14: <ais523> because it can perform uncountably many computations in parallel
2008-05-10.txt:21:13:13: <SimonRC> an uncountable stack of rules might work too
2008-06-08.txt:19:52:46: <Slereah7> Uncountable sets are for non-constructive math.
2008-06-08.txt:20:26:34: <augur> are we sure that real numbers are uncountably infinite?
2008-06-28.txt:00:47:30: <oerjan> aleph 1 is the cardinal of the first uncountable ordinal, which is again fairly concretely the _set_ of countable well-ordering classes
2008-09-18.txt:22:33:01: <ais523> Proud starts by creating an uncountably infinite number of threads
2008-11-19.txt:20:50:28: <Deewiant> I've never seen das Zeug in itself mean anything other than "stuff" as an uncountable
2008-11-19.txt:20:52:10: <Deewiant> uncountable. :-P
2008-11-19.txt:20:53:17: <Deewiant> "uncountable." » "like, singular? no, that's not right." » "uncountable". » "yeah"
2008-11-19.txt:20:55:23: <oklopol> well anyway, i haven't seen it used as an uncountable
2008-11-19.txt:21:01:02: <Deewiant> yep, and that's uncountable. Or a meaning I'm unaware of. :-P
2008-12-01.txt:16:55:36: <ais523> Proud's like I suggested but with an uncountably infinite set of assumptions
2008-12-23.txt:15:07:09: <oklopol> now, because these numbers are infinitesimally small, we will do an uncountable number of cycles
2009-01-07.txt:20:21:34: <oerjan> SPAWNS UNCOUNTABLE OFFSPRING
2009-01-25.txt:00:11:26: <oklopol> kerlo: so you need an uncountable amount of them to get anything done
2009-03-24.txt:00:06:13: <ehird> Oh, and on the topic of pseudomath, I used to try and fit uncountable sets into countable ones.
2009-03-27.txt:04:39:41: <oklowob> and then one of the comments said something about uncountable sets
2009-04-17.txt:23:05:01: <oklopol> first of all O(n^e) does not have a lower bound, when e is a real number, so while there's a lower bound for it, O(n), there is an uncountable number of possible small upper bounds.
2009-05-09.txt:03:25:07: <Gracenotes> easy peasy once you're comfortable. same with monads, and uncountable other language features
2009-05-09.txt:03:25:31: <GregorR> Uncountably finite?
2009-05-23.txt:21:33:08: <ehird> oerjan: if you devoted the whole universe - or most of it, anyway - to the calculation of an ShaFuck program, and let it run for uncountable eons, then you could generate a program
2009-06-09.txt:10:26:53: <ais523> there's an uncountable number of real numbers
2009-07-26.txt:21:08:24: <AnMaster> ehird, oh right. Did I treat "effects" as an uncountable?
2009-07-26.txt:21:09:02: <AnMaster> ehird, indeed as an uncountable then
2009-07-26.txt:21:09:20: <AnMaster> ehird, uncountable: like "water" or "milk" (you can't say, "a"/"an" about them)
2009-08-06.txt:00:14:50: <ehird> and uncountably infinitely many unstupid ones, but I wouldn't expect you to hit one :P
2009-08-13.txt:23:50:22: <oklofok> yes, every game lasts for an uncountable amount of turns
2009-08-13.txt:23:58:10: <ehird> [23:50] oklofok: yes, every game lasts for an uncountable amount of turns
2009-10-15.txt:13:44:21: * AnMaster suspects uncountably infinite at least.
2009-12-05.txt:22:33:14: <uorygl> If a function were just an expression with a free variable, there wouldn't even be uncountably many functions.
2009-12-12.txt:16:17:52: <AnMaster> oerjan, so example of uncountable but well ordered set
2009-12-12.txt:16:19:02: <oerjan> aleph-1, being the first uncountable ordinal, is the smallest example
2010-01-19.txt:20:34:26: <cpressey> Ah, well.  Is your velocity *countably* infinite or *uncountably* infinite?  Which aleph are we talking about, here?
2010-02-03.txt:08:46:32: <oklopol> i mean you can't sum over all the paths, there's an uncountable number of them
2010-02-03.txt:08:49:00: <oklopol> all the possible turns is still an uncountable amount; and is this in R^3?
2010-02-05.txt:06:12:34: <oklopol> http://knol.google.com/k/are-real-numbers-uncountable#
2010-02-05.txt:19:28:48: <cpressey> Well, can you have closures of uncountable sets?
2010-02-05.txt:19:29:35: <oklopol> topology is all about uncountability
2010-02-05.txt:19:31:12: <oklopol> "can you take the closure of an uncountably large set w.r.t. some operation"
2010-02-05.txt:19:33:12: <cpressey> So you have a graph with n nodes, and for each node there's a (potentially) uncountable set of infinite paths that starts at it.
2010-02-05.txt:20:11:03: <cpressey> Er, and I realize now I was possibly saying something much uglier.  (Every node of the tree would have an uncountable number of branches.  That's overkill.)
2010-02-05.txt:20:16:28: <oklopol> yeah i know you did, but i didn't, i said there'd be an uncountable amount of paths, because for some reason i thought the infinite paths would be there too
2010-02-13.txt:14:48:48: <alise> http://knol.google.com/k/john-gabriel/are-real-numbers-uncountable/nz742dpkhqbi/10#
2010-02-18.txt:23:06:18: <AnMaster> <cpressey> "Execution of instructions in one program induces execution of instructions in another, nearby program."  Yes. <-- I first thought "what are you messing around with by doing induction over an uncountable set"
2010-02-19.txt:05:27:34: <oerjan> <AnMaster> <cpressey> "Execution of instructions in one program induces execution of instructions in another, nearby program."  Yes. <-- I first thought "what are you messing around with by doing induction over an uncountable set"
2010-02-19.txt:05:29:31: <oerjan> however, you need to well-order the set first, and for most frequently used uncountable sets (reals, complexes) that requires using the axiom of choice.  so you don't get any concrete sense of what the order is.
2010-02-19.txt:15:03:11: <oerjan> 21:27:34 <oerjan> <AnMaster> <cpressey> "Execution of instructions in one program induces execution of instructions in another, nearby program."  Yes. <-- I first thought "what are you messing around with by doing induction over an uncountable set"
2010-02-19.txt:15:03:18: <oerjan> 21:29:31 <oerjan> however, you need to well-order the set first, and for most frequently used uncountable sets (reals, complexes) that requires using the axiom of choice.  so you don't get any concrete sense of what the order is.
2010-02-20.txt:12:15:53: <alise> "The obvious answer is that you took a computational specification of a human brain, and used that to precompute the Giant Lookup Table.  (Thereby creating uncounted googols of human beings, some of them in extreme pain, the supermajority gone quite mad in a universe of chaos where inputs bear no relation to outputs.  But damn the ethics, this is for philosophy.)"
2010-02-20.txt:16:22:15: <oerjan> MissPiggy: this leads easily to a contradiction if you have uncountably many alternatives
2010-02-20.txt:16:22:53: <MissPiggy> uncountable sample space
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-02-20.txt:17:03:44: <MissPiggy> I don't think there's any evidence for that rather than uncountable
2010-02-20.txt:17:05:09: <MissPiggy> how can you have it certinaly happening in a countable subset, but we're not sure if it will in an uncountable one..
2010-02-20.txt:21:46:06: <AnMaster> (I suspect this is non-computable and/or uncountable)
2010-02-20.txt:21:49:41: <AnMaster> anyway I maintain that the set of all possible pages including all possible linked pages as data urls is uncountable
2010-02-20.txt:22:06:52: <oklopol> AnMaster: if you have infinite pages, then there can obviously be uncountably many
2010-02-26.txt:22:23:00: <uorygl> You know, the union of all countable ordinal numbers is uncountable, but there's a countable set that has all the countable ordinal numbers as subsets.
2010-02-27.txt:06:30:49: <uorygl> There are countable models of ZFC.  Such models must contain uncountable sets.  Contradiction?
2010-02-27.txt:06:31:12: <uorygl> No; an "uncountable set" in the model is really just a set where the enumeration is not in the model.
2010-03-01.txt:13:27:24: <alise> my favourite bit of the GAZP vs. GLUT article is "The obvious answer is that you took a computational specification of a human brain, and used that to precompute the Giant Lookup Table.  (Thereby creating uncounted googols of human beings, some of them in extreme pain, the supermajority gone quite mad in a universe of chaos where inputs bear no relation to outputs.  But damn the ethics, this is for philosophy.)"
2010-03-01.txt:17:03:51: <alise> so we should represent the turkey bomb universe as an infinite (uncountably so?) data structure
2010-03-01.txt:17:11:05: <alise> [17:03] alise: so we should represent the turkey bomb universe as an infinite (uncountably so?) data structure
2010-03-12.txt:16:06:49: <AnMaster> fax, why is it called finite analysis if it works on R, (an uncountably infinite set)..
2010-03-20.txt:13:58:43: <AnMaster> at least for uncountable sets
2010-04-04.txt:18:00:04: <AnMaster> now I want an uncountably  infinite bf tape :(
2010-04-09.txt:16:33:06: <alise> *If you want the � and uncountable billions of years of suffering, you can use D.
2010-04-25.txt:01:04:52: <oerjan> and for an _uncountable_ set like the interval [0,1], it's just the usual "every number has probability 0" "paradox" (resolved by having only countable additivity of probabilities.)
2010-05-16.txt:10:54:02: <AnMaster> oerjan, can't you get a bijection between uncountable of same cardinality?
2010-05-19.txt:19:21:55: <oerjan> AnMaster: well a continuous circle is uncountable, so...
2010-06-04.txt:23:51:16: <alise> uncountable aeons ago
2010-06-21.txt:21:59:28: <Phantom_Hoover> Uncountability almost certainly factors into it.
2010-06-21.txt:21:59:29: <AnMaster> cpressey, both are uncountably infinite, could be tricky to diagonalize?
2010-06-21.txt:22:21:04: <AnMaster> oerjan, countable and uncountable?
2010-06-21.txt:22:21:31: <AnMaster> if that is true countable == uncountable which is not true afaik?
2010-06-21.txt:22:22:08: <oerjan> AnMaster: um no, there is an unending (in fact itself uncountable) collection.  2^M has larger size than M, always (Cantor diagonalization)
2010-06-21.txt:22:24:25: <oerjan> s/infinitely/uncountable/, really
2010-06-22.txt:16:11:12: <Phantom_Hoover> Hence implying that they are also uncountably infinite?
2010-06-22.txt:18:47:50: <oklopol> but umm computable reals being uncountable
2010-06-22.txt:18:53:06: <oklopol> the computable reals are computably uncountable
2010-06-22.txt:19:50:35: <oklopol> oerjan and i have to talk about computable uncountability now
2010-06-22.txt:19:51:02: <oklopol> yes, the computable reals are computably uncountable
2010-06-22.txt:20:14:30: <oklopol> if the sets can be uncountable then...
2010-06-23.txt:19:52:42: <AnMaster> oklopol, if there is no holes in space it basically mean you will have an uncountable set?
2010-06-23.txt:20:08:45: <oklopol> (i'm joking, there are uncountably many)
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
2010-06-25.txt:23:11:12: <AnMaster> pikhq, well it could be going to uncountable infinite then </technobable>
2010-06-25.txt:23:11:43: <AnMaster> oerjan, also do you highlight on uncountable or something?
2010-07-24.txt:22:55:40: <Phantom_Hoover> But surely that makes them uncountable?
2010-07-29.txt:23:10:54: <Phantom_Hoover> I like using "error" as an uncountable noun.
2010-09-04.txt:01:49:02: <oerjan> Sgeo: is it countable or uncountable?
2010-09-04.txt:01:49:27: * Sgeo wonders if "uncountably finite" makes sense
2010-09-04.txt:01:50:09: <zzo38> Sgeo: It only make sense if what you mean by "uncountably" is that it is too long to count and you don't have time or words for them
2010-09-04.txt:01:50:30: <zzo38> But that is probably not what is meant, because it isn't what it meant in "uncountably infinite"
2010-09-04.txt:01:54:44: <cpressey>  * Sgeo wonders if "uncountably finite" makes sense  <--  Thank you; you are justifying "very strange"
2010-09-04.txt:01:55:15: <cpressey> 1, 2, 3... ah, shit, I'm bored.  Well, I guess that the numbers on the clock are uncountably finite.
2010-09-04.txt:01:56:34: <oerjan> in a sense such a set is uncountable (not equivalent to a subset of naturals) but still finite in the other sense
2010-09-04.txt:02:02:54: * Sgeo happies oerjan for allowing "uncountably finite" to exist
2010-09-05.txt:04:05:47: <Sgeo> Is there an uncountable infinite discreet space? A countably infinite continuous space? Or are these axiomatically tied in, or is there a theorem?
2010-09-05.txt:04:09:27: <oklofok> "Is there an uncountable infinite discreet space?"
2010-09-05.txt:04:09:41: <oklofok> take an uncountably infinite set X
2010-09-05.txt:04:10:52: <oklofok> and it's uncountable because X is
2010-09-08.txt:17:20:17: <fizzie> It wouldn't even necessarily need a symlink in ~, just something to generate /tmp/foo for each user, and set TMPDIR to that. Though I'm sure there's an uncountable number of apps that have "/tmp" hardcoded.
2010-09-14.txt:22:33:57: <Vorpal> uncountable keyboard?
2010-09-18.txt:23:52:13: <Vorpal> to me code in the sense of "source code" is uncountable
2010-11-04.txt:14:12:22: <Vorpal> the states for the bignum case would be uncountable, while for the bit case they would be countable, no?
2010-11-10.txt:17:00:54: -!- Sgeo changed the topic of #esoteric to: ASIEKIERKA FOREVER | http://tunes.org/~nef/logs/esoteric/?C=M;O=D | amount of topic spam: uncountably infinite
2010-11-12.txt:15:37:18: <Sgeo> I was about to confusedly ask something along the lines of "Is the amount of infinite sets of rationals uncountably infinite somehow? Because if not, I don't see how reals defined in terms of Dedekind cuts are uncountably infinite"
2010-11-12.txt:15:37:46: <Sgeo> But then, I _think_ the diagonalization thingy says that there is an uncountably infinite amount of those sets
2010-11-12.txt:15:39:30: <oklopol> Sgeo: the amount of infinite subsets of rational numbers is uncountable
2010-11-12.txt:15:40:19: <oklopol> well there's an uncountable number of subsets of integers
2010-11-12.txt:20:38:59: <elliott> angst (uncountable)
2010-11-12.txt:20:39:29: <oklopol> haha elliott has an uncountable amount of angst
2010-11-12.txt:20:39:52: <elliott> cheater99: "homophobia (uncountable)
2010-11-16.txt:01:53:23: <Sgeo> On http://en.wikipedia.org/wiki/Uncountably_infinite
2010-11-30.txt:12:45:43: <Phantom_Hoover> 22:15:14 <oerjan> interestingly, if you had a library of all possible text files arranged alphabetically, _finding_ anything interesting in it would be as hard as inventing it yourself ← surely the set of all possible text files is uncountably infinite?
2010-11-30.txt:12:49:24: <oerjan> <Phantom_Hoover> 22:15:14 <oerjan> interestingly, if you had a library of all possible text files arranged alphabetically, _finding_ anything interesting in it would be as hard as inventing it yourself ← surely the set of all possible text files is uncountably infinite?
2011-01-13.txt:19:06:49: <Vorpal> in my country you can drive an uncountable infinity distance
2011-01-13.txt:23:02:16: <pikhq> The issue with "VIRII" as a plural for "VIRUS" is that in Latin, "VIRUS" is an uncountable noun.
2011-01-13.txt:23:03:11: <Phantom_Hoover> At least with comparison to their entry for arma, which I *know* is an uncountable noun.
2011-01-23.txt:00:21:44: <oklofok> then don't we just get the usual kinds of configurations over Z^2, but just an uncountable number of disjoint orbits
2011-02-26.txt:23:19:57: <oklopol> (we'll take it as a given that any natural way to make a for-loop over the uncountable set of points gives us the right answer)
2011-03-09.txt:01:31:06: <quintopia> up to the point of showing 2^N is uncountable
2011-03-12.txt:22:32:12: <Phantom_Hoover> How do you have an uncountably infinite tree?
2011-03-12.txt:22:32:57: <Zwaarddijk> what would be interesting would be if someone managed to abuse terminology cleverly enough to get an uncountably finite something
2011-03-12.txt:22:39:04: <ais523> I don't see why that would make it uncountable
2011-03-12.txt:22:47:47: <Phantom_Hoover> Zwaarddijk, conclusion: *all* finite sets are uncountable.
2011-03-12.txt:22:58:36: <Phantom_Hoover> To allow uncountable finite sense.
2011-03-12.txt:22:59:12: <oerjan> Phantom_Hoover: well without the axiom of choice you can have uncountably finite sets, as said
2011-03-13.txt:12:16:30: <elliott> 23:15:28 <Phantom_Hoover> How do you have an uncountably infinite tree?
2011-03-13.txt:12:19:44: <oklopol> "[14:00:45] <elliott> 23:15:28 <Phantom_Hoover> How do you have an uncountably infinite tree?" by having one?
2011-03-13.txt:12:23:37: <oklopol> if a tree is uncountable, then of course there even has to be a vertex of uncountable degree, because a countable union of countable sets is countable
2011-03-13.txt:12:42:20: <cpressey> '<oklopol> "[14:00:45] <elliott> 23:15:28 <Phantom_Hoover> How do you have an uncountably infinite tree?"' <- have a countably infinite number of branches at each node? at a guess.
2011-03-13.txt:12:44:45: <oklopol> but the point is connectivity is defined by finite paths, so connected components will be countable unless you have uncountable degrees locally, somewhere
2011-03-13.txt:12:47:20: <cpressey> oklopol: er - what if you have a root node, with a countably infinite number of children, but they're all leafs? that's not uncountable
2011-03-13.txt:12:48:00: <cpressey> oh, if you have UNcountably infinite branches at one node, then yes the tree is uncountable :)
2011-03-13.txt:12:48:04: <oklopol> you will have to have at least one node with uncountable degree
2011-03-13.txt:12:52:33: <Phantom_Hoover> cpressey, are you confused as to countable vs. uncountable infinity?
2011-03-13.txt:12:56:06: <Phantom_Hoover> cpressey, FWIW, the *set* of all infinite graphs is uncountable.
2011-03-13.txt:13:38:47: <cpressey> oklopol: oh, i just saw why that tree thing isn't uncountable :)
2011-03-20.txt:14:56:00: <oklopol> you can apply that... what's 4 times uncountable?
2011-03-20.txt:14:56:40: <oklopol> but it's divisible by two, so maybe you could prove the claim for p*uncountable where p is a prime first, and then show the the numbers that satisfy it are closed under multiplication
2011-03-21.txt:21:38:09: <oklopol> pikhq_: yeah right, next u gonna say the reals are uncountable lol
2011-03-21.txt:22:10:27: <cheater-> uncountably many.
2011-03-21.txt:22:10:49: <Phantom_Hoover> It's uncountable, actually.
2011-03-21.txt:22:11:15: <rapido> i don't like infinite/uncountable stuff - but hey - i'' make an exception
2011-03-21.txt:23:22:07: <oklopol> iterations implies countable, and cantor set implies uncountable space
2011-03-21.txt:23:23:05: <oklopol> and ultrafilters are rather fucking big in uncountable spaces so that obviously cannot happen
2011-03-29.txt:17:52:59: <Phantom_Hoover> Hmm, the Cantor set is uncountable?
2011-03-29.txt:17:57:28: <oerjan> also, yes the cantor set is uncountable, same cardinality as the real numbers or the interval [0,1].
2011-04-21.txt:04:43:42: <oklopol> elliott: i meant more like, for each ordinal, you define a partially filled board by taking the union of all the last ones and then applying the player functions in succession, then play until the first uncountable ordinal
2011-04-21.txt:19:23:16: <crystal-cola> http://qchu.wordpress.com/2009/11/05/i-dont-trust-uncountable-sets/
2011-04-21.txt:20:17:08: <oklopol> elliott: every time a black hole and a white hole are joined in holy matrimony, an uncountable set is born
2011-04-22.txt:16:28:22: <Gregor> Y'know, even though I've typed "unsigned char" uncountably many times, it makes more sense for it to be signed by default, since that's consistent with all the other types.
2011-06-01.txt:02:11:07: <CakeProphet> ptr+1 points to the next char in the string, and all of the bytes of the infinite width char are represented as decimal points (but then they become uncountable, which is another problem I think)
2011-06-10.txt:23:18:15: <oklofok> If a space is metrizable, then it is sequentially compact if and only if it is compact. However in general there exist sequentially compact spaces which are not compact (such as the first uncountable ordinal with the order topology), and compact spaces which are not sequentially compact (such as the product of uncountably many copies of the closed unit interval).
2011-06-13.txt:00:02:03: <elliott> but the reals are uncountable
2011-06-13.txt:00:02:10: <elliott> uncountable > countable
2011-06-13.txt:00:05:28: <CakeProphet> I wonder what would be required of strings to produce an uncountable number of them.
2011-06-13.txt:00:07:28: <oerjan> CakeProphet: infinite (but still countable) length noncomputable strings are uncountable
2011-06-21.txt:02:48:39: <zzo38> MWI is not really multiple worlds. It is like all uncountable possibilities.
2011-06-23.txt:06:08:44: <elliott_> then there are uncountable theorems
2011-06-23.txt:06:14:52: <coppro> if the model has an uncountable member, the set of truths be uncountable
2011-06-23.txt:06:32:35: <CakeProphet> well, if we could prove that uncountable sets are also interesting, and that cardinality of a set corresponds to more interesting sets
2011-06-23.txt:06:42:24: <Sgeo_> Involve an infinite number of natural numbers, _then_ it's uncountable
2011-06-23.txt:06:43:51: <CakeProphet> ....? but aren't rational numbers a quotient of /any/ (read: from an infinite set of natural numbers) integers? According to what Sgeo_ says that would make rational numbers uncountable?
2011-06-23.txt:06:45:15: <elliott_> CakeProphet: the set of infinite lists of naturals is uncountable.
2011-06-23.txt:06:45:47: <Sgeo_> Now, if you had infinite number of dimensions, even though each dimension can only take integer values, the number of points is uncountably infinite
2011-06-23.txt:06:47:29: <Sgeo_> The reals are uncountably infinite, even though each digit can only have 1 of 10 values.
2011-06-27.txt:13:08:16: <elliott> uncountably infinite spheres
2011-06-27.txt:14:38:20: <elliott> Gregor: It would be kind of impossible what with the uncountably infinite thing :P
2011-07-17.txt:05:35:47: <oklofok> note that unions can be arbitrary, you could even have an uncountable number of open sets that you're taking the union of
2011-07-19.txt:20:37:42: <oklopol> "<Taneb> But theoretically, there are only a finite number of possible games of Go" <<< depends on endgame rules, i think some of them might let you have an uncountable number of games?
2011-07-19.txt:20:51:51: <oklopol> ais523: alright. then just add some possible move in the middle and you'll have uncountably many games.
2011-07-19.txt:21:12:53: <coppro> oklopol: I've never heard of any rules of Go which would lead to an uncountable number of games
2011-07-19.txt:21:15:22: <ais523> because you can interleave them uncountably many ways
2011-07-19.txt:21:16:15: <ais523> thus, uncountably many games are possible
2011-07-22.txt:20:59:50: <Sgeo> (I thought maybe you could enumerate through all uncountably infinite states of an infinite 2d binary grid by starting at one point, on and off, then expanding it, etc. I finally realized that those are counting through finite pieces of the grid, not the actual infinite grid
2011-08-09.txt:20:52:58: <NihilistDandy> "I proved that the reals are uncountably infinite. Where? There, diagonally. Pretty sneaky, sis."
2011-08-19.txt:23:49:18: <CakeProphet> okay so, I'm pretty sure the number of Haskell linked lists in uncountable, but how would you prove this?
2011-09-06.txt:07:25:41: <zzo38> On the wall, I have the picture of creature with one eye and uncountable tentacles. Not because there is too many to count; it is because the artist draw the picture to make it difficult.
2011-09-14.txt:04:27:25: <oklopol> if a tiling never repeats itself, you have uncountably many ways to tile the plane
2011-09-14.txt:04:27:47: <oklopol> i mean if there is no periodic tiling, then you have uncountably many tilings
2011-09-14.txt:04:29:20: <oklopol> Therefore, a finite patch cannot differentiate between the uncountably many Penrose tilings, nor even determine which position within the tiling is being shown.[43]
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:37:22: <oerjan> CakeProphet: the number of sets of rationals is uncountable, for a start.
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
2011-10-25.txt:23:18:50: <oklopol> i'm actually playing continuous path on it all day long, which is uncountably infinite times cooler.
2011-11-12.txt:22:00:22: <oerjan> the latin virus is an uncountable noun, so any weird plural is suspect.
2011-12-02.txt:10:05:20: <kallisti> "So there are as many points in the Cantor set as there are in [0, 1], and the Cantor set is uncountable "
2011-12-11.txt:00:57:52: <oerjan> of which there are uncountably many, in fact to-big-to-be-a-set many.
2011-12-15.txt:16:22:08: <elliott> Someone should figure out exactly how much you can solve with a halting oracle; I'm pretty sure you can nest it to solve some statements about uncountable sets, but I don't think it can do everything.
2012-01-07.txt:13:51:16: <Phantom_Hoover> oklopol, well, um, at the start of the game you have squares of piece (that's like piece but an uncountable noun) occupying the subset of [0,8]^2 corresponding to their initial positions in normal chess.
2012-01-07.txt:20:08:24: <Vorpal> so anything else doesn't matter unless it is uncountable
2012-01-11.txt:20:12:47: <kallisti> where I get learn about COUNTABLE AND UNCOUNTABLE SETS.
2012-01-12.txt:19:01:34: <Ngevd> I'm pretty sure infinite-length strings are uncountable
2012-01-12.txt:21:29:24: <Phantom_Hoover> 19:01:34: <Ngevd> I'm pretty sure infinite-length strings are uncountable
2012-01-12.txt:21:33:07: <Phantom_Hoover> 19:01:34: <Ngevd> I'm pretty sure infinite-length strings are uncountable
2012-02-05.txt:18:41:57: <fizzie> And apparently also the only possible winner, too. (530k uncounted votes, 660k lead.)
2012-02-13.txt:00:06:23: <oklopol> or at the first uncountable ordinal
2012-02-16.txt:23:51:53: <kallisti> fizzie: well you could make those parameters of a function and then see if the domain is uncountable.
2012-03-09.txt:20:24:19: <elliott> augur: Why are you claiming that you have a bijection between a countable set and an uncountable set?
2012-03-10.txt:03:10:34: <elliott> augur: i did; you clarified that it was actually a bijection between two countable sets, except the topic was whether you could use a method that requires an isomorphism to a specific _uncountable_ set
2012-03-17.txt:11:13:29: <elliott> Phantom_Hoover: headache am uncountable noun
2012-03-30.txt:19:04:16: <oklopol> alvur: do you believe in uncountable sets?
2012-03-30.txt:19:06:52: <alvur> oklopol, there's nothing uncountable but God!
2012-03-30.txt:19:09:55: <oklopol> i'm a uncountable set fundamentalist
2012-03-30.txt:19:34:20: <Phantom_Hoover> <alvur> oklopol, there's nothing uncountable but God!
2012-03-30.txt:19:47:13: <oklopol> oerjan: my ban finger started itching when he told me he doesn't believe in uncountable sets.
2012-03-31.txt:22:36:12: <elliott> wait did Sgeo not know the reals were uncountable before today
2012-03-31.txt:22:37:08: <ais523> elliott: they're exactly uncountable, they're no more than uncountable
2012-04-16.txt:16:09:06: <Phantom_Hoover> Huh, the Chinese for 'card game' is uncountable.
2012-04-28.txt:10:31:12: <oklopol> because euclidean space, that is, R^n for R the reals and n a natural number is uncountable, so you need to have at least the cardinality of 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-05-19.txt:21:29:57: <Taneb> I'm going for uncountable
2012-05-19.txt:21:33:11: <Taneb> If it's uncountable without putting 8s in other 8s, it will be uncountable with that ability
2012-05-19.txt:21:33:28: <elliott> It's uncountable because you can imagine packing the reals the same way, Q.E.D..
2012-05-19.txt:21:33:56: <shachaf> OK, so how is it uncountable without putting 8s in other 8s?
2012-05-19.txt:21:53:34: <shachaf> OK, but how do you get uncountably many that way?
2012-05-19.txt:22:05:36: <Sgeo> How would a packing problem have uncountably infinite pieces in a space?
2012-05-19.txt:23:07:29: <oklofok> the idea is similar to the one for "uncountable sum of positive reals is infinite"
2012-05-19.txt:23:10:14: <oklofok> similarly, for the eights, we note that if you take any "rational interval of 8 approximations", then some approximation interval is uncountable, which will be a contradiction. by an approximation interval i mean something like "height of the 8 is between x and y, and the angles in the middle are between z and w" or something.
2012-05-19.txt:23:25:49: <oklofok> can no space with a nontrivial fundamental group have uncountably many nonoverlapping embeddings?
2012-05-20.txt:00:24:11: <oklofok> "oklofok � can no space with a nontrivial fundamental group have uncountably many nonoverlapping embeddings?" oookay wtf was i thinking :D