00:01:58 <zzo38> Sometimes a monad is described as an abstract datatype of actions, but I don't think that's what it is. At least, not in general; the IO monad is. But monads are a lot of things, though.
00:02:24 <olsner> CakeProphet: you mean... you were not using sed to encode your perl scripts?
00:02:25 <CakeProphet> zzo38: yes that description is just an analogy used to introduce the concept.
00:03:35 <olsner> CakeProphet: weird you
00:03:51 <CakeProphet> zzo38: I feel that >>= gives monads many similarities to continuations, in effect.
00:04:02 <zzo38> CakeProphet: Well, but I don't think it is a very good analogy, except possibly for describing a use of do-notation.
00:05:15 -!- Phantom_Hoover has quit (Quit: Leaving).
00:05:22 <olsner> I think the only correct description of monads as used in Haskell is the Monad type class
00:06:04 <zzo38> CakeProphet: I suppose there are some. But a monad can be defined without (>>=) (except that Haskell requires it), you can make up (>>=) from join and fmap.
00:06:11 <olsner> I think the laws are secondary to the understanding of monads
00:06:36 <olsner> I still don't know any of the laws (afaik) but think I have a pretty good idea how to use monads
00:06:48 <CakeProphet> but often, in teaching, it's not enough to simply "okay these are the formal properties and laws of x, now you are enlightened!"
00:07:14 <zzo38> There are different forms of the laws depending on which way you have defined the monad, if you follow the laws correctly in one form, it works in the other ways too.
00:07:24 <CakeProphet> not that the analogy of actions is perfect or particularly good, but does describe a particular problem that monads can be used for.
00:07:32 <elliott> olsner: the laws are really trivial
00:07:35 <zzo38> Such as you can have a Kleisli category, meaning that you can form a category.
00:07:44 <zzo38> CakeProphet: Yes, it does describe one use of monads.
00:07:57 <olsner> elliott: I don't doubt that, but I still don't know them :)
00:08:26 <elliott> "Left identity": return >=> g ≡ g
00:08:26 <elliott> "Right identity": f >=> return ≡ f
00:08:26 <elliott> "Associativity": (f >=> g) >=> h ≡ f >=> (g >=> h)
00:08:59 <elliott> "Left identity": return a >>= f ≡ f a
00:08:59 <elliott> "Right identity": m >>= return ≡ m
00:08:59 <elliott> "Associativity": (m >>= f) >>= g ≡ m >>= (\x -> f x >>= g)
00:09:10 <CakeProphet> yeah kleisli composition is a nice way to see them.
00:09:19 <CakeProphet> not that the lambda + bind form is confusing or anything.
00:10:06 <olsner> stop using analogies for monads, they are too simple to benefit from shady analogies
00:10:32 <olsner> ... or get stuck in the world of burritos and crepes
00:10:37 <elliott> olsner: wheres,e the analogies,
00:11:45 <olsner> elliott: I think they were before
00:12:02 <CakeProphet> monads are like magic boxes that you can transmute with alchemy, but you're ultimately bound by the rules of the specific box as well as the rules of all boxes.
00:12:13 <elliott> monads are like governments.............................
00:12:35 <olsner> monads are also like herp derp, and like python and rooby
00:12:58 <zzo38> Are you sure that return >=> g is a left identity, or is return <=< g is a left identity?
00:13:39 <zzo38> CakeProphet: Well, that is a *slightly* better analogy than the others, at least, in my opinion.
00:14:05 <zzo38> But it is still pretty bad.
00:14:06 <CakeProphet> zzo38: it's sufficiently vague and captures all of the main points... vaguely.
00:14:24 <zzo38> CakeProphet: Yes, that is why I said it is a slightly better than the others!
00:16:01 <CakeProphet> some boxes cheat and DEVOUR MATHEMATICIANS' SOULS TO CREATE EVIL SIDE-EFFECTS.
00:16:54 <CakeProphet> okay I think my analogy is breaking down here.
00:19:24 -!- augur has joined.
00:19:41 <CakeProphet> why they do this? I don't know. But it tastes good.
00:20:09 <zzo38> I looked at article about Kleisli category in Wikipedia, and I can make the same thing described there in Haskell.
00:20:13 <zzo38> Mathematics: $g\circ_T f = \mu_Z \circ Tg \circ f$
00:20:28 <CakeProphet> zzo38: you should make a programming language. call it Mathematics.
00:20:33 <zzo38> Haskell: g <=< f = join . fmap g . f
00:21:08 <zzo38> See? It is the same thing.
00:25:51 -!- DH____ has joined.
00:28:10 -!- Vorpal has quit (Ping timeout: 240 seconds).
00:28:31 -!- derdon has quit (Remote host closed the connection).
00:30:27 -!- augur has quit (Remote host closed the connection).
00:31:14 <CakeProphet> /media/Elements/googledata$ cat googlebooks-eng-all-1gram-20090715-*.csv | grep -P "^.*'s\t" | wc -l
00:33:42 <elliott> Merging In The GNU D Language Compiler To GCC (phoronix.com)
00:34:10 <monqy> is d bad i've never payed any attention at all to d
00:35:16 <monqy> what I know: it exists, it is a programming language, one time I wanted to compile something made in D and I couldn't do it because of reasons I am forgetting, ??????
00:36:07 <elliott> Oh no, I think have a Concurrency Issue.
00:40:12 <CakeProphet> elliott: quick use message passing or STM.
00:40:25 <elliott> Message passing is a joke.
00:41:22 <CakeProphet> not necessarily on increasing uh, concurrency.
00:45:02 -!- DH____ has quit (Read error: Connection reset by peer).
00:47:19 -!- copumpkin has joined.
00:48:18 <zzo38> Is the successor monad similar to the maybe monad?
00:49:18 <zzo38> What does "Security System Breached" mean?
00:50:13 <zzo38> When trying to send a message I get the error message ":pratchett.freenode.net 301 zzo38 ski :Security System Breached"
00:51:19 <elliott> zzo38: 301 is an away message.
00:51:20 <lambdabot> http://www.utica.edu/academic/institutes/cimip/mediacenter/itnews.cfm
00:52:36 -!- hoppecl has quit (Quit: BitchX-1.1-final -- just do it.).
01:01:04 -!- augur has joined.
01:02:02 -!- augur has quit (Remote host closed the connection).
01:08:00 <elliott> Who gets to debug my possible concurrency issue???? WHO IS THE LUCKY WINNER
01:09:25 <pikhq_> monqy: D is not a *terrible* language, but it has serious issues in the toolchain.
01:09:36 <elliott> It's pikhq_! pikhq_ is the lucky winner!
01:09:54 <elliott> (entityID:xs, m) <- readTVar (serverPlayers st)
01:09:54 <elliott> writeTVar (serverPlayers st) (xs, HM.insert entityID player m)
01:10:00 <elliott> serverPlayers :: ServerState -> TVar ([EntityID], HashMap EntityID Player)
01:10:11 <elliott> Is there a race condition here with other threads accessing the players???? :|
01:10:27 <elliott> I think as long as everything is done through addPlayer and a hypothetical delPlayer it's fine
01:10:39 <elliott> (Where delPlayer adds the entity ID back on to the head of the list and removes from the map)
01:11:06 <pikhq_> Everything should be fine with STM.
01:11:23 <pikhq_> How can you race when your only actions are atomic transactions?
01:13:53 <pikhq_> Anyways: you're not going to see any races with mutations in STM.
01:16:16 <pikhq_> monqy: I don't know if this is still the case, but it at least *used* to be that D had two incompatible standard libraries.
01:16:28 <pikhq_> monqy: It was actually impossible to have them both installed on the same system.
01:16:51 <pikhq_> And both were equally commonly used.
01:16:56 <CakeProphet> utf8 "\xEA" does not map to Unicode at ./construct_grams.pl line 16, <$f> line 3
01:17:32 <elliott> Or maybe you're just doing it wrong
01:24:45 -!- augur has joined.
01:27:10 -!- copumpkin has quit (Remote host closed the connection).
01:29:38 <CakeProphet> without it, it just treats bytes in the range 128-255 (I think) as just byte values
01:30:20 <CakeProphet> so I'm pretty sure I just need to get 5.14, or ignore the warning and see if it doesn't matter...
01:30:42 <CakeProphet> since the only thing I'm really doing that's unicode related is testing to see if they're numeric.
01:31:04 <elliott> You're implying that no Perl version before 5.14 supports Unicode at all.
01:31:14 <elliott> Maybe you should read the SO question some more.
01:31:24 <elliott> I'll let Deewiant handle this one
01:32:07 <CakeProphet> actually 5.12 is minimum for unicode strings.
01:32:34 <CakeProphet> so, yes... I'm saying complete Unicode support doesn't exist until either 5.12 or 5.14
01:32:51 <CakeProphet> but other Unicode things have been around before that.
01:33:17 <elliott> You are really obviously wrong.
01:33:48 <elliott> <CakeProphet> so, yes... I'm saying complete Unicode support doesn't exist until either 5.12 or 5.14
01:33:48 <elliott> <CakeProphet> but other Unicode things have been around before that.
01:33:56 <elliott> Which you are using to justify
01:33:59 <elliott> "I can't do this without a newer Perl"
01:34:11 <CakeProphet> I'm not /certain/ I can do it with this Perl.
01:34:22 <elliott> "I see lots of room for improvement in the cited utf8::all module. It was written before the unicode_strings feature, which Fɪɴᴀʟʟʏ ᴀɴᴅ ᴀᴛ Lᴏɴɢ Lᴀsᴛ fixes regexes to have a /u on them."
01:34:26 <elliott> So let's go over to perlre
01:34:40 <elliott> These modifiers, new in 5.14, affect which character-set semantics (Unicode, ASCII, etc.) are used, as described below in Character set modifiers.
01:34:49 <elliott> http://perldoc.perl.org/perlre.html#Character-set-modifiers
01:34:58 <elliott> So all unicode_strings gets you in the area of regexps is things like \w changing
01:35:05 <elliott> Which is irrelevant if you don't use things like \w
01:35:47 <CakeProphet> Code points between 128–255 should be understood by 🐪 to be the corresponding Unicode code points, not just unpropertied binary values. use feature "unicode_strings" or export PERL5OPTS=-Mfeature=unicode_strings. That will make uc("\xDF") eq "SS" and "\xE9" =~ /\w/. A simple export PERL5OPTS=-Mv5.12 or better will also get that.
01:35:59 <CakeProphet> but it is still irrelevant, you're correct.
01:36:08 -!- TeruFSX has joined.
01:37:47 <CakeProphet> elliott: really I think I fixed my initial problem when I did use open qw( :encoding(UTF-8) :std );
01:40:38 <zzo38> You should either copy the TeX form I have in my website and/or make a program that takes a <TeX> in MediaWiki and automatically uploads an image with a name corresponding to what is typed in so that the results can be cached (if you need to invalidate the cache, you can delete that file)
01:45:06 -!- CakeProphet has quit (Ping timeout: 256 seconds).
01:47:37 <Gregor> <elliott> Merging In The GNU D Language Compiler To GCC (phoronix.com) // huh?
01:47:51 <elliott> Gregor: Apparently Digital Mars are trying to get gdc into gcc :P
01:48:09 <Gregor> Last I knew, Digital Mars doesn't give one flying fuck about gdc.
01:48:29 <elliott> http://www.phoronix.com/scan.php?page=news_item&px=OTk2NA
01:49:05 <Gregor> Hm. I last new out-of-date is more like it :P
01:49:27 <Gregor> In an ideal world, a canonical gdc could improve the state of D.
01:49:37 <Gregor> Mainly by massively overpowering all non-GCC competition.
01:49:41 <Gregor> In an ideal world, anyway.
01:55:18 <pikhq_> Digital Mars' involvement would be necessary for a GDC merge, since the FSF has copyright assignment policies. So. :)
01:56:30 <elliott> localhost:45260 > SetSlot (WindowID (-1)) (-1) Nothing
01:56:30 <elliott> localhost:45260 > PlayerPositionLook (PlayerPos (Point 0.0 64.0 0.0) 71.62) (Direction 0.0 0.0) True
01:56:30 <elliott> localhost:45260 < PlayerPositionLook (PlayerPos (Point 8.5 65.0 8.5) 66.62000000476837) (Direction (-180.0) 0.0) False
01:56:30 <elliott> localhost:45260 < PlayerPosition (PlayerPos (Point 8.5 64.92159999847412 8.5) 66.5416000032425) False
01:56:30 <elliott> localhost:45260 < PlayerPosition (PlayerPos (Point 8.5 64.76636799395752 8.5) 66.386367l9o9c8a7l2h5o8s9t): 4F5a2l6s0e
01:56:33 <lambdabot> Not in scope: data constructor `KeepAlive'
01:56:34 <elliott> localhost:45260 < PlayerPositionLook (PlayerPos (Point 0.0 69.99999999523163 0.0) 71.62) (Direction 0.0 0.0) True
01:56:37 <elliott> localhost:45260 < KeepAlive 0
01:56:39 <elliott> localhost:45260 < PlayerPositionLook (PlayerPos (Point 0.0 69.99999999523163 0.0) 71.62) (Direction 0.0 0.0) False
01:56:42 <elliott> Gregor: Lightweight threads give the absolute best IO.
01:56:44 <elliott> Especially when your line-based IO is based on iteration of character-based IO.
01:56:54 <elliott> It is a fact and everyone will agree on that now.
02:05:54 <zzo38> Is a successor monad similar to a maybe monad?
02:08:31 <zzo38> http://ncatlab.org/nlab/show/successor+monad
02:24:18 -!- MDude has changed nick to MSleep.
02:26:27 -!- augur has quit (Remote host closed the connection).
02:35:44 -!- CakeProphet has joined.
02:35:45 -!- CakeProphet has quit (Changing host).
02:35:45 -!- CakeProphet has joined.
02:36:20 -!- oerjan has joined.
02:47:10 <oerjan> <CakeProphet> some boxes cheat and DEVOUR MATHEMATICIANS' SOULS TO CREATE EVIL SIDE-EFFECTS. <-- i see you are keeping strictly on topic
02:48:53 <zzo38> oerjan: Good thing you are now on because I wanted to ask a question to you. You linked to Astrolog program from agora-horoscope but that link no longer works (it is a 404 and redirect).
02:49:40 <oerjan> well i don't think i have a copy
02:49:49 <zzo38> That is OK, it doesn't matter.
02:50:40 -!- GreaseMonkey has joined.
02:51:12 <zzo38> I noticed they have Sun, Moon, Mercury, Venus, Mars, etc, but no Earth. Is that because the horoscopes are calculated relative to the Earth? If so, is it possible to calculate relative to something else?
02:51:55 <zzo38> (Earth is listed underneath, but that seems to have to do with the classical elements.)
02:52:58 <oerjan> zzo38: i have wondered that too, horoscopes seem very earth centered. your exact position on earth is a parameter, and the houses are really i think incorporating earth information
02:53:31 <oerjan> so i've wondered what astrologers are going to do when the first people get born outside earth orbit :P
02:55:34 <oerjan> zzo38: oh, it's www.astrolog.org now
02:55:49 <zzo38> In my opinion, they don't need to do anything; but if they want to do something, they should probably use mathematics of astronomy to determine how to calculate it; that is, if they want to calculate it at all! (What astrologers do doesn't help anyways, so why would you do something about it, unless you wanted accurate scientific calculations? Maybe some astrologers do want it more than others)
02:57:31 <oerjan> one would assume astrologers believe they are actually doing something meaningful
02:57:54 <oerjan> and that it would be important to make such horoscopes, when the time arises
03:00:59 <elliott> Wow, oerjan's horoscope is still linked from agoranomic.org.
03:01:32 <zzo38> Well, if you do want to make such horoscopes, it would seem, they should correct it based on astronomical calculations, I suppose. If you are on different planet, with different length of years, do you consider that too? I don't know! (I don't think astrologers need to decide; but probably they think they need to.)
03:01:44 <zzo38> However, in my opinion, a computer program that does horoscopes ought to have these features.
03:02:07 <oerjan> zzo38: i don't think year lengths are a problem, that's just the position of the sun
03:02:32 <zzo38> oerjan: O, yes, you are correct. It is the relative position of the sun.
03:02:41 <zzo38> It is the same thing.
03:03:50 <oerjan> more serious would be the placement of the spring equinox, since that determines the start of the zodiac.
03:04:35 <zzo38> oerjan: OK. Yes, I suppose so. I don't know a lot about the zodiac.
03:04:38 <oerjan> does every planet even have one? mercury and venus have days synchronized with the year
03:05:22 <oerjan> and uranus rotates nearly 90 degrees off
03:06:58 <oerjan> ooh and the moon of course always points the same face at earth, so earth would have a fixed position
03:07:10 <oerjan> no wait, the zodiac would move
03:07:35 <oerjan> (if doing a horoscope relative to the moon)
03:25:42 -!- tiffany has joined.
03:26:27 -!- centrinia has quit (Quit: Leaving).
03:27:17 -!- Viator has joined.
03:27:41 <oerjan> esoforum completely overrun with spam again
03:27:58 <HackEgo> Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page
03:28:19 <HackEgo> elliott wrote this learn DB, and wrote or improved many of the other commands in this bot. He probably has done other things?
03:28:30 <HackEgo> Your future evil overlord oerjan is an expert in lazy computation.
03:29:12 <oerjan> and i'm not joking on the lazy part.
03:29:37 <Viator> hehe, isn't c++ esoteric enough? ;)
03:29:59 <oerjan> it's ok, as long as you only program in the template system.
03:30:26 <Viator> yeah, right, and use only words from alice in wonderland
03:30:38 <fungot> Selected style: alice (Books by Lewis Carroll)
03:30:47 <oerjan> fungot: That's a good thing, right?
03:30:48 <fungot> oerjan: this fnord the poor.' why, that's been changed into ' shall be absolute governor for life, with the words " and the moral of that fnord' and walked in. in another place, fnord,
03:31:10 <oerjan> fungot: i am not convinced the word "fnord" occurs in lewis carroll's works.
03:31:11 <fungot> oerjan: he served out some fnord with a sense of his guilt, you ought to fnord, but did not attempt to pronounce the sentence with your lips quite close to the little glass table. taking the little golden key, she unlocked the door that led into the garden with one fnord only one i can think of fnord.
03:31:34 <Viator> Down, down, down her own ears for having no think you could see it pop down the flame of get out of the little door into the use with pink eyes ran across the fall dark hall, which way.
03:32:29 <Viator> anyway, thought this chat was about another type of esotericism. cya
03:32:34 <zzo38> oerjan: I think yesterday I and you was discussing categories from graphs. I also have a similar idea for categories from digraphs, where you have a digraph and a cancellation specification to make up a category. What are these called?
03:32:44 -!- Viator has quit (Quit: Among the lucky, you are the chosen one.).
03:33:02 <oerjan> aww, i wanted to tell him we were just discussing astrology :(
03:34:05 <oerjan> zzo38: well that's just a special case isn't it?
03:34:11 <CakeProphet> hmmm, so... apparently perl subroutines are not continuations?
03:34:35 <zzo38> Yes we were, but we have discussed it from a somewhat more scientific point of view than I would guess that astrologers probably usually do
03:35:34 <zzo38> oerjan: I mean both things; there is one for graphs and one for digraphs. Although I do suppose you can make a digraph that has a reverse for each line and make that the cancelation rule.
03:35:38 -!- Viator has joined.
03:35:44 <CakeProphet> my %datasets; my $help_mode; sub dataset_handler($) { $datasets{shift} = 1; }
03:35:50 <CakeProphet> this doesn't work correctly, according to warnings.
03:36:08 <zzo38> What I mean, is what are these methods to make a category from graphs and/or digraph, called?
03:36:09 <oerjan> zzo38: i mean isn't the digraph one just a special case of the general graph one?
03:36:15 -!- Viator has quit (Client Quit).
03:36:59 <zzo38> oerjan: Not as far as I know; it seems different to me.
03:37:07 <CakeProphet> hmmm, maybe if I use a reference instead....
03:37:38 <oerjan> zzo38: oh. please explain how the digraph one works
03:38:49 <zzo38> oerjan: OK. You have a digraph, and a cancellation specification (which might be empty). You can walk only in the direction that the arrows on the digraph go, and the morphisms are those walks.
03:40:02 <CakeProphet> oh okay apparently anonymous subs are closures.
03:40:05 <oerjan> well the category of the walks of a directed graph in general is a well known concept, i thinkg
03:41:46 <zzo38> Well, OK. But what if you add a cancellation specification?
03:41:51 -!- GreaseMonkey has quit (Quit: The Other Game).
03:43:02 <oerjan> i cannot seem to recall anything in particular
03:45:25 -!- GreaseMonkey has joined.
03:47:12 <oerjan> zzo38: if you have complicated enough cancellation specifications, it seems like you could get a result that was equivalent to any (finite) category
03:48:00 <oerjan> well if cancellation means "declaring a walk to be equal to the empty walk"
03:48:55 <oerjan> and it then becomes somewhat analogous to defining a particular monoid or group by generators and equations
03:50:33 <oerjan> http://en.wikipedia.org/wiki/Presentation_of_a_monoid
03:50:42 <zzo38> Yes that is what I mean. One example is making any graph into a digraph such that each edge on the graph corresponds to both directions on the digraph, where these directions are defined as cancelling each other.
03:51:43 <oerjan> in a sense a category is just a monoid where some compositions are undefined
03:51:53 -!- augur has joined.
03:56:40 <elliott> pikhq_: Gregor: I think you guys might enjoy this quiz: http://ridiculousfish.com/blog/posts/will-it-optimize.html
04:01:33 <zzo38> When trying to run the Daedalus program (from the same person that made Astrolog), I get the error "The system cannot execute the specified program." but I tried looking in the dependency walker and cannot find anything wrong in there
04:09:09 <zzo38> Does a balanced Eulerian tournament digraph able to make Rock-Paper-Scissors including their variations with more than three throws?
04:15:53 <zzo38> Can you understand what I meant?
04:17:14 <oerjan> although the top google hit for "balanced eulerian tournament" says "A connected bi-directed graph is Eulerian if and only if every vertex is balanced."
04:17:40 <zzo38> I was using stuff from the Wikipedia articles relating to graph theory
04:18:32 <oerjan> well i know eulerian, digraph, and rock-paper-scissors
04:18:51 <oerjan> and i can imagine making a digraph telling who wins in RPS
04:19:18 <oerjan> i don't know what a "throw" is
04:19:45 <zzo38> The throws in RPS are the Rock, Paper, Scissors, are sometimes called the "throws".
04:20:15 <oerjan> i recall once trying to list some such variations that were "minimal" in a sense
04:21:21 <oerjan> i'd imagine you'd want it to be symmetrical between players
04:21:45 <Madoka-Kaname> I'm tempted to make an obfuscated RPS program now...
04:21:57 <oerjan> and iirc by "minimal" i think i meant that there was no "throw" as you call it which a player could ignore
04:22:55 <zzo38> The standard three-throw system is sufficient for two players, and my brother agrees with that, so does the World RPS society. Not everyone agrees.
04:22:56 <oerjan> as in, no throw that could be excluded from an optimal mixed strategy
04:23:14 <zzo38> (And, in fact, makes the best game for two players, too.)
04:24:33 <zzo38> But you can make the game with any odd number of throws at least three. I have thought of a way to make the number of throws infinite, although it does not seem the game can be played in this case.
04:24:43 <oerjan> Madoka-Kaname: rps esolang. get on it. :P
04:25:01 <zzo38> However the infinite throws game is still provably balanced.
04:25:51 <oerjan> what's the definition of "balanced" here?
04:26:51 <zzo38> I mean that if all throws are equally likely, each throw is as likely to win as it is likely to lose against the opponent with equally likely throws all of them.
04:27:01 <zzo38> And each throw still only stalemates against itself.
04:31:40 <zzo38> I think what I had, is that the throws are the integers, and the higher or lower number wins depending whether the difference is odd or even.
04:34:55 <oerjan> well, when you have a countably infinite number of throws, standard probability theory has no concept of them being "equally likely"
04:35:15 <oerjan> because they would each have to have probability 0, and that sums to 0
04:35:20 -!- tiffany has quit (Quit: Bye).
04:35:33 <oerjan> and standard probability theory assumes countable additivity
04:42:59 <zzo38> O, so that is how it works.
04:49:37 -!- MSleep has quit (Read error: Connection reset by peer).
04:49:57 -!- MSleep has joined.
05:13:00 <Patashu> oerjan: in such a system, is there any reason to pick a non 0, 1, 2?
05:13:45 <oerjan> you mean in zzo38's infinite system?
05:16:53 <oerjan> well if you do that you'll have to pick 1 with 50% probability or else the opponent wins on average by choosing 3
05:19:14 <Patashu> okay yeah, I see. if you pick from 0 to n, if n is odd the opponent just picks from within your set and wins more than it loses, while if n is even the opponent picks from outside your set and wins more than it loses
05:19:17 <Patashu> so you have to pick everything
05:19:35 <oerjan> but if you do that, any number other than 0,1,2 will win 50% guaranteed
05:25:12 <oerjan> if you then choose 0 less than 50% of the time, the opponent can win on average by choosing 2
05:26:02 <oerjan> so you must choose 0 50% and 1 50%. but then the opponent wins on average with 1.
05:26:19 <Patashu> yup, that's the sequence of logic I followed
05:26:47 <oerjan> i forgot the possibility of 1 less than 50%
05:27:02 <Patashu> if 1 less than 50%, opponent choses 2 or 3
05:27:10 -!- monqy has quit (Quit: hello).
05:27:11 <Patashu> countering the one you pick more
05:27:17 <oerjan> argh i mean more than 50%
05:27:46 <oerjan> but he can choose -1, iiu zzo38 correctly
05:28:07 <zzo38> Yes, I include all integers, positive and negative and zero
05:28:16 <oerjan> well, not necessary, since 2 or 3 will work as you say
05:31:13 <oerjan> ah. i think this generalizes to show you must use infinitely many possibilities.
05:32:45 <oerjan> otherwise: first, you must choose evens as often as odds or the opponent wins by choosing something larger at the right distance, secondly, you cannot choose your largest number at all or the opponent wins by also choosing it.
05:33:50 <oerjan> (the second part depends on having proved the first part)
05:34:59 <oerjan> intuitively though, i think you still have an optimal strategy if you say choose negative numbers evenly
05:35:08 <oerjan> and never positive ones
05:35:24 <oerjan> s/evenly/with "equal probability"/
05:43:16 -!- Zuu has quit (Ping timeout: 244 seconds).
05:50:03 <zzo38> I got Daedalus to run now. It has over 400 options and many examples. It is generally for making mazes, but it does other things too, such as drawing a picture of castles, Escher rooms, and more. It does many kind of mazes, including 2D, 3D, 4D, and 5D.
05:50:35 -!- Zuu has joined.
05:50:40 <Patashu> I have daedalus on my computer
05:50:56 <Patashu> I'm not particularly sure what to -do- with it, though. Running mazes is only entertaining for so long
05:51:07 <elliott> http://www.astrolog.org/labyrnth/daedalus.htm oh this looks neat
05:51:13 <elliott> i was thinking it'd be some astrology crap
05:51:34 <zzo38> elliott: No, Astrolog is astrology program. Daedalus does mazes.
05:51:36 <elliott> http://www.astrolog.org/labyrnth/daedalus/mandy.jpg FSVO mandelbrot set
05:53:54 <Patashu> http://www.astrolog.org/labyrnth/algrithm.htm look at all this everything
05:54:45 <Patashu> everything about mazes you never wanted to know
05:54:53 <zzo38> Astrolog also has a lot of options. You can, in fact, change which planet ("planet" in the astrological sense) you are computing relative to, and it does not only horoscopes but also calendars, local horizon, solar system orbits, rising and setting, you can change the zodiac degree offset, you can change the symbols of planets to the ones commonly used in astronomy, and more.
05:57:06 <elliott> Patashu: dude really likes mazes I guess
05:57:38 <Patashu> it even has a castle simulator! http://www.astrolog.org/labyrnth/daedalus/castle.jpg
05:57:41 <Patashu> it's the next dorf fortress
05:57:41 <elliott> "UFO ship images: I believe Earth is not alone in the universe and we are regularly visited by beings from other worlds. I also believe these beings (including the ones known as Zeta Reticulans or Greys) are friendly and here to assist our planet through its collective adolescence. One of the most common visitors are the Pleiadians. The next time one of their beamships lands in your backyard, don't jus
05:57:41 <elliott> t stare at it wonderingly, but use this UFO ship file I put together to identify it, and start up an intelligent conversation with them. :-)"
05:58:21 <Patashu> I swear I ran this maze once and I've never been to america http://www.astrolog.org/labyrnth/daedalus/glacier.jpg o.O
05:58:26 <elliott> "Good vs. evil extraterrestrials: Philosophical insights into the concept of "good" and "evil" extraterrestrials, warfare between solar systems, and whether Earth is at any risk of being invaded or whatever. Transcribed from a channeling of Bashar."
05:58:33 <elliott> Patashu: wait you are not from the US?
05:58:50 <Patashu> Gigamazes: The largest Mazes ever created! Try to solve a Maze measuring a billion passages by a billion passages.
05:59:10 <elliott> "Pentagram: I created and posted this image of a pentagram to alt.pagan a number of years ago. The pentagram is a pagan symbol which to me at least represents the higher mind (top point) achieving mastery of the four elements (other points) through spiritual growth."
05:59:15 <elliott> guy created a pentagram once, life achievement
05:59:24 <Patashu> c'mon, don't leave us hanging
05:59:29 <elliott> http://www.astrolog.org/home/pic/pentagrm.gif
06:00:02 <Patashu> 'I was not swept off my feet, but I enjoyed the experience' - The New York Times
06:00:17 <Patashu> http://www.astrolog.org/labyrnth/daedalus/pacman.jpg lol
06:00:41 <elliott> is this actually a maze program
06:00:44 <elliott> it seems to be twenty programs
06:01:04 <elliott> http://www.astrolog.org/labyrnth/daedalus/maze5d.jpg help
06:01:10 <elliott> it does not look like maze :'(
06:01:30 <elliott> elliott@katia:~/Downloads$ wget http://www.astrolog.org/labyrnth/daedalus/dae23zip.exe
06:01:59 <elliott> anyone who isn't playing along at home and installing daedalus: we're no longer friends, sorry
06:02:16 <zzo38> I have installed Daedalus.
06:02:28 <elliott> The following NEW packages will be installed:
06:02:28 <elliott> binfmt-support fonts-horai-umefont gcc-4.6-base:i386 gnome-exe-thumbnailer
06:02:28 <elliott> ia32-libs ia32-libs-multiarch:i386 icoutils imagemagick lib32asound2
06:02:28 <elliott> lib32bz2-1.0 lib32ffi6 lib32gcc1 lib32ncurses5 lib32ncursesw5 lib32nss-mdns
06:02:28 <elliott> lib32stdc++6 lib32tinfo5 lib32z1 libacl1:i386 libattr1:i386 libaudio2:i386
06:02:29 <elliott> libavahi-client3:i386 libavahi-common-data:i386 libavahi-common3:i386
06:02:30 <elliott> libc6:i386 libc6-i386 libcdt4 libcomerr2:i386 libcups2:i386
06:02:32 <elliott> libcupsimage2:i386 libcurl3:i386 libdb5.1:i386 libdbus-1-3:i386 libdrm2:i386
06:02:35 <elliott> libexpat1:i386 libffi6:i386 libfontconfig1:i386 libfreetype6:i386
06:02:37 <elliott> libgcc1:i386 libgcrypt11:i386 libgdbm3:i386 libgl1-mesa-glx:i386
06:02:38 <elliott> libglapi-mesa:i386 libglib2.0-0:i386 libgnutls26:i386 libgpg-error0:i386
06:02:40 <elliott> libgraph4 libgssapi-krb5-2:i386 libgvc5 libice6:i386 libidn11:i386
06:02:42 <elliott> libjpeg62:i386 libk5crypto3:i386 libkeyutils1:i386 libkrb5-3:i386
06:02:45 <elliott> libkrb5support0:i386 liblcms1:i386 libldap-2.4-2:i386 liblqr-1-0
06:02:47 <elliott> libmagickcore3 libmagickcore3-extra libmagickwand3 libmng1:i386 libnetpbm10
06:02:48 <elliott> libnspr4:i386 libnss3:i386 libpathplan4 libpcre3:i386 libpng12-0:i386
06:02:51 <elliott> libqt4-dbus:i386 libqt4-declarative:i386 libqt4-designer:i386
06:02:52 <elliott> libqt4-network:i386 libqt4-opengl:i386 libqt4-qt3support:i386
06:02:54 <elliott> libqt4-script:i386 libqt4-scripttools:i386 libqt4-sql:i386 libqt4-svg:i386
06:02:56 <elliott> libqt4-test:i386 libqt4-xml:i386 libqt4-xmlpatterns:i386 libqtcore4:i386
06:02:58 <elliott> libqtgui4:i386 librtmp0:i386 libsasl2-2:i386 libsasl2-modules:i386
06:03:00 <elliott> libselinux1:i386 libsm6:i386 libsqlite3-0:i386 libssl1.0.0:i386
06:03:02 <elliott> libstdc++6:i386 libtasn1-3:i386 libtiff4:i386 libuuid1:i386 libx11-6:i386
06:03:04 <elliott> libxau6:i386 libxcb1:i386 libxdamage1:i386 libxdmcp6:i386 libxext6:i386
06:03:06 <elliott> libxfixes3:i386 libxi6:i386 libxrender1:i386 libxss1:i386 libxt6:i386
06:03:08 <elliott> libxxf86vm1:i386 netpbm qdbus:i386 winbind wine wine1.3 wine1.3-gecko
06:03:12 <elliott> dear apt-get: what did I do, I'm so sorry; love, elliott
06:03:16 <elliott> that's longer than i expected
06:04:24 <elliott> Patashu: so how much effort is it to use all the upside down unicode characters so that everyone else can read your messages
06:04:27 <elliott> do you have a script to do it :D
06:05:06 <elliott> yes it is two thousand and eleven anno domini and upside down australia jokes are funny and topical
06:05:48 <Patashu> http://www.astrolog.org/labyrnth/maze/symmetry.gif this makes me think of memes
06:06:30 <elliott> god i could stare at that forever
06:06:34 <elliott> until my eyes start leaking blood
06:07:06 <elliott> Failed to fetch http://gb.archive.ubuntu.com/ubuntu/pool/main/g/glib2.0/libglib2.0-dev_2.30.0-0ubuntu3_amd64.deb 404 Not Found
06:07:06 <elliott> Failed to fetch http://gb.archive.ubuntu.com/ubuntu/pool/main/g/glib2.0/libglib2.0-bin_2.30.0-0ubuntu3_amd64.deb 404 Not Found
06:07:06 <elliott> Failed to fetch http://gb.archive.ubuntu.com/ubuntu/pool/main/g/glib2.0/libglib2.0-0_2.30.0-0ubuntu3_amd64.deb 404 Not Found
06:07:06 <elliott> Failed to fetch http://gb.archive.ubuntu.com/ubuntu/pool/main/g/glib2.0/libglib2.0-0_2.30.0-0ubuntu3_i386.deb 404 Not Found
06:07:09 <elliott> E: Unable to fetch some archives, maybe run apt-get update or try with --fix-missing?
06:08:49 <elliott> 83% [11 libllvm2.9 2,496 kB/6,560 kB 38%] 858 kB/s 8s
06:08:52 <elliott> wine depends on that??????
06:08:55 <elliott> new world, new lifestyle, new changes,
06:09:27 <Patashu> Template: Mazes based on templates are done by simply starting with the base template image, then running the isolation remover to ensure the Maze has a solution, followed by the loop remover to ensure the Maze is hard enough, resulting in a perfect Maze that still looks very similar to the original image. For example, to create a Maze composed of interlocking spirals, just create some random
06:09:28 <Patashu> spirals without worrying whether it's a Maze or not, then run it through the isolation and loop removers.
06:10:14 <elliott> oh wow the daedalus setup program is awkward
06:10:20 <elliott> Patashu: i hope you're doing this too :'(
06:11:35 <elliott> Patashu: it can run GoL on a maze
06:11:48 <zzo38> Yes, it does have a lot of options.
06:12:00 <elliott> draw → life generate, it has a shortcut, Alt+L
06:12:02 <elliott> definitely needs a shortcut
06:12:29 <elliott> some of these are really cool install this program now you will love it
06:12:54 <zzo38> Almost everything in that program has a shortcut. Remember that if the letters are uppercase you need to use shift.
06:43:42 <HackEgo> 151) * Phantom_Hoover wonders where the size of the compiled Linux kernel comes from. <cpressey> To comply with the GFDL, there's a copy of Wikipedia in there.
06:43:55 -!- CakeProphet has quit (Ping timeout: 252 seconds).
06:52:59 -!- aloril has quit (Ping timeout: 240 seconds).
07:09:21 -!- aloril has joined.
07:14:06 -!- pikhq has joined.
07:14:12 -!- pikhq_ has quit (Ping timeout: 258 seconds).
07:15:22 -!- hagb4rd has joined.
07:21:44 -!- Ngevd has joined.
07:23:15 <oerjan> @vixen Are the rumors of your death exaggerated?
07:23:15 <lambdabot> A public man must never forget that he loses his usefulness when he as an individual, rather than his policy, becomes the issue.
07:45:43 <oerjan> @vixen I have this tape recorder...
07:45:43 <lambdabot> The second point is that coming out--coming back and saying that black Americans aren't as good as black Africans--most of them , basically, are just out of the trees. Now, let's face it, they are.
07:49:27 -!- nooga has joined.
07:57:35 <zzo38> The sunrise and sunset listed in Astrolog are a few minutes difference from those in other programs. Is it because astrology uses different rise/sets? Is it because I entered an incorrect input?
08:00:47 <pikhq> Knowing what I do know about astrology, I'd be willing to bet it's using a rather ridiculous means of calculating sunrise and sunset.
08:05:11 <zzo38> Changing the zodiac degree offset to -3.6 appears to give give the same answers as other sources.
08:07:44 -!- CakeProphet has joined.
08:08:11 <zzo38> Wikipedia says to use 24 degrees.
08:08:22 -!- CakeProp1et has joined.
08:09:17 <zzo38> But 24 doesn't work, it only works with -3.6
08:10:36 -!- CakeProp1et has quit (Client Quit).
08:12:39 <zzo38> The setting is labeled "Zodiac Degree Offset / Ayanamsa" and Wikipedia has an article about Ayanamsa.
08:19:06 -!- oerjan has quit (Quit: Later).
08:22:48 <Ngevd> Obfuscated Haskell! \n -> sum (read ((++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]") :: [Int])
08:24:43 <lambdabot> forall a. (a -> Bool) -> [a] -> Bool
08:25:50 <elliott> f n = sum (read xs :: [Int])
08:25:50 <elliott> where xs = init ('[' : concat (map (:",") $ filter (flip any ['0'..'9'] . (==)) $ show n)) ++ "]"
08:25:58 <elliott> It's not that bad. Although the algorithm looks stupid.
08:26:45 <Ngevd> pl'ing it doesn't work
08:26:53 <elliott> ?pl \n -> sum (read ((++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]") :: [Int])
08:26:53 <lambdabot> sum . (:: [Int]) . read . (++ "]") . init . ('[' :) . join . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show
08:27:00 <elliott> Well, it fucks up the type signature.
08:27:13 <elliott> ?pl \n -> sum (FFFF (read ((++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]")))
08:27:13 <lambdabot> sum . FFFF . read . (++ "]") . init . ('[' :) . join . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show
08:27:32 <elliott> ?pl (++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]"))
08:27:32 <lambdabot> expecting variable, "(", operator or end of input
08:27:34 <elliott> ?pl (++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]")
08:27:36 <lambdabot> expecting variable, "(", operator or end of input
08:27:38 <elliott> ?pl (++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]"
08:27:38 <lambdabot> init ('[' : ((: ",") =<< filter (flip any ['0'..'9'] . (==)) (show n))) ++ "]"
08:27:57 <elliott> ?pl \n -> (++) (init ('[':concat (map (:",") (filter (flip any ['0'..'9'] . (==)) (show n))))) "]"
08:27:57 <lambdabot> (++ "]") . init . ('[' :) . join . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show
08:28:19 <elliott> > let readSpecial :: String -> [Int]; readSpecial = read in sum . readSpecial . (++ "]") . init . ('[' :) . join . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show
08:28:20 <lambdabot> Overlapping instances for GHC.Show.Show (a -> GHC.Types.Int)
08:28:22 <elliott> :t let readSpecial :: String -> [Int]; readSpecial = read in sum . readSpecial . (++ "]") . init . ('[' :) . join . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show
08:28:44 <elliott> :t let readSpecial :: String -> [Int]; readSpecial = read in sum . readSpecial . (++ "]") . init . ('[' :) . concat . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show
08:28:54 <elliott> Ngevd: What is it even meant to do?
08:33:45 <Ngevd> By converting them into a string, converting that string into a list of digits, then finding the sum of that
08:34:41 <Ngevd> The craziest bit is probably converting the string to the list
08:35:14 <Ngevd> It involves inserting ',' after each character
08:35:23 <Ngevd> Then putting a '[' on the front
08:36:08 <Ngevd> Then taking a ',' off the end
08:36:14 <Ngevd> then putting a ']' on the end
08:36:21 <Ngevd> then reading it as a [Int]
08:36:27 <Ngevd> Probably a number of easier ways
08:36:40 <zzo38> O, I think I have figured out why entering 24 doesn't work. The documentation says to enter 0 for Fagan Bradley; Wikipedia says "Western Astrologers Fagan and Bradley computed it at 24 degrees in 1950"
08:42:52 <elliott> Ngevd: You realise that String == [Char]?
08:44:05 <elliott> I can't actually figure out what the hell you do there, so :P
08:44:11 <elliott> > ((++ "]") . init . ('[' :) . concat . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show) 9090909999
08:44:13 <Ngevd> It was designed to echo my thought process
08:44:16 <elliott> > ((++ "]") . init . ('[' :) . concat . map (: ",") . filter (flip any ['0'..'9'] . (==)) . show) "texas99aaxasbsa"
08:44:31 <elliott> Ngevd: I'm not exactly why you want show here at all
08:45:42 <elliott> > let digits n = let (x,n') = divMod n 10 in x : digits n' in digits 9099
08:45:42 <lambdabot> [909,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,...
08:45:48 <elliott> > let digits 0 = []; digits n = let (x,n') = divMod n 10 in x : digits n' in digits 9099
08:45:49 <lambdabot> [909,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,...
08:46:01 <elliott> > let digits 0 = []; digits n = let (n',x) = divMod n 10 in x : digits n' in digits 9099
08:47:03 <Deewiant> > ((++ "]") . ('[':) . intersperse ',' . filter (`elem` ['0'..'9']) . show) "texas99aaxasbsa"
08:47:18 <elliott> Deewiant: I don't think we need to encourage this awful "show" thing
08:47:26 <lambdabot> forall a. (Integral a) => a -> a -> (a, a)
08:47:44 <elliott> digits :: (Integral a) => a -> [a]
08:47:44 <elliott> where (n',d) = divMod n 10
08:47:46 <elliott> digitalSum :: (Integral a) => a -> a
08:47:56 <elliott> If you try and generalise it to any Show I'll get mad
08:48:17 <Ngevd> It wasn't written to show good coding practices
08:48:55 <elliott> > let digits 0 = []; digits n = uncurry (:) $ digits <$> n `divMod` 10 in digits 9909
08:48:56 <lambdabot> [990,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,...
08:49:04 <elliott> > let digits 0 = []; digits n = flip . uncurry (:) $ digits <$> n `divMod` 10 in digits 9909
08:49:05 <lambdabot> Couldn't match expected type `[a -> b]'
08:49:15 <elliott> > let digits 0 = []; digits n = uncurry (:) . swap $ digits <$> n `divMod` 10 in digits 9909
08:49:22 <elliott> > let digits 0 = []; digits n = uncurry (flip (:)) $ digits <$> n `divMod` 10 in digits 9909
08:49:23 <lambdabot> Occurs check: cannot construct the infinite type: a = [a]
08:49:33 <elliott> > let digits 0 = []; digits n = uncurry (flip (:)) $ digits <$> (n `divMod` 10) in digits 9909
08:49:34 <lambdabot> Occurs check: cannot construct the infinite type: a = [a]
08:49:48 <elliott> > let digits 0 = []; digits n = uncurry (:) $ digits . swap <$> n `divMod` 10; swap (x,y) = (y,x) in digits 9909
08:49:49 <lambdabot> No instance for (GHC.Real.Integral (t, t))
08:50:03 <elliott> > let digits 0 = []; digits n = uncurry (:) $ digits <$> swap (n `divMod` 10); swap (x,y) = (y,x) in digits 9909
08:50:25 <elliott> ?pl \n -> uncurry (:) $ digits <$> swap (n `divMod` 10)
08:50:25 <lambdabot> uncurry (:) . (digits <$>) . swap . (`divMod` 10)
08:51:26 <elliott> Ngevd: digitSum = nat 0 $ uncurry (+) . fmap digitSum . swap . (`divMod` 10)
08:51:44 <elliott> Given obvious nat 0 z _ = z; nat n z f = f (nat (n-1) z f)
08:51:59 <elliott> Now Deewiant will come along and decimate the length of that
08:53:53 <Ngevd> "Not in scope: nat"?
08:54:14 <elliott> <elliott> Given obvious nat 0 z _ = z; nat n z f = f (nat (n-1) z f)
08:54:23 <elliott> It's the obvious catamorphism for the naturals
08:54:28 <elliott> Or the fold over naturals, if you prefer
08:54:33 <elliott> Or a function from naturals to their Church representation
08:57:32 -!- nooga has quit (Ping timeout: 258 seconds).
08:59:46 -!- nooga has joined.
09:03:47 <Ngevd> Well, I'll go back to Piet
09:10:02 -!- Ngevd has quit (Ping timeout: 260 seconds).
09:21:56 -!- zzo38 has quit (Remote host closed the connection).
09:24:00 -!- Phantom_Hoover has joined.
09:25:31 -!- nooga has quit (Ping timeout: 258 seconds).
09:46:16 -!- nooga has joined.
09:47:35 -!- Jafet has joined.
10:28:33 -!- Ngevd has joined.
10:30:06 -!- Phantom_Hoover has quit (Ping timeout: 248 seconds).
10:34:16 -!- CakeProphet has quit (Ping timeout: 259 seconds).
10:35:38 -!- CakeProphet has joined.
10:35:39 -!- CakeProphet has quit (Changing host).
10:35:39 -!- CakeProphet has joined.
10:43:10 -!- Phantom_Hoover has joined.
10:46:25 -!- variable has quit (Excess Flood).
10:47:07 -!- variable has joined.
11:01:55 -!- Vorpal has joined.
11:09:14 -!- pikhq_ has joined.
11:09:41 -!- pikhq has quit (Ping timeout: 276 seconds).
11:16:39 <Phantom_Hoover> http://www.reddit.com/r/askscience/comments/l4lqu/when_i_get_an_iv_why_do_i_immediately_taste_the/c2psz64
11:24:04 <elliott> Phantom_Hoover: That is, surprisingly enough, a normal state for tea to be in.
11:34:06 -!- Ngevd has quit (Ping timeout: 248 seconds).
11:35:59 -!- myndzi has quit (Ping timeout: 252 seconds).
11:39:55 -!- GreaseMonkey has quit (Quit: The Other Game).
12:07:07 -!- Ngevd has joined.
12:14:17 <Ngevd> > (-) ((*) 450 32) ((^) 120 2)
12:16:26 -!- Jafet1 has joined.
12:19:43 -!- Jafet has quit (Ping timeout: 265 seconds).
12:29:52 <Patashu> I am having the most depressing problem with PHP
12:30:01 <Ngevd> Is it to do with }s?
12:30:02 <Patashu> in one .php in a particular folder, I can open a file using a path
12:30:11 <Patashu> When I pass the path to another .php in the same folder, the path no longert works
12:43:38 <shachaf> You're in too many channels, elliott.
12:43:56 <Ngevd> That's one more than me
12:43:57 <elliott> Oh, EgoBot ignores lambdabot these days.
12:44:03 <elliott> I think it doesn't ignore it but won't send do it.
12:44:06 <shachaf> elliott: Only two of which I'm in.
12:44:09 <elliott> So yeah, that botloop is broken; also EgoBot isn't here.
12:45:29 <fungot> Ngevd: it is supposed to have the story thus taken out of his mouth, " and if oo puts fnord one end, oo know!"
12:45:55 <Ngevd> So, fungot ignores HackEgo
12:45:56 <fungot> Ngevd: ' but if you find him with his friends, the whole of your case, more fnord would be worth the trouble of getting up and picking the daisies, who were discussing some new music that had just arrived from london.
12:46:25 <fungot> Available: agora alice* c64 ct darwin discworld europarl ff7 fisher fungot homestuck ic irc jargon lovecraft nethack pa sms speeches ss wp youtube
12:47:17 <fungot> Selected style: fungot (What I've said myself)
12:47:35 <Ngevd> fungot fungot fungot fungot
12:47:36 <fungot> Ngevd:. i'm so kind, even to assholes! anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov
12:48:21 <Ngevd> anmaster: no! Not Markov!
12:48:29 <Ngevd> ...Who or what is anmaster?
12:49:10 <Ngevd> Vorpal: no! Not Markov!
12:49:16 <fungot> Phantom_Hoover: i am just as confused. you, in the course of the evening." make up your mind. now, only the 3 dead, and one of these contexts. the third aspect is this a cognate of the spanish fnord fnord?
12:49:31 <elliott> `addquote <fungot> Ngevd:. i'm so kind, even to assholes! anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov
12:49:32 <fungot> elliott: it's just so stupid that ' stty erase h' has, perhaps, it may be said that particularly here, parliament will give a single instance, `-h' ( currently the only thing
12:49:33 <HackEgo> 705) <fungot> Ngevd:. i'm so kind, even to assholes! anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov anmaster no not markov
12:49:52 <elliott> fizzie: How'd it get that . right after "Ngevd:"?
13:04:46 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 .).
13:06:25 -!- Ngevd has quit (Quit: Leaving).
13:07:03 -!- Jafet1 has quit (Quit: Leaving.).
13:08:02 -!- MSleep has changed nick to MDude.
13:09:29 -!- pikhq has joined.
13:09:34 -!- pikhq_ has quit (Ping timeout: 248 seconds).
13:17:55 -!- CakeProphet has quit (Ping timeout: 255 seconds).
13:22:12 -!- nooga has quit (Ping timeout: 252 seconds).
13:22:27 -!- nooga has joined.
13:25:05 -!- Ngevd has joined.
13:29:35 <Ngevd> I wonder if POVray is turing complete
13:29:37 -!- MSleep has joined.
13:33:20 -!- MDude has quit (Ping timeout: 252 seconds).
13:37:51 <elliott> Today FFmpeg has received the first legal threat in its existence. Its from a previous root admin of FFmpeg, who now is root admin of the Libav fork of FFmpeg. He claims copyright on the zigzag part of our logo. It has to be noted that he said 4 years ago Credit to whoever came up with the zigzag idea
13:37:51 <elliott> Update May 31/June 1:We have replaced the logo with a better looking one drawn by Hervé Flores.
13:37:58 <elliott> This is the stupidest drama.
13:50:47 -!- nooga has quit (Ping timeout: 255 seconds).
14:05:15 -!- derrik has joined.
14:12:30 -!- nooga has joined.
14:14:00 <Ngevd> I'm thinking of making a language to compile into BytePusher
14:14:45 <Ngevd> By which I probably mean "Feature requests?"
14:15:29 <elliott> Also, it's not night time.
14:15:44 <Ngevd> I just said goodnight because..
14:15:54 <elliott> No. It is unacceptable. We are ashamed.
14:16:01 <Ngevd> I was having a nap
14:21:54 <Ngevd> Wait, it's been done
14:27:47 -!- nooga has quit (Ping timeout: 240 seconds).
14:28:30 -!- nooga has joined.
14:31:07 <Ngevd> In BytePusher, does changing the Keyboard state bytes do anything other than changing those bytes?
14:32:16 <elliott> As in, you're not allowed to write there
14:37:08 -!- nooga has quit (Ping timeout: 255 seconds).
14:41:45 -!- Jafet has joined.
14:46:54 -!- sllide has joined.
14:47:28 -!- Ngevd has quit (Ping timeout: 252 seconds).
14:55:22 -!- ais523 has joined.
15:47:25 <fizzie> elliott: I don't know, but the spacing is a bit messy anyway. It could be that it works by writing out normal words with a space prefixed, while "." and "," and such don't get the initial space.
15:47:37 -!- Ngevd has joined.
15:49:57 <Ngevd> http://www.bbc.co.uk/news/world-us-canada-15226883
15:50:19 <elliott> You can't make this shit up.
15:51:24 -!- derrik has quit (Quit: take cares).
15:52:07 <Phantom_Hoover> http://en.wikipedia.org/wiki/Cats_of_Queen_Ber%C3%BAthiel
16:01:35 -!- monqy has joined.
16:07:20 <ais523> Phantom_Hoover: have you seen the article on toilet roll orientation?
16:11:37 <fungot> Phantom_Hoover: agora alice c64 ct darwin discworld europarl ff7 fisher ic irc* jargon lovecraft nethack pa speeches ss wp youtube*
16:11:48 <fungot> Phantom_Hoover:. i'm so kind, even to assholes! anmaster no not markov anmaster no not markov anmaster no not markov
16:12:02 <elliott> Phantom_Hoover: destro y air physical xyzzy sounds good.
16:12:21 <elliott> ais523: we fed fungot into itself
16:12:21 <fungot> elliott: and more plus the latin is a timeless language
16:14:29 <ais523> hmm, one of my friends came up with this, possibly the most pointless website ever: http://localhost.acehack.us
16:14:33 <elliott> Couldn't match type `n0' with `n3'
16:14:33 <elliott> because type variable `n3' would escape its scope
16:14:33 <elliott> This (rigid, skolem) type variable is bound by
16:14:33 <elliott> a type expected by the context: p (S n3) -> p n3
16:14:48 <ais523> elliott: what a bizarre error
16:14:58 <ais523> what language? it's definitely functional
16:15:00 <elliott> ais523: oh, this is ordinary for me
16:15:14 <ais523> yep, it didn't look like "raw" Haskell
16:15:57 <elliott> ais523: I think you could have a non-functional language with that error message... assuming you'll grant, like, C sharp as non-functional
16:16:18 <ais523> elliott: so do I, but non-functional languages rarely write "Couldn't match" in their error messages
16:16:23 <ais523> nor have type variables
16:16:39 <ais523> I didn't know what that meant
16:17:23 <elliott> ais523: I think I might have to bring in the big guns for this one (there is only one big gun, it is called unsafeCoerce)
16:17:32 <elliott> (or as I like to call it, "shut up GHC. just shut up. shut. up.")
16:18:23 <elliott> ais523: Yes, well, so is LIVING.
16:18:57 <elliott> oh, what a nice surprise; I just needed more type signatures
16:19:42 -!- azaq23 has joined.
16:22:41 <elliott> /home/elliott/Code/lc/lc.hs:27:36:
16:22:41 <elliott> Could not deduce (Prop (p0 n)) arising from a use of `unwrap'
16:22:41 <elliott> from the context (Prop (p n_tD))
16:22:41 <elliott> bound by a type expected by the context:
16:22:41 <elliott> Prop (p n_tD) => LC n -> Un (p0 n)
16:22:41 <elliott> at /home/elliott/Code/lc/lc.hs:27:29-81
16:22:50 <elliott> ais523: I've never seen n_tD before...
16:23:00 <ais523> it's probably run out of names
16:26:12 <elliott> !haskell :t System.IO.Unsafe.unsafePerformIO $ Foreign.peek . intPtrToPtr . fromIntegral =<< randomRIO (0, 2^32)
16:27:20 <elliott> /home/elliott/Code/lc/lc.hs:32:30:
16:27:20 <elliott> Couldn't match type `p' with `(->) (p n3 -> Un (p n1))'
16:27:20 <elliott> `p' is a rigid type variable bound by
16:27:20 <elliott> foldLC' :: (forall n3 r. ((Un (p n3) -> p n3) -> r) -> r)
16:27:21 <elliott> -> (forall n3. p n3 -> Un (p n3))
16:27:23 <elliott> -> (forall n3. Fin n3 -> Un (p n3))
16:27:25 <elliott> -> (forall n3. Un (p n3) -> Un (p n3) -> Un (p n3))
16:27:27 <elliott> -> (forall n3. Un (p (S n3)) -> Un (p n3))
16:32:31 <elliott> Illegal polymorphic or qualified type:
16:32:31 <elliott> forall m. (Fin n -> Fin m) -> LC m
16:32:53 * elliott should have seen that one coming.
16:58:55 -!- Vorpal has quit (Ping timeout: 248 seconds).
17:00:22 -!- derrik has joined.
17:01:42 -!- Vorpal has joined.
17:06:43 -!- azaq23 has quit (Quit: Leaving.).
17:28:58 -!- Ngevd has quit (Quit: dinner).
17:41:45 -!- CakeProphet has joined.
17:41:45 -!- CakeProphet has quit (Changing host).
17:41:45 -!- CakeProphet has joined.
17:43:38 -!- CakeProphet has quit (Client Quit).
17:44:10 -!- CakeProphet has joined.
17:53:13 -!- sllide has quit (Read error: Connection reset by peer).
17:55:32 <CakeProphet> no way my laptop is going to overheat now.
17:58:50 <pikhq> It's effing snowing.
17:59:43 -!- Nisstyre has quit (Ping timeout: 248 seconds).
18:00:05 <pikhq> It's not unheard of, but it's still fairly uncommon.
18:00:28 <pikhq> Usually it has the decency to at least wait till November.
18:01:22 <CakeProphet> that shit doesn't happen until deep winter.
18:03:16 <pikhq> We're at the far edge of tornado alley.
18:03:33 <CakeProphet> GA is the worst for tornados. or close to one of the worst I think.
18:03:57 <CakeProphet> last summer we probably had maybe 5-7 tornados?
18:03:58 <pikhq> Oklahoma and Kansas are far worse.
18:05:27 <pikhq> Actually, per land area Oklahoma and Kansas get the most, total Texas gets the most.
18:06:55 <CakeProphet> http://en.wikipedia.org/wiki/File:Tornado_Alley.gif
18:08:26 <pikhq> Lemme put it this way: Oklahoma has gotten 66 tornados in a day.
18:12:11 <pikhq> https://upload.wikimedia.org/wikipedia/commons/3/35/Tornado_track_map_1999_Oklahoma_tornado_outbreak.gif This was a bad day.
18:12:32 * pikhq used to live in one of the towns destroyed by that clusterfuck
19:19:57 -!- micahjohnston has changed nick to dumbasstatertot.
19:20:11 -!- dumbasstatertot has changed nick to damn.
19:20:18 -!- damn has changed nick to micahjohnston.
19:26:47 -!- micahjohnston has changed nick to lightwater.
19:27:10 -!- lightwater has changed nick to clitheroe.
19:27:41 -!- clitheroe has changed nick to craigcockbur.
19:27:43 -!- craigcockbur has changed nick to craigcockburn.
19:27:46 -!- craigcockburn has changed nick to micahjohnston.
19:28:01 -!- Jafet has quit (Quit: Leaving.).
19:30:34 -!- micahjohnston has left ("AIO_ALLDONE").
19:37:05 -!- Nisstyre has joined.
19:40:14 -!- Sgeo|web has joined.
19:40:27 <Sgeo|web> Is it just me, just my slow computer, or is PCManFM shit?
20:03:31 <ais523> conclusions from Windows 8: Microsoft doesn't just copy its competitors' good ideas, but their bad ideas too
20:04:01 <ais523> that is, from the descriptions of it in the media; I haven't used it
20:16:02 <Sgeo|web> Note to self: Stop being prejudiced against programs whose name begins with x
20:25:06 <CakeProphet> ~$ ps -e | grep -i xorg 1041 tty7 01:20:15 Xorg
20:26:05 <monqy> Xmonad, xMonad, xmOnad
20:26:46 <Sgeo|web> Also, how does Xorg not suck? It's an X server, and I think consensus here is that X sucks...
20:32:14 <Phantom_Hoover> http://www.reddit.com/r/askscience/comments/l4nqs/why_does_cold_water_taste_better_than_warm_water/c2pvhi2
20:34:03 -!- elliott has quit (Remote host closed the connection).
20:50:39 -!- derrik has quit (Quit: take cares).
21:47:23 -!- Phantom_Hoover has quit (Ping timeout: 260 seconds).
22:02:24 -!- Phantom_Hoover has joined.
22:05:47 -!- nooga has joined.
22:24:24 -!- nooga has quit (Ping timeout: 276 seconds).
22:26:08 <ais523> what's the best way to delete all lines in a file that are identical to lines that appeared previously in the file? sort of like uniq, but on unsorted files
22:26:42 <ais523> I can find the offending lines quite easily with sort | uniq -d
22:26:52 <ais523> hmm, it's probably using awk or Perl, and I don't know awk
22:31:01 <ais523> $x{$_}?$_="":($x{$_}=1)
22:31:10 <ais523> golf practice comes to the rescue
22:34:10 -!- pikhq_ has joined.
22:34:44 -!- tiffany has joined.
22:34:48 -!- pikhq has quit (Ping timeout: 276 seconds).
22:38:11 <ais523> came up for my job, accidentally awarded some students marks twice…
22:39:20 -!- nooga has joined.
22:46:23 <ais523> well, they didn't see the marks
22:46:30 <Phantom_Hoover> There's nothing worse than people who aren't me getting awarded marks they shouldn't have been.
22:46:30 <ais523> and I knew that the duplicate awards would be exact duplicates, as it was scripted
22:46:48 <ais523> so a quick unsorted-uniq got the job done (and I verified by hand it was working correctly)
22:46:59 -!- ais523 has quit (Remote host closed the connection).
23:00:59 -!- zzo38 has joined.
23:11:45 <zzo38> Please make the hole in one by the technique of the boast.
23:16:16 <Madoka-Kaname> That sounds like something a native speaker of Japanese would say.
23:16:48 -!- tiffany has quit (Quit: Leaving).
23:19:42 -!- tiffany has joined.
23:34:29 -!- pikhq has joined.
23:34:34 -!- Patashu has joined.
23:34:53 -!- pikhq_ has quit (Ping timeout: 255 seconds).
23:37:12 -!- augur has changed nick to TheDoctor.
23:37:18 -!- TheDoctor has changed nick to augur.
23:37:47 <augur> Phantom_Hoover: shenanigans in another channel
23:37:59 <augur> someone had the nick CaptnJack
23:38:04 <augur> so i figured i'd play along
23:38:20 <Phantom_Hoover> And I can just imagine how it went; no illustration will be needed.
23:39:47 <zzo38> Once I met someone (I think it was in school) who claimed he could predict which classical element the sign I was born in belonged to, without my birthdate. He said he was accurate 11 out of 12 times. I do not remember what his actual accuracy was (if it was random and uniform, it would be 1 out of 4).
23:41:36 <Phantom_Hoover> More sample data, vital for finally contacting the isolated tribes of zzo38ia.
23:41:44 <Patashu> how would he get 1 out of 4 by random chance?
23:41:57 <zzo38> Because there are four classical elements.
23:42:37 <Patashu> well, it's worth noting that which month of the year you're born in DOES have a statistical effect on you. I read about it in newscientist
23:43:09 <zzo38> Yes, I know it does. I have read it too, in various places.
23:43:34 <Patashu> bah, I can't remember what the article was called
23:43:48 <augur> Phantom_Hoover: SOME THINGS GO TOO FAR
23:44:43 <zzo38> But there is more than just the month you were born. Perhaps season is one thing (although the month almost implies the season, I suppose).
23:44:48 <augur> Phantom_Hoover: IS NOT
23:45:03 <Phantom_Hoover> 'ALOT' HAS THE STRESS ON THE FIRST SYLLABLE. 'A LOT' HAS THE STRESS ON THE SECOND
23:45:31 <augur> about the stress, i mean
23:46:04 <zzo38> Do you know what the similarities of statistics effects on you of the months? If they belong to the same classical elements, are those more similarities?
23:46:05 <monqy> my stress is the same as phs i think
23:46:13 <augur> do you use primary stress on allot as well?
23:46:46 <monqy> ugh i'm bad at stress but allot has it on the second???? heLP
23:48:43 <augur> Phantom_Hoover: not phonemically or phonologically.
23:50:46 -!- Phantom_Hoover has quit (Quit: Leaving).