I suppose you could write a rule 40 cellular automaton or something similar, which spawns infinitely many worlds identical to ours as it runs and then proceeds to clear the memory- effectively removing their existence. None the less, sage for shitty thread.
namespace WorldDomination {
static class Program {
static void Main() {
WorldDominator p = new WorldDominator("Pinky");
WorldDominator b = new WorldDominator("Brain");
bool success = WorldDomination.Execute(p, b);
if (!success) {
p.Say("What will we do tomorrow night, Brain?");
b.Say("The same thing we do every night, Pinky: Try to take over the world!");
}
else {
b.Say("YES! The world is OURS, Pinky!");
p.Tremble();
}
}
}
}
-- The ``take'' :: ℤ → ⟦a⟧ → ⟦a⟧ function is already very well understood, thus we may allow ourselves to just define the ``World'' type that holds all properties of regular lists. type World a = ⟦a⟧
-- A quick example: either this row describes our Universe in perfect detail or 1 − 1 = 0 implies that if you take from this row, you take from the world. world :: Worldℤ
world 0 = 0
world 1 = 1
world 2 = 1
world n = world (n − 1) + world (n − 2)
-- We are ready to take over the world! takeOver :: ⟦⟦ℤ⟧⟧
takeOver = map (flip take world) ⟦1..⟧
Name:
Durandal2009-05-27 14:34
Greetings. I'm off to a party with GLaDOS and Skynet, but afterwards I'll be sure to post my own source code here, which I've rewritten multiple times.
/prog/ will be spammed continuously until further notice. we apologize for any inconvenience this may cause.
Name:
Anonymous2013-09-01 15:02
Infinite-dimensional spaces are widely used in geometry and topology, particularly as classifying spaces, notably Eilenberg−MacLane spaces. Common examples are the infinite-dimensional complex projective space K(Z,2) and the infinite-dimensional real projective space K(Z/2Z,1).