00:00:04 -!- Patashu has joined. 00:08:57 -!- augur has quit (Ping timeout: 240 seconds). 00:10:40 elliott, kallisti Phantom_Hoover update no Ngevd because he's not here 00:12:12 -!- augur has joined. 00:12:58 Gregor: Ping 00:19:54 -!- quintopia has quit (Ping timeout: 260 seconds). 00:20:43 -!- quintopia has joined. 00:23:40 -!- pikhq_ has joined. 00:24:15 -!- pikhq has quit (Ping timeout: 276 seconds). 00:27:59 `cat wisdom/coppro 00:28:01 coppro prefers his nickname, Pooppy. 00:28:16 `cat wisdom/ngevd 00:28:20 ​=pzҶ*Gm...Zo'.LƖ2..`W0O.G?H.7x=9h..> #I.nb.s#mN~s>.2. ?.p?..b6$p9.wVgD.\...jMN*uaD.(..j+vߨnQ \ ^&4,.>&G*R}N!!1.|p'A(;iEﺾ.}.kAiyWb%cM.JE4XMQ_.2.W5^^..9..\,[!DP[Djx^.:Nߩsf..g벍?.?̥"tq.Ƚ2....v0.<θ¹y=I^^.9{r:c;'{нi@FU/Jv...a.-v 00:36:34 coppro: *`? coppro 00:37:50 elliott: what 00:41:58 `? coppro 00:42:01 coppro prefers his nickname, Pooppy. 00:42:15 * Sgeo assumes that Gregor set that 00:42:16 ah 00:42:18 meh 00:42:23 Sgeo: you assume correctly 00:42:40 `log `learn coppro 00:43:08 2012-01-02.txt:00:42:40: `log `learn coppro 00:46:31 @hoogle atomicModifyIORef 00:46:32 Data.IORef atomicModifyIORef :: IORef a -> (a -> (a, b)) -> IO b 00:55:48 Sgeo: 16:08:22 Is hSetBuffering stdin NoBuffering >> hSetBuffering stdout NoBuffering supposed to work on Windows? 00:55:49 Sgeo: No. 00:56:00 http://hackage.haskell.org/trac/ghc/ticket/2189 00:56:14 ty 00:58:00 elliott: Are you reading #haskell logs? 00:58:08 Instead of just joining the channel? 00:58:16 Well, I suppose you're there now. 00:58:26 If only there was a mechanism for posting directly into the logs. 00:59:00 shachaf: I read logs to figure out why it was so silent. 00:59:44 elliott: Curses, you've figured out our "silence as soon as elliott joins the channel" plan. 01:03:07 it would be terrible if someone invented a mechanism to post directly into the logs 01:03:11 such as by saying things in the channel 01:05:21 coppro: http://www.youtube.com/watch?v=xECUrlnXCqk 01:09:03 * coppro bookmarks 01:09:15 elliott, :( at bug lasting for so long 01:11:03 Sgeo: It's the touch of Deewiant. 01:11:11 Every compiler bug he touches never gets fixed, ever. 01:11:16 I know this because n=2. 01:18:06 The way too fix "writeFile complains about too-many-open-files" is obviously to convert Char to Word8. 01:18:22 WTF? 01:19:05 shachaf: His message implies to me that he hadn't actually written it yet. 01:19:14 I'm a bit unclear, but tell you what I've write it using String and System.IO.writeFile and if it crashes becasue too many files are open, then I'll know I need to change something. 01:19:19 I think "I've" should be "I'll". 01:30:17 WTF, Cracked only started in its current form in 2007? 01:30:32 -!- Darth_Cliche has joined. 01:31:02 It's gone from 'crappy ripoff of Mad' to 'crappy ripoff of Maxim' to 'respected(ish), well-known website' very quickly. 01:31:39 FSVO respected. 01:32:28 Well, as in the name is well-known and there isn't any great demerit associated with it. 01:33:54 -!- DCliche has quit (Ping timeout: 240 seconds). 01:42:01 -!- sebbu2 has changed nick to sebbu. 01:42:08 * Phantom_Hoover → sleep 01:42:10 -!- Phantom_Hoover has quit (Quit: Leaving). 01:42:31 New rule: Balance ":-(" and ":-)" smileys. 01:42:51 noses :-( 01:43:02 :-( :-( :-( 01:44:10 * elliott enjoys watching Sgeo detail all the ways in which Active Worlds' API is the most broken piece of shit ever without actually being able to bring himself to say "it's a terrible library for a terrible game". 01:44:20 Sgeo: Also seriously why don't you just implement the network protocol. 01:44:35 It's a terrible library for a good game. 01:44:44 elliott, against the TOS I think. 01:44:51 Also, I don't know it 01:45:04 Sgeo: Against the TOS in a completely indistinguishable way. 01:45:09 Also, no, it's a terrible library for a terrible game. 01:45:32 elliott, there are things you cannot do with the SDK that you can do with the network protocol.. 01:47:09 So don't do those. 01:49:00 -!- zzo38 has joined. 01:51:11 -!- zzo38 has set topic: This cannel Copywrong 0 YOLD Rogger Sarcridh - All lights reversed (Except for things copyrighted by Gregor Richards) | http://codu.org/logs/_esoteric/. 01:52:34 zzo38: Good point. 01:53:42 -!- zzo38 has set topic: This channel Copywrong 0 YOLD Rogger Sarcridh - All lights reversed (Except for things copyrighted by Gregor Richards) | http://codu.org/logs/_esoteric/. 01:57:46 TeX can make file with binary specials although DVItype will show a message about non-ASCII specisl if you do that. 01:58:57 shachaf can't make file with binary specials. 02:00:21 Binary specials! Eight bits for the price of seven. 02:01:06 I did it because of the printer drivers for the new computer I will make, are all DVI-based, so it uses what are called "Black Associates specials" which are binary data in DVI specials (although a DVI file with no specials will still print perfectly OK). Such as, colors (CMYK + grayscale value + pure black/white only value) 02:02:08 However, TeX has no command built-in for converting numbers to binary data to specials, so I wrote macros to do that (TeX is very powerful and can do these kind of things!). 02:02:48 So, I can put 1-byte numbers, 2-byte numbers, and 4-byte numbers. All are big-endian to be consistent with the format of other numbers in DVI file. 02:06:45 Well, #haskell is still bad. 02:09:51 elliott: Maybe it's because zzo38 is no longer in there. 02:10:13 Yes. 02:12:14 elliott, am I helping or hurting? 02:12:25 Why do people ask questions like that? 02:13:11 The most likely answers range from lukewarm to negative. 02:16:09 -!- DCliche has joined. 02:19:16 -!- Darth_Cliche has quit (Ping timeout: 252 seconds). 02:35:39 I think #haskell is bad too they don't like to answer my questions, sometimes other thing they didn't answer either 02:36:44 shachaf: We have consensus. 02:44:25 elliott: Questions like what? 02:45:39 -!- oklopol has joined. 02:45:42 oasijfoiasjdfoaijwrglkjwelgkjweaklgja 02:45:47 okokokokokokokokokokokokoko 02:45:50 okokokokokokokokoko 02:45:52 okokokokokko 02:45:54 ooijoijadj 02:50:02 hi oklopol 02:50:08 shachaf: Like elliott, am I helping or hurting?. 02:50:19 oklopol: how many phds do you have now 02:50:24 hi elliott, are you the same elliott i talked to last time i was here? 02:50:27 no 02:51:00 you really look like him though 02:51:10 i have zero (0) phds 02:51:16 :( 02:51:20 what 02:51:21 lol 02:51:25 still? seriously? 02:51:28 yes. 02:51:32 are you in a university yet? 02:52:00 well no, i'm skipping the university thing and just getting the phd. 02:52:07 oh okay 02:52:07 because i'm efficient, unlike you 02:52:50 elliott: Don't PhDs typically involve universities too? 02:53:18 shachaf: That's what they tell everyone to keep out the riff-raff, but if you're actually any good you just get the Ph.D. direct. 02:53:23 i have made peace with failing at life. 02:53:26 Of course people like oklopol never find out the real truth. 02:53:38 They must resign themselves to the fake truth. 02:53:55 yes, i just do what people tell me to and try to make the best of it. 02:54:26 elliott: Direct from The Elliott PhD Authority? 02:54:29 the drugs help 02:54:39 and the fight club 02:55:08 shachaf: Yes. 02:56:36 shachaf: University of Phoenix, obv 03:00:20 shachaf: I fixed a silent type error in some unsafeCoerce-using code today. 03:00:24 Thank god I use Haskell! 03:01:44 -!- Klisz has joined. 03:04:29 -!- DCliche has quit (Ping timeout: 252 seconds). 03:07:41 elliott: Was it *your* unsafeCoerce-using code? 03:08:07 If so, I have no sympathy for you. 03:08:19 i have enough sympathy for everyone 03:08:40 shachaf: Yes. 03:08:44 shachaf: Well, sort of. 03:08:52 Take oklopol's sympathy, then. 03:08:56 I wrote about a third of it. 03:08:56 -!- NihilistDandy has joined. 03:09:07 Did you introduce unsafeCoerce to it? 03:09:20 No. But I did suggest doing so. 03:09:25 Although so did other people at the time too. 03:09:37 (It previously abused an IORef and unsafePerformIO for the purpose.) 03:09:45 (Not the polymorphic wossname trick, though.) 03:09:57 It should be possible to implement ST with just unsafeCoerce and Any, right? 03:10:09 And no other functions or types? No. 03:10:17 You'd need (->) at the very least. 03:10:33 I meant, as the only unsafe features. 03:10:41 All the safe ones allowed too 03:10:51 Besides ST 03:11:23 You can implement ST with just unsafePerformIO, too. 03:11:33 But yes, you can construct STMap with unsafeCoerce and Any. 03:11:43 shachaf: Did you hear reactive-banana is getting dynamic event switching??? 03:16:07 -!- DCliche has joined. 03:17:14 maybe the logo of reactive-banana should be an actual radioactive banana. it'd of course look like a normal banana but it would actually be delivered to you by mail when you go to the website with some glue so you can stick it on your monitor and your death would be the difference between radioactive and not. 03:19:21 -!- Vorpal has joined. 03:19:22 I could forward that suggestion onto the developer if you'd like. 03:19:28 you should 03:20:25 -!- Klisz has quit (Ping timeout: 276 seconds). 03:20:38 well, perhaps you can't make it a surjection since i don't think great ideas are extensions of humans. 03:20:57 * oklopol makes the best math jokes 03:21:27 we love you oklopol 03:22:05 maybe i should've said epimorphism since the term extension is only used for morphisms of dynamical systems afaik. 03:22:15 (epimorphism instead of surjectiom) 03:22:19 *surjection 03:22:28 speaking of math, i watched an episode of numb3rs today 03:22:54 did you see the irc boats 03:23:20 the first episode was more like 57471571c5 03:23:35 the irc boats aren't in the first ep 03:24:22 `addquote speaking of math, i watched an episode of numb3rs today the first episode was more like 57471571c5 03:24:25 791) speaking of math, i watched an episode of numb3rs today the first episode was more like 57471571c5 03:25:41 -!- cswords has joined. 03:25:52 -!- cswords has quit (Read error: Connection reset by peer). 03:25:56 the idea in the episode was that there had been 13 rapes plus some murder on the side and the cop's brother is a "world-class mathematician" and he made a formula that told them where the rapist probably lived. he lived there. 03:26:43 congratulations, you have now seen every episode of numb3rs 03:26:53 well actually he didn't and then their dad told them herp derp maybe he occasionally rapes ppl near work to save the rape commute. 03:27:22 so he was like omgomgomg so simple and predicted *two* zones 03:27:43 and one was where he lived and one was where he went to work 03:28:42 also the first cluster was where he used to live. so 13 points were enough to pinpoint three locations around which the guy had occasionally done some raping. 03:29:46 probably i'd be so hooked after a few episodes, but i'm not sure i want to be associated with this devil porn. 03:34:05 what i want is a show where in the pilot they try to prove that a space is compact. their only clue is that it is sequentially compact, but the space is clearly not metric. naturally they must consult The Oracle. 03:42:01 Will this do as a syntax for a MML compiler? data Token = Number Int | Name String | Block [Token] | Note Note | Text String | Bar deriving (Eq, Show); data Note = Note { noteLetter :: Char, noteOct :: Int, noteAcc :: Int, noteLength :: Maybe Int, noteVol :: Maybe Int } deriving (Eq, Show); 03:42:43 -!- NihilistDandy has quit (Quit: Linkinus - http://linkinus.com). 03:43:15 -!- NihilistDandy has joined. 03:51:14 kallisti, elliott update. elliott, kallisti update. 04:11:21 -!- azaq23 has joined. 04:11:38 -!- azaq23 has quit (Max SendQ exceeded). 04:12:03 -!- azaq23 has joined. 04:12:08 -!- azaq23 has quit (Changing host). 04:12:08 -!- azaq23 has joined. 04:42:26 -!- Darth_Cliche has joined. 04:43:01 Have you ever play single player Scrabble? 04:45:21 -!- itidus21 has joined. 04:46:05 -!- DCliche has quit (Ping timeout: 249 seconds). 04:48:40 nope 04:53:08 The rules are the same as two players, except that passing is not allowed. 04:56:43 passing should be allowed imho 04:57:48 Sometimes passing is allowed, but if you do, the game immediately ends and you lose points according to your letters in your hand (after replacements are drawn). 04:58:01 cool 04:58:21 Another rule sometimes used is that there is a time limit for the entire game, and the game also ends if time runs out. 05:00:26 zzo38, you could also limit the number of times you can pass? 05:01:18 Vorpal: Yes, I suppose that is another possible idea you could use. (Although if there is a time limit, generally you are still not allowed to pass; you could make a pass limit with or without a time limit) 05:19:42 Once I read somewhere describing type systems of programming languages like Haskell and so on as "Presbyterian" and "Catholic", on some article describing "Roman containers" although I did not understand all of the notation used 05:30:38 istr that 05:34:07 I think Parsec's "choice" function should really belong to Control.Applicative instead. 05:34:39 It is a fold with <|> 05:39:21 @hoogle (<|>) 05:39:21 Control.Applicative (<|>) :: Alternative f => f a -> f a -> f a 05:39:22 Text.Parsec.Prim (<|>) :: (ParsecT s u m a) -> (ParsecT s u m a) -> (ParsecT s u m a) 05:39:22 Text.ParserCombinators.Parsec.Prim (<|>) :: (ParsecT s u m a) -> (ParsecT s u m a) -> (ParsecT s u m a) 05:40:06 Sgeo: They are all the same, Parsec's one is just for Parsec only 05:40:29 zzo38, I just wasn't certain that <|> was in Control.Applicative 05:55:13 I do like Parsec very much. Even though they did define the Applicative and Alternative instance for Parsec, the designers of that system seem to not use them, from what I can see. 05:56:35 And why did they define their own operators with the same names and functions as the Control.Applicative ones anyways? 06:05:33 zzo38: asum 06:05:35 @hoogle asum 06:05:36 Data.Foldable asum :: (Foldable t, Alternative f) => t (f a) -> f a 06:05:49 zzo38: and because Parsec is actually the source of the Alternative operators 06:05:53 so, historical reasons 06:06:13 O, that is why. Shouldn't they fix it by now, though? 06:06:37 they should probably re-export the polymorphic versions 06:06:50 elliott: Yes, that is probably what they should do. 06:07:54 submit a patch, it'd be like a five-line change :) 06:10:25 the thing that annoys me about the "you can install gentoo with three commands" quote is that it doesn't list the other two 06:17:14 is infinity a stream? 06:24:33 hi 06:24:45 infinity is not a stream because that question is meaningless. 06:25:08 Note to self: Suggest strict state monad to apfelmus. 06:25:24 ais523: jokes are not known for their factual accuracy 06:25:48 elliott: but it could be both a joke /and/ factually accurate with just two more lines 06:25:54 then it'd be both amusing /and/ useful 06:26:14 elliott: stand up comedians tend to employ this kind of humor, in fact. 06:26:27 "the truth is funny" is kind of stuff. 06:26:29 -is 06:26:35 or to put it another way, the joke's funnier if it's based on actual facts 06:27:44 but, then again, most of it is just incorrect sexist/racist bullshit so... 06:27:49 maybe the truth isn't very funny. 06:28:23 ais523: it would then be a /bad/ joke 06:28:27 because the timing would be completely ruined 06:28:58 elliott: OTOH, I think the joke's much funnier if there are three commands, and that's the first 06:29:06 it's only funny if it's true 06:29:30 kallisti: How to be a shitty standup comedian in 3 easy steps: 1. Say stereotypical bullshit 2. I'm just saying what everyone is thinking! 3. Why are you annoyed, it was a JOKE. 06:29:39 how is it untrue 06:30:04 ais523: the command would give you a gentoo installation assuming there are no stupid mistakes in it 06:30:07 there are two other commands, but they just aren't provided 06:30:17 providing the other two would ruin the timing i agree 06:30:28 the other two commands are presumably system configuration, since that one already installs openoffice :) 06:30:38 you'd give them later on in the same quote 06:30:41 after the comedic timing 06:30:44 ais523: yes, which would ruin the joke 06:30:53 perhaps even double-linebreak and give a "for the interested reader" PS thing 06:31:00 you don't tell a joke and then say "wait I'm not done yet" and spend three minutes giving a pedantic discussion of the relevant facts 06:31:08 because to people who aren't ais523, that's really, really boring 06:31:15 then the joke is how bad the original joke is ruined 06:31:16 and will ruin the previous enjoyment of the joke 06:31:18 this is not really complicated 06:31:22 elliott: even a link would be enough 06:31:29 * to ruin the joke 06:31:34 hey, look at me jumping out of this ridiculous conversation -> 06:31:53 don't leave me allone / im fallow suit 06:32:03 Fallow Suit, famous comedian 06:36:00 -!- Darth_Cliche has quit (Quit: SLEEP, GLORIOUS SLEEP). 06:39:21 ~/src/reactive-banana/reactive-banana/src/Reactive/Banana 06:39:22 a good path 06:47:43 it'd be bizarre even without the repetition 06:47:53 I take it the ~ there means home dir, not an actual directory called ~? 06:48:03 alt-f2 on this computer interprets it as the latter, which is annoying 06:48:34 former 06:48:39 what's bizarre apart from the repetition 06:57:35 This is another use of <*> operator: parseInt = option id (negate <$ char '-') <*> (read <$> some digit); 06:57:40 ais523: ? 06:58:08 elliott: if I alt-f2 and then use a ~ in either the command to run or an argument to it 06:58:11 it's interpreted as a literal ~ 06:58:17 not expanded to /home/ais523 06:59:42 ais523: it'd be bizarre even without the repetition what's bizarre apart from the repetition 06:59:56 elliott: oh, the name "reactive banana" 07:00:27 well, "reactive" is taken :) 07:03:39 oh hmmm I need to start thinking about taxes. 07:06:37 OK I made a parser of a MML variant. After a note you can have # or + for sharp, - or b for flat, x for double sharp, and you can have more than one of any of them. You can also have a optional length after a note, an octave shift ' for up and , for down, and a volume in parentheses. Persistent octave shifts are < for down and > for up 07:07:34 This is already more than most other MML that I know of. 07:09:33 Maybe another thing I should have is multiple notes in parentheses for making chords 07:09:58 Does this look like good so far? 07:10:59 yes, assuming you can double shift octaves and such 07:11:17 also an absolute octave notation would be good. A4 07:11:24 Yes, you can include multiple ' or , to multiple shift octaves, or you can use persistent octave shifts such as < and > 07:11:35 unless you plan to reserve that notation for things like chords. 07:12:07 But I do not intend absolute octave notation because you can use the notation like A4 to indicate a quarter note A instead. And you can have L and a number for persistent length setting. These are standard features of MML. 07:13:00 And use O and a number to persistent select an octave. 07:13:49 hmm, i should go to bed 07:14:21 What I mean, you can still use ## for double sharp instead, but x is a more common way of indicating double sharp in music notation. 07:14:41 zzo38: you'd also want a way to select time signature so that A4 has meaning 07:14:47 also 07:14:52 A4. could specify a dotted quarter note. 07:15:58 And, yes, that is good too; use . to specify dotted lengths. And the way to set time signature. How I have it, any words must be in lowercase because uppercase are used for notes and other single-letter commands. 07:16:21 zzo38: also you could write a parser that converts your notation into Haskore data structures and then you could take advantage of all of those libraries. 07:16:51 kallisti: Yes I can add such feature; currently I am planning to use .S3M as output format but I can add more. 07:17:19 zzo38: well Haskore wouldn't be used as an output format in this case, just as a means to save time by using existing code. 07:17:34 I'm sure Haskore can output to a number of different formats 07:18:06 oh dude there's a csound backend for HasSound 07:18:26 The lowercase words commands probably I can make most of them in Italian since music notations commonly uses Italian. 07:19:57 zzo38: surwe. 07:20:04 What formats does Haskore have? Anyways, I intend other things too, not only writing the music; such as, comments, instrument definition (by file or by mathematical formulas), and later on, non-12-TET. 07:20:06 i'm italian 07:20:09 (not treu) 07:21:02 You can use ; for comments in file which are ignored, but another kind of comments that are copied into the sample names in the .S3M output file so that a .S3M player program can display them. 07:56:39 I include features which the most sophisticated .S3M tracker programs lack (in S3M output anyways; and, at least, which the free ones lack). But still use completely standard output format, which can be loaded in tracker programs. (I did already start writing this program and I know how to continue too) 08:02:26 -!- pikhq_ has quit (Ping timeout: 244 seconds). 08:02:27 -!- pikhq has joined. 08:02:35 If you have used TeX, what in your opinion, are what makes TeX an excellent typesetting program? 08:03:33 (Or bad, if that is what it is to you) 08:03:45 it's bad because hitler uses it 08:04:08 Hitler uses TeX? 08:04:56 That isn't a good reason anyways 08:06:09 he might! 08:06:26 It still isn't a good reason 08:08:32 Have you used TeX at all, anyways? 08:12:53 yes 08:14:40 Is it good for you? 08:14:55 maybe! 08:15:45 How many kind of its features have you used and what other things have you done with it? 08:16:11 elliott: Bet you didn't expect the TeX inquisition. 08:17:45 fizzie: i did not :( 08:20:40 elliott, kallisti update 08:32:29 If making a Haskell package (one which is compiled into an executable; not a library) licensed under GNU GPL, is it OK to change the LICENSE filename to COPYING if the .cabal file is also changed accordingly? 08:33:16 Libraries I make in Haskell are public domain but for executables I will usually want GPL 08:34:30 (Although Haskell Swiss Ephemeris library is GPL because Swiss Ephemeris itself is GPL) 08:36:09 sure 08:37:57 In addition, why does it try to copy the LICENSE file anyways (and result in error message) if public domain is selected? They should either add such a file (probably containing a public domain dedication and the message to use it for any purpose, even if your jurisdiction has no public domain), or make it not copy the file 08:38:56 Another thing I notice, is the copyright notice is not automatically generated if GPL is selected; it is still commented out and you have to put it in by yourself. 08:41:00 which jurisdictions have public domain and which ones don't? 08:41:21 I know US has it, but that is all I know 08:41:54 germany doesnt iirc 08:42:01 What I know is some people have said that some jurisdictions do not have it. It is why the WTFPL is made up 08:42:11 ah 08:42:26 I guess it would be prudent to find out if Sweden has it for me. 08:43:26 I think they should fix the cabal simply for that reason, which is that some jurisdictions do not have public domain, so that the message to do anything with it can still be provided anyways 08:43:55 @tell elliott test 08:43:55 You can tell yourself! 08:43:58 ugh 08:44:08 elliott, so you got a message? 08:44:09 -!- elliott has changed nick to colloinkgravisom. 08:44:11 or is the message typoed? 08:44:28 @tell olsner test 08:44:28 You can tell yourself! 08:44:35 no you can't 08:44:38 since it didn't record it 08:44:45 of course you could using other channels 08:44:57 so I guess it is kind of ambiguous if it is typoed or not 08:45:00 the point is that I can tell myself without using lambdabot 08:45:26 fuck me. I been on windows for a few days and I reboot to linux and have over 1 GB of updates to download... 08:45:32 You can also ask someone else to do it for you, if necessary 08:45:58 olsner, I guess so yeah 08:46:13 @tell lambdabot does this work? 08:46:13 Nice try ;) 08:46:18 nope 08:46:41 arguably that should go to whoever runs the bot 08:46:48 cale 08:46:48 colloinkgravisom: You have 1 new message. '/msg lambdabot @messages' to read it. 08:46:53 colloinkgravisom, right 08:47:10 Does it have anything like the ADMIN command of IRC? IRC has ADMIN command tell you the information 08:47:28 does that actually work I wonder 08:47:34 hm it does 08:48:10 @messages 08:48:10 kallisti said 5d 2h 36m 2s ago: Hey, so I don't think [a] = Maybe (a, [a]) because there's no equivalent to (Just _|_) or (a, Just _|_) or .. 08:48:20 don't dreg up the past lambdabot 08:49:47 I can see it doesn't work due to undefined but ignoring undefined value, it will be mathematically the same thing, so it is just as good for computing derivatives and isomorphisms and so on 08:50:00 ah, kallisti counting bottoms, #haskell's favorite pastime that 08:50:15 is it 08:50:45 maybe not *the* favorite, but it's high up on the list anyway 08:52:20 Once I calculated the derivative of list type, someone said it is the correct derivative but doesn't seem a correct zipper. 08:52:56 that was oerjan. 08:53:29 Yes, I think it was oerjan 08:54:10 Do you think it is a correct zipper? Or is it a correct derivative but not a correct zipper? 08:54:17 And why? 08:58:05 ls 08:58:09 err wrong computer 08:58:35 (I'm using synergy and if fucked up my input focus somehow) 09:09:16 w00t, LTL types FRP. This is kind of cool. 09:12:37 -!- colloinkgravisom has quit (Ping timeout: 268 seconds). 09:17:13 -!- zzo38 has quit (Remote host closed the connection). 09:23:52 Deewiant, what is FRP and LTL in this context? 09:24:27 functional reactive programming / linear temporal logic 09:24:30 ah 09:24:32 Functional reactive programming and linear temporal logic respectivelyi. 09:24:34 -i 09:25:31 -!- Ngevd has joined. 09:30:58 Hello! 09:30:58 @ping 09:30:58 pong 09:32:45 -!- nooga has joined. 09:38:47 -!- Ngevd has quit (Ping timeout: 240 seconds). 09:46:58 -!- Ngevd has joined. 09:47:06 Hello! 09:47:27 hey. 09:48:34 Today's xkcd is alright, except for the punchline 09:49:29 -!- FireFly has quit (Ping timeout: 240 seconds). 09:50:06 http://xkcd.com/997/ I like this one 09:50:27 I missed the joke 09:50:46 Ngevd, in the one kallisti linked? Same 09:50:55 I guess it is some US politics joke or something? 09:51:24 kallisti, is that so? 09:51:43 I thought it was a quiz show? 09:51:52 what was? 09:51:59 yes it's an incredibly lame joke about a radio quiz show in the US. 09:52:05 that only old people and nerds listen to. 09:52:07 ah I see 09:53:17 it's funny though because any newsworthy events involving Peter Sagal would basically have to have a headline following that format. 09:53:24 it's required. 09:53:27 I see 09:54:57 there's basically nothing political about NPR, except recently Republican media seems to think NPR is liberal. 09:55:05 when it's just like... not stupid. 09:55:11 not stupid = liberal, I guess. 10:00:06 actually NPR has been known to fire people for displaying a political bias in their personal life. 10:00:38 I don't see the issue as long as it doesn't affect them in their profession 10:01:05 there's not one. I think NPR is just really strict about it for public relations. 10:01:50 but it could easily backfire. 10:01:59 oh? 10:02:25 yes firing people for publically displaying opinions probably isn't good press. 10:03:12 grantedm a lot of the firings over Occupy Wall Street were freelance radio reporters and not actual NPR staff, for what it's worth. 10:04:23 hm 10:05:33 but freelancers is probably like... the majority of NPR's employees. 10:05:41 because that includes a lot of people that work for NPR stations. 10:07:15 Occupy #esoteric. (And do what, exactly?) 10:07:52 fizzie, talking about esolangs all the time? 10:07:54 that could work 10:08:54 I guess as a protest of all the non-topicalness that goes on here it could work. 10:09:00 indeed 10:09:39 !perl $_ = "test"; s/(.)./@/; print $1 10:09:41 t 10:09:46 hm 10:10:03 * kallisti has never accessed a capture group from a substitute, actually. 10:10:08 so I wasn't sure if it actually did that. 10:10:42 Do you mean to say you have never used a $n in the replacement part of a s///? 10:11:47 oh hmm... maybe I have. 10:11:50 yes I have. 10:16:18 -!- Ngevd has quit (Read error: Connection reset by peer). 10:24:45 -!- nooga has quit (Ping timeout: 240 seconds). 10:24:54 !perl print [] == [] 10:24:55 No output. 10:24:57 !perl print [] eq [] 10:24:58 No output. 10:26:27 hmmm what is a reference in numeric context I wonder 10:26:34 !perl print [] 10:26:34 ARRAY(0x7ff735781d48) 10:26:41 I guess its address? 10:26:58 !perl print "0xFF" + "OxFF" 10:26:58 0 10:27:21 oh okay. 10:27:29 !perl print "0xFF" + "0xFF" 10:27:29 0 10:27:53 so perl doesn't attempt to read hex literals when converting a string to a number. 10:28:49 kallisti, that looks like a reasonable address for the stack to me 10:29:11 ??? 10:29:15 ARRAY(0x7ff735781d48) 10:29:16 that is 10:29:33 how does that look like the address to a stack? it looks like an arbitrary location in memory to me. 10:29:33 looks like about the usual location of the stack on Linux (x86-64) 10:30:25 kallisti, run cat /proc/self/maps a few time on a 64-bit machine 10:30:32 "ah yes good ol' 7ff735781d48" -- Vorpal 10:30:38 kallisti, look at [stack] and [heap] 10:30:46 kallisti, stack is usually 7ff* 10:31:08 kallisti, heap tends to start with many zeros 10:31:48 kallisti, libraries tend to be mapped around 7f0*-7fe* 10:32:02 kallisti, not so hard after all 10:32:13 `run cat /proc/self/maps | egrep '[stack]' 10:32:24 00400000-0040c000 r-xp 00000000 00:09 842385 /bin/cat \ 0060c000-0060d000 rw-p 0000c000 00:09 842385 /bin/cat \ 0060d000-0062e000 rwxp 00000000 00:00 0 [heap] \ 40000000-4001e000 r-xp 00000000 00:0f 835040 /lib64/ld-2.11.2.so \ 4021d000-4021e000 r--p 0001d000 00:0f 835040 /lib64/ld-2.11.2.so 10:32:27 `run cat /proc/self/maps | egrep '\[stack\]' 10:32:31 7fbff23000-7fbff44000 rw-p 00000000 00:00 0 [stack] 10:32:58 it is 7ff* on my computer though 10:33:03 on my system the stack is consistently 7fff* for cat even 10:33:07 three f 10:33:16 Yes, "7ff" is quite stacky indeed. 10:33:46 uh, but 7ff* is a huge range of addresses.... 10:33:59 stack or vdso, and you usually don't have addresses into the vdso 10:34:17 kallisti, yes and? 10:34:27 kallisti, there is nothing much else up there 10:34:37 (well, the vdso is) 10:35:19 kallisti, your point was? 10:36:00 It's quite close to the top of the bottom half of the canonical-form 48-bit addresses. 10:36:18 that... this notion of stackiness is purely arbitrary because you just see 7ff a lot. Seeing another address with 7ff* does not tell you that it's "stacky" 10:36:22 kallisti, you tend to pick up this sort of vague feeling for what an address is when debugging C code. Like "hm, that address it crashed from accessing, looks like it is related to something on the stack" 10:36:42 !perl print map {[]} 1..10 10:36:43 ARRAY(0x7fc52154fd48)ARRAY(0x7fc52156da90)ARRAY(0x7fc52156dac0)ARRAY(0x7fc52156daf0)ARRAY(0x7fc52156db20)ARRAY(0x7fc52156db50)ARRAY(0x7fc52154fb98)ARRAY(0x7fc52156da00)ARRAY(0x7fc52156dc88)ARRAY(0x7fc52156dcb8) 10:36:52 they are mostly allocated on the stack I suspect 10:37:18 kallisti, or in a mmaped area up high 10:37:20 could happen 10:37:26 definitely not on the heap though 10:38:14 -!- oerjan has joined. 10:38:40 looking at perl here indicates it does mmap some anon mappings 10:38:44 could be one of those 10:38:51 7f07f9850000-7f07f9851000 rw-p 00000000 00:00 0 10:38:51 7fffc0302000-7fffc0323000 rw-p 00000000 00:00 0 [stack] 10:38:57 aanon mmappings 10:39:09 hm actually that one is there with cat too 10:39:13 so probably not that one 10:39:19 (I guess that is libc related) 10:39:34 (but then iirc glibc allocs huge chunks from mmap) 10:39:43 !perl $_ = []; s/ARRAY\((.*)\)/$1/; print eval; 10:39:44 140303706385736 10:40:07 Actually when I do that locally, the []s seem quite heap-allocated. 10:40:10 (doesn't explain why perl would allocate from the same mmaped page as something that is there in cat) 10:40:13 $ perl -e 'print map {[]} 1..10; print "\n";' 10:40:13 ARRAY(0x1492d48)ARRAY(0x14b0480)ARRAY(0x14b04b0)ARRAY(0x14b04e0)ARRAY(0x14b0510)ARRAY(0x14b9b88)ARRAY(0x1492b98)ARRAY(0x14b03d8)ARRAY(0x14b0408)ARRAY(0x14b9cd8) 10:40:22 fizzie, strange results with !perl then 10:40:32 but yeah those look heapish 10:41:06 look heapish for me too 10:41:16 fizzie, I guess it is possible plash does something weird? 10:41:26 not sure why it would create a different heap though 10:41:50 `run fgrep '[heap]' /proc/self/maps 10:41:53 00613000-00634000 rwxp 00000000 00:00 0 [heap] 10:41:58 doesn't seem so 10:42:25 !perl @x = ([],[]); @x = map {s/ARRAY\((.*)\)/$1/; eval}; print abs($x[0] - $x[1]); 10:42:25 syntax error at /tmp/input.2124 line 1, near "};" \ Execution of /tmp/input.2124 aborted due to compilation errors. 10:42:37 !perl @x = ([],[]); @x = map {s/ARRAY\((.*)\)/$1/; eval} @x; print abs($x[0] - $x[1]); 10:42:37 432 10:42:40 !perl @x = ([],[]); @x = map {s/ARRAY\((.*)\)/$1/; eval} @x; print abs($x[0] - $x[1]); 10:42:40 432 10:42:42 !perl system("cat /proc/$$/maps | grep heap"); 10:42:42 7f7526a10000-7f7526a50000 rw-p 00000000 00:00 0 [heap] 10:42:43 !perl @x = ([],[]); @x = map {s/ARRAY\((.*)\)/$1/; eval} @x; print abs($x[0] - $x[1]); 10:42:44 432 10:42:56 "!perl" is EgoBot, though. 10:43:05 And that's quite a high heap. 10:43:16 indeed 10:43:18 very strange 10:43:23 `run perl -e 'print []' 10:43:26 ARRAY(0x605d48) 10:43:33 NOT SO "STACKY" NOW EH? ASSHOLES. 10:43:36 :) 10:43:37 `run perl & fgrep '[heap]' /proc/$!/maps 10:43:41 006e2000-006f5000 rwxp 00000000 00:00 0 [heap] 10:43:53 I haven't really been following the sandboxings; at least HackEgo runs on that umlbox thing nowadays, not plash. 10:43:53 I thought egobot and hackego had very similar setups? 10:43:59 fizzie, oh okay 10:44:03 well that could change things 10:44:09 fizzie, why umlbox? 10:44:16 Why not? 10:44:26 and if that is user mode linux then I guess that changes stuff a lot 10:44:32 `run perl <<< '@x = ([],[]); @x = map {s/ARRAY\((.*)\)/$1/; eval} @x; print abs($x[0] - $x[1]);' 10:44:33 NIH syndrome, maybe. 10:44:36 109176 10:44:41 oh my. 10:44:43 fizzie, as for why not: why would you want to fix something that wasn't broken? 10:44:52 or was it broken in some way to use plash? 10:45:01 kallisti, ? 10:45:02 "Plash relies on a glibc patch, and is, as such, difficult to maintain and out of date. UMLBox relies only on UML (Usermode Linux), a component of the Linux kernel, and requires no patches to UML. Furthermore, UMLBox requires no special privileges to install or use." 10:45:08 (From the umlbox page.) 10:45:10 the address difference is much higher on hackego 10:45:12 than on egobot 10:45:13 ah 10:45:25 between repeated []'s 10:45:28 ah 10:46:32 fizzie, looks like gregor made umlbox? https://bitbucket.org/GregorR/umlbox/wiki/Home is the first hit for me 10:47:04 !perl print `perl -v` 10:47:05 ​\ This is perl, v5.10.1 (*) built for x86_64-linux-gnu-thread-multi \ \ Copyright 1987-2009, Larry Wall \ \ Perl may be copied only under the terms of either the Artistic License or the \ GNU General Public License, which may be found in the Perl 5 source kit. \ \ Complete documentation for Perl, including FAQ lists, should be found on \ this system using "man perl" or "perldoc perl". If you have access to the 10:47:16 hm same version 10:47:20 `run perl -v 10:47:23 ​\ This is perl, v5.10.1 (*) built for x86_64-linux-gnu-thread-multi \ (with 53 registered patches, see perl -V for more detail) \ \ Copyright 1987-2009, Larry Wall \ \ Perl may be copied only under the terms of either the Artistic License or the \ GNU General Public License, which may be found in the Perl 5 source kit. \ \ Complete documentation for Perl, including FAQ lists, should be found on \ this system using 10:47:27 Vorpal: Yes, that's why I speculated "NIH syndrome". 10:47:33 ah 10:48:18 # Plash supports X11 programs. UMLBox does not, as sockets do not translate host-to-guest with UML. <-- so there is no networking at all? Because X11 works fine over tcp 10:48:40 I thought uml had support for networking in general, so it should be possible to set up 10:48:40 !perl print v5.10 + v5.11 10:48:41 0 10:48:53 I suppose that just means "transparently supports". 10:49:36 hm 10:49:47 I feel like say would improve perl's golf scores, except that it currently requires a use v5.10 line. 10:49:51 actually it looks like umlbox has no network 10:50:04 !perl use v5.10; say "Hello, World!" 10:50:05 Hello, World! 10:50:37 why say 10:50:47 why is it any better than the traditional print? 10:50:51 !perl print "Hello, World!\n" 10:50:51 Hello, World! 10:50:56 ah 10:51:10 it's better for golfing, except for the above mentioned problem. 10:51:29 Vorpal: umlbox certainly can do networking. 10:51:34 really I don't know why it needs use v5.10. is it really going to break anything if you simply include it? 10:51:38 fizzie, hm 10:51:41 Vorpal: Er, sorry, I mean, UML can. 10:51:45 ah 10:51:46 Vorpal: umlbox probably doesn't. 10:51:58 right 10:52:01 Or maybe it does? There's that "fetch" thing. 10:52:07 I haven't looked at the implementation, really. 10:52:14 also: "-X is very limited as yet. It can only forward DISPLAY=:0.0, it forwards it to DISPLAY=127.0.0.1:0.0, and it doesn't set any of the required environment variables (of which at least DISPLAY and XAUTHORITY are necessities). It will be fixed in time :)" 10:52:20 so uh, it does kind of support x11? 10:52:25 yet it says further down it doesn't 10:52:29 Well, you know how it is with documentation. 10:52:33 true 10:53:17 anyway don't you need to enable UML in the kernel config for umlbox to work? 10:53:21 or is that always-on? 10:53:32 because if it isn't then it probably does require root to install 10:54:24 No. 10:54:29 It's "U" as in user-mode. 10:54:42 The host kernel runs it just like it would any random process. 10:55:00 fizzie, doesn't it need a bit of kernel support to do memory protection between processes? 10:55:01 iirc 10:55:15 I mean, processes in the same UML instance 10:55:49 Possibly there was some bit that you could do optionally. 10:56:08 fizzie, otherwise it wouldn't be secure, you could just write into the UML code itself 10:56:54 I assume it uses ptrace to catch system calls. Since anything else can easily be beaten 10:57:58 or I guess it could dynamically recompile code 10:58:42 ...or what you're saying means there is a way to hack it. 10:59:01 I think the internals have changed a couple of times; back when I used it, it certainly didn't use ptrace at least straightforwardly, since the whole UML kernel and everything running in it appeared as a single process in the host. 10:59:13 (And you can't trace yourself.) 10:59:36 oerjan, I mean that unless it gets some special support from the kernel or does full emulation like a more general vm (qemu, virtualbox and so on) there are going to be ways to hack it 11:00:02 yes, that's what i thought you meant. 11:00:24 (of course virtualbox and qemu generally gets kernel support, qemu doesn't actually need it though, but it runs much slower without) 11:00:43 Right; there was a "skas" patch for the host kernel. 11:00:52 I don't know if it got included in the mainline kernel tree or not. 11:01:02 From what I recall, it was reasonably non-intrusive. 11:01:16 seems it is integrated according to wikipedia 11:01:52 I wonder what system calls are exposed to do this 11:02:01 The "old mode" used the "each UML process is a host process, ptraced by the manager for syscalls" approach. 11:02:06 I would like to take a look at the interface and see if it can be used in some interesting way 11:02:37 fizzie, there is still the need to catch system calls also 11:03:14 I'd check the UML wiki but it's being unresponsive. :/ 11:04:57 I can't even find that wiki 11:05:20 http://user-mode-linux.sourceforge.net/ -> The UML Wiki. 11:05:32 hm indeed not responding 11:05:53 It will eventually give a 502 Proxy Error from uml.jfdi.org. 11:06:17 I see 11:07:54 fizzie, the old skas stuff seemed to use /proc/mm but that definitely doesn't exist these days 11:08:56 Most UML-related things seem quite obsoleted these days. 11:09:26 `ls /proc/mm 11:09:29 ls: cannot access /proc/mm: No such file or directory 11:09:42 It's all qemu-kvm or Xen or then the "containers"-style OpenVZ/vserver stuff now. 11:10:09 yeah 11:10:57 I wonder if anyone's using 'lguest' for some real-world thing, though. 11:11:06 which one is lguest? 11:11:09 as in, which style 11:12:00 It does that hypervisor/paravirtualization thing. It's very very very minimal; but it was included in the mainline kernel quite early, as far as these things go. 11:12:32 The only lguest-related tool I've seen is the Documentation/virtual/lguest/lguest.c example code. 11:12:43 heh 11:13:08 "2.6.23-git13 and above", apparently. 11:13:33 Apparently it might be a bit 32-bit-only. 11:14:33 It runs copies of the "host" kernel as guests, if I recall correctly. 11:18:47 -!- azaq23 has quit (Quit: Leaving.). 11:19:49 -!- azaq23 has joined. 11:20:20 wtf, steam got stuck in a loop of "loading game" dialogue popping up and closing 11:20:24 had to kill the process 11:21:07 I wonder what the "library" screen of Steam will look like if you win the "all the games" award. 11:21:09 -!- Effilry has joined. 11:21:14 fizzie, horrible? 11:21:38 fizzie, anyway I wonder what the chances are 11:22:32 An empty search in the store returns 4178 matches. 11:22:34 * oerjan swat Effilry -----### 11:22:36 *s 11:22:42 fizzie, btw I recently (yesterday) played portal 2. It was far better than the first one. I actually didn't give up halfway out of boredom this time. 11:22:47 Heh 11:22:52 I liked it. 11:23:00 Well, the single-player side, anyway. 11:23:01 THERE IS NO USE TRYING TO HIDE 11:23:02 fizzie, I think the boss fight was terrible though 11:23:24 Also Cave Johnson is one crazy man. 11:23:28 well yes 11:23:31 -!- Effilry has changed nick to FireFly. 11:23:37 -!- FireFly has quit (Changing host). 11:23:38 -!- FireFly has joined. 11:24:22 fizzie, anyway I found myself thinking "Trine 2 is a way better puzzle game" several times. 11:24:47 not when it comes to the story, trine 2 has a rather weak story, but the gameplay is way better in trine and trine 2 11:26:07 For some reason I couldn't quite get myself interested about the first Trine. 11:26:10 "All right, I've been thinking. When life gives you lemons, don't make lemonade. Make life take the lemons back! Get mad! I don't want your damn lemons! What am I supposed to do with these?! Demand to see life's manager! Make life rue the day it thought it could give Cave Johnson lemons! Do you know who I am? I'm the man who's gonna burn your house down! With the lemons! I'm gonna get my engineers to invent a combustible lemon that burns your house down 11:26:10 !" 11:27:03 fizzie, also I don't really like the difficulty in portal 2, I mean it is difficult for the wrong reasons. Usually it is hard because there is some white wall up high near the badly lit ceiling that I didn't spot that I had to check a walkthrough 11:27:12 the actual puzzles once you locate all the components are not hard 11:27:59 I don't recall very much of that, though I might just have forgotten. Hard it's not, that much is true. 11:28:02 there was just one puzzle in trine 2 where I had that issue. The other I had to think about were just mechanically challenging 11:28:56 usually platforming issues as well 11:30:35 there is an ice slope that you need to get up in a late trine 2 level, it wasn't hard to figure out how: attach a grappable (sp?) object to spiky swinging ball overhead then grapple it as the thief and wait for max swing both of the spiky ball and yourself before you release 11:30:43 executing it was kind of hard though 11:31:04 fizzie, not sure if you noticed that in trine 2 (if you played it?) 11:31:24 Not yet. 11:31:27 ah 11:31:47 meh, just handcuff it to a vending machine 11:31:53 ais523, what? 11:32:03 Vorpal: infamous bug in Scribblenauts 11:32:08 eh? 11:32:11 pretty much all the action levels can be bypassed by doing that 11:32:13 what happened when you did that 11:32:20 the item ends up inside the vending machine 11:32:24 then you can just vend it out 11:32:26 heh 11:32:33 how strange 11:32:33 and skip whatever puzzle you'd normally need to do to get the item 11:33:03 why would handcuffing an item do that 11:33:04 Oh for... because of a missing "Unknown Plugin (text/html)" this Java "personnel records" mess-plication apparently can't run. 11:33:14 -!- Frooxius has joined. 11:33:18 fizzie, lol 11:33:30 hellooo 11:33:35 hi, I guess 11:33:36 `welcome Frooxius 11:33:39 Frooxius: 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 11:33:51 I'm guessing because I can never remember who's been here before and who hasn't 11:33:55 well, sometimes I can 11:33:59 I think Vorpal's been here a while 11:34:02 XD 11:34:07 It's first time I'm here 11:34:18 ais523, and that guy "elliott" he isn't new either, right? ;P 11:34:34 you know, it'd be massively out of character here for me to not do `? welcome even though you've already been welcomed, and with a more modern syntax at that 11:34:36 meh 11:34:37 `? welcome 11:34:41 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 11:34:51 ais523, modern syntax? 11:34:53 what 11:34:59 the `? syntax came first 11:35:08 so a less modern one then? 11:35:12 `type welcome 11:35:15 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: type: not found 11:35:17 `run type welcome 11:35:21 welcome is /hackenv/bin/welcome 11:35:26 now how _vorpal_ remembers who is new when he cannot notice anything else, i don't know. 11:35:29 `url bin/welcome 11:35:33 http://codu.org/projects/hackbot/fshg/index.cgi/raw-file/tip/bin/welcome 11:35:42 Vorpal: DOS "type" = UNIX "cat" 11:35:50 ais523, I was looking for bash type 11:36:07 also that is a terribly complicated piece of code 11:36:13 if (defined($_=shift)) { s/ +/ @ /g; exec "bin/@", $_ . " ? welcome"; } else { exec "bin/?", "welcome"; } 11:36:14 why 11:36:19 * oerjan swats Vorpal -----### 11:36:23 oerjan, ? 11:36:28 oerjan, what 11:36:35 Vorpal: so it can take any number of nicks, including none 11:36:39 ah 11:36:41 * oerjan wrote that :P 11:36:57 oerjan, right. I don't really know perl 11:37:31 of course some of the complication is because it uses @ and ? as subprocesses 11:37:34 -!- nooga has joined. 11:38:05 now I'm trying to work out if @{" "} can be written as @ (that is, @ then space) 11:38:11 ais523, I don't really use DOS commands, nor have I really ever used them more than a handful of times, so chances are I didn't type a DOS command by mistake 11:39:26 well, Windows commands are based on them 11:39:27 ais523, btw did you ever consider making wol use UML? 11:39:35 it might end up less insane 11:39:57 I choose to misinterpret that as Unified Modelling Language 11:39:57 it seems EgoBot (but not hackego) switched to some home made umlbox that Gregor wrote 11:40:03 ais523, user mode linux :P 11:40:04 just because that makes absolutely anything more insane 11:40:05 oh cool, it's pretty active here. I was looking for some places about esoteric languages and the others I found so far seemed quite dead 11:40:10 and ISTR there's some reason user mode language wouldn't work 11:40:17 Frooxius: the wiki is alive, but mostly with spambots 11:40:23 it's probably the only other active esolang place, though 11:40:35 Unified Modelling Linux. 11:40:39 Frooxius, only problem is that many of us tend to easily go off on unrelated tangents :P 11:40:48 (a lot of off topic stuff in other words) 11:40:56 (usually interesting though) 11:41:03 Yeah, that seems to happen everywhere :D 11:41:10 and ISTR there's some reason user mode language wouldn't work <-- user mode language? 11:41:20 spambots? Are they creating bogus pages or what? 11:41:22 Vorpal: meh, just assume I'm drunk 11:41:26 Frooxius: they're spamming 11:41:29 it's not very surprising that people don't solely about a very narrow topic all the time 11:41:32 for years. 11:41:32 it's what spambots typically do 11:41:33 ais523, I just can't imagine you /ever/ being drunk 11:41:38 Vorpal: I'm not 11:41:38 ais523, it just doesn't fit into my head 11:41:42 s/don't/don't talk/ 11:41:52 ais523, have you ever been drunk? 11:41:52 but assuming it tends to simplify things, it's easier than trying to explain 11:41:56 I don't think so 11:41:59 right 11:42:05 yeah, I meant more in what specific form the spamming takes, like if it's in the discussions or making wiki pages 11:42:09 I used to drink alcohol slightly, but realised I didn't like it 11:42:12 Frooxius: mostly page creation 11:42:16 ah 11:42:16 occasionally page replacement 11:43:36 kallisti, good point 11:43:58 I was looking for a place where I can show my language, though I made more, but they share one common idea, though they're a bit different. Can I make multiple pages for each or merge them into one big page? 11:44:31 -!- copumpkin has quit (Ping timeout: 248 seconds). 11:44:33 multiple pages is probably simplest 11:44:34 ais523, btw which java IDE would you recommend? I'm probably not going to use it more than a few times. Just need something 11:44:40 -!- copumpkin has joined. 11:44:44 ok 11:44:48 thanks 11:44:54 Vorpal: I've only seen NetBeans and Eclipse; NetBeans is better, although I strongly recommend you get someone else to package it 11:45:06 hm? 11:45:14 ^ul ((spam )(SPAM ))(~:^Sa~^*a*~:^):^ 11:45:14 SPAM spam SPAM spam spam SPAM spam spam spam SPAM spam spam spam spam SPAM spam spam spam spam spam SPAM spam spam spam spam spam spam SPAM spam spam spam spam spam spam spam SPAM spam spam spam spam spam spam spam spam SPAM spam spam spam spam spam spam spam spam spam SPAM spam spam spam spam spam spam spam spam spam spam ...too much output! 11:45:14 ais523, like using my distro to install it? 11:45:16 or what 11:45:22 Vorpal: yes, like that 11:45:31 ais523, what if I need it on windows? 11:45:40 I might actually need it on windows 11:45:48 so it isn't just a theoretical question 11:45:54 I haven't tried it on Windows myself, but I've heard that the installer is slightly insane 11:45:59 I see 11:46:34 ais523, as long as it doesn't use ant to build I'm happy. 11:47:08 I'm not actually sure what it uses to build, it abstracts that away from the user 11:47:15 right 11:47:23 fungot: It's all right to say "too much spam!" in cases like the above. 11:47:24 fizzie: ouluthy atoll. on/ whole, as far as it went,/ sterility occurs in various degrees; in both, are much convoluted; but this is an important element in/ sterility :) many foreign plants; thus,/ flat or ventral surface faces/ axis or stem; but/ footstalks must have some natural origin. a wild scheme. 11:47:25 also it is sponsored by oracle it seems. Hrrm. 11:47:34 ^style 11:47:34 Available: agora alice c64 ct darwin* discworld europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack pa qwantz sms speeches ss wp youtube 11:47:37 ah 11:47:57 fizzie, what was the story behind the smilies now again? 11:48:13 Frooxius, btw that irc bot is written in befunge-98 (an esolang) 11:48:52 ^style iwcs 11:48:53 Selected style: iwcs (Irregular Webcomic scripts) 11:48:54 Oh cool :D That's ultimate esoterism! x3 11:48:58 ^source 11:48:58 http://git.zem.fi/fungot/blob/HEAD:/fungot.b98 11:48:59 there 11:49:01 fungot, hm? 11:49:02 Vorpal: no, the boy, do i? are you sure the technology! 11:49:10 fungot, doesn't sound like iwc to me yet 11:49:10 Vorpal: the new king, you are dedicating yourself, does the allosaurus have a policy on death? i can just walk through the door to the secret dwarven passage, all the classics. dickens, austen, melville, wilde, hemingway. and of course jonson had never happened, quite frankly, from the sound of a hundred. in aramaic 11:49:16 well now it does 11:49:38 fizzie, does that model include the annotations? 11:49:54 Befunge is 2D language right? One that I'm working on is 2D as well, though works somewhat differently 11:49:59 yes it is 11:50:07 Frooxius, that is befunge-98, not befunge-93 11:50:22 hmm, sorry, I don't really know much about specific versions 11:50:30 befunge-98 is much extended compared to the 93 version 11:50:38 What, again? Okay, fungot's token-to-text code has a hardcoded list of punctuation for the first N (12 or so) tokens, same as the Perl script for training the models; unfortunately, the "remove tokens used less than K times" pruning phrase applied to those too, removing the smileys which Darwin did not use, causing the two most common non-punctuation tokens ("the", "of") get the integer indices of the two last punctuation tokens (":)", "/"). 11:50:38 fizzie: what, the ability to be captured a spanish galleon! arrr!! the frame is engulfed the galactic cup! they've all been targeted! 11:50:52 Frooxius: -98 and -93 are reasonably radically different 11:50:55 Also there's some other punctuation mismatch going on, but that happens more rarely. 11:51:02 fizzie, ah 11:51:15 ais523, indeed 11:51:16 And no, it's just scripts; that's why it says "scripts" in the name. 11:51:19 right 11:51:37 There was an "iwca" set too, but it didn't work quite as well. 11:51:43 I can imagine 11:51:47 hmm, does the Befunge 98 have its own page on the wiki though? 11:52:04 Nevermind, found its homepage 11:52:08 right 11:52:11 it's probably sorted under funge-98 11:52:16 but it's a catseye language 11:52:27 and we tend to just link to catseye for those, rather than try to repeat the whole thing ourselves 11:52:51 cpressey writes pretty good descriptions, and unlike most people, puts them on his own website rather than the wiki 11:53:01 Frooxius, if you plan to try to implement it speak with us first. The spec is terribly unclear and the behaviour of t is broken. So what people do is use Deewiant's test suite as a reference. 11:53:43 No I mean, I'm implementing my own language 11:53:53 well sure, but just as a warning :P 11:53:55 Which is also 2D one 11:54:06 oh okay 11:54:08 Frooxius, funge-98 actually comes in 1D, 2D and 3D variants 11:54:33 yeah, I'm reading its page now, it said something about generalization 11:54:37 just the spec contradict itself once, is broken in another place and is terribly unclear in several places. 11:55:07 Frooxius, I believe fungot here runs on my befunge-98 implementation unless fizzie switched over 11:55:07 Vorpal: sorry, i don't know what they're up! 11:55:28 It's still cfunge. 11:55:30 right 11:55:36 Cool :3 11:55:44 Though probably quite an old version. 11:55:46 fizzie, I guess you wouldn't actually gain that much from using ccbi2. 11:56:20 fizzie, I recommend people to compile it with clang these days. There are some unresolved issues with gcc >4.5 and -O3 11:56:30 It's not exactly computationally intensive, discounting people's ^bf/^ul stuff. 11:56:33 * kallisti should write an implementation for an esolang. 11:56:42 from what I can tell it miscompiles, but picking out the relevant functions compiles it correctly 11:56:53 ^bf +[]! I like to loop it, loop it. 11:56:56 kallisti, and I should write an esolang. I only ever implemented them 11:56:58 ...out of time! 11:57:09 That's 100k cycles, IIRC. 11:57:25 Vorpal: it could be worse. You could only design incredibly shitty esolangs. like me. :P 11:57:32 heh 11:57:33 all of my good ideas never finish. 11:57:40 why? 11:58:03 * kallisti is not a very disciplined individual. 11:58:11 fizzie, anyway once tup gets support for variants I'm going to ditch cmake and go for autoconf + tup 11:58:17 so just getting myself to finish all of the important things is difficult enough. :P 11:58:20 but I'm working on that. 11:58:54 fizzie, which should provide some benefits, such as less broken handling of non-C files. 11:59:13 I mean, that is one thing cmakes does get right: dependencies for C-files. 12:00:10 my two language ideas involve an improvement to standard regex to make it turing complete (I wouldn't call it too esoteric as it's pretty normal) 12:00:25 kallisti, you know PCRE is turing complete for example? 12:00:54 the second idea is a sort of mix between graph rewriting and constraint/logic programming, with reversible semantics (basically it never deletes anything (unless I can come up with a sensible garbage collector but I doubt it)) 12:01:02 Vorpal: oh, well yes. 12:01:07 I mean to make it more general purpose, rather. 12:01:11 hm 12:01:42 Vorpal: tup still doesn't have variants? Dang. 12:01:43 kallisti, perl's regex are very general purpose, they permit embedding perl code to be executed at various points during the matching 12:01:59 Deewiant, well, I last checked like right before xmas. It /might/ have it now 12:02:06 kallisti: it reminds me of one reversible computing architecture i read about; it came with an actual physical bit bucket for when you really wanted to delete something :) 12:02:43 Deewiant, but yeah what with all the build variants of cfunge that is what is holding me back from using it 12:02:54 Vorpal: I last checked a couple of months ago and thought it was on the top of the todo list :-P 12:03:11 right 12:03:18 I thought it was a bit down on the list 12:03:19 since theoretically irreversibility is equivalent to heat production (landauer's principle) you'd want that to be physically expelled, i think 12:03:20 Vorpal: I am aware of all the different kinds of regex and what they can do. 12:03:20 hm 12:03:29 kallisti, /all/ of them? ;P 12:03:38 He knows all the regex. All of them. 12:03:39 well... I'm a little poorly versed in POSIX regex 12:03:45 mainly because I hate it. 12:03:47 kallisti, what about .NET regex? 12:04:05 I've used it? does that count? 12:04:09 sure 12:04:14 kallisti, the java ones? 12:04:19 haven't used those no. 12:04:20 POSIX regex come in BREs and EREs, is what you need to know. 12:04:27 and you use ERE 12:04:32 because BRE are annoying 12:04:48 fizzie, doesn't plain grep use BRE iirc? 12:04:50 is BRE where you backslash everything? 12:05:00 (what emacs uses) 12:05:02 because I hate that. 12:05:03 kallisti, egrep is ERE 12:05:06 right. 12:05:07 Vorpal: It does, yes. 12:05:12 and I think emacs might use something else 12:05:13 not sure 12:05:30 emacs basically reverses the semantics of backslashes. 12:05:36 huh 12:05:37 Emacs is not strictly POSIX, IIRC. But it does involve a lot of backslashing. 12:05:41 Much like BREs. 12:05:44 right 12:06:03 fizzie, also sed uses BRE right? 12:06:18 ^bf >,[.>,]<[[<]>[.>]<]!I like to loop it, loop it. 12:06:18 I like to loop it, loop it. I like to loop it, loop it. I like to loop it, loop it. I like to loop it, loop it. I like to loop it, loop it. I like to loop it, loop it. I like to loop it, loop it. I like to l ... 12:06:21 which is why you do like s/aa*/... rather than s/a+/... 12:06:33 vim has four forms: 'nomagic', 'magic', 'very magic', and 'very nomagic'. 12:06:37 lol 12:06:40 Deewiant, hah 12:06:43 Deewiant, what do they mean? 12:07:02 Hmm... I'm a bit confused about the page creation though. My languages are designed for their own, also somewhat esoteric processing units (there's an emulator - virtual machine and also FPGA soft-core implementation, though not published yet, but it will be later). Should I make a page named after the processing unit or the language? Or maybe both, like "Unit - Language"? 12:07:13 oerjan: yes I was considering having a way to basically delete nodes so that you can manage memory. 12:07:18 'magic' is the default and is quite similar to BRE, I think. 12:07:22 Frooxius, verilog or vhdl? 12:07:28 VHDL 12:07:31 hm 12:07:35 I might be able to read it then 12:07:38 and that is cool 12:07:44 (that you implemented that) 12:08:04 'nomagic' seems to change only . and *, so that they need to be escaped if you want their special behaviour. 12:08:09 also that question is best to ask ais523 12:08:39 Deewiant, heh, and the very variants? 12:08:45 Frooxius: page should be named after the language 12:08:58 oh ok, thanks 12:08:59 I'm not sure to what extent it's going to be full graph rewriting. i.e. I don't want rewriting large subgraphs to be the main means of computation since that's really inefficient. 12:09:02 if the language has only one specific purpose, explain what it is on the page 12:09:12 'very magic' is like ERE, I guess: every character with a special behaviour uses it by default, and you need to escape it to match the literal character. 12:09:15 -!- Phantom_Hoover has joined. 12:09:28 Deewiant, and very nomagic? 12:09:35 And 'very nomagic' is the converse: only backslash has a special behaviour. 12:09:36 The language is tied a lot though to the processing unit architecture 12:09:48 hm 12:09:56 but I can't really see this language being efficient at all, considering how it works. 12:09:59 Yeah, I want it to run in hardware. Yesterday, I was simulating 128 cores on my laptop. It ran 30 kHz (simulated) x3 12:10:04 Frooxius, are there several languages for the same processing unit? 12:10:12 Not yet 12:10:15 hm 12:10:36 also 128 cores, is it some sort of massively parallel esolang? 12:10:41 I can't remember seeing any of those before 12:10:46 essentially it works something like this: constraint | pattern -> rewrite 12:10:54 or wait, wasn't there one that ais523 claimed would be good on GPUs? 12:11:27 Yeah, it can automatically distributes the work on several cores, though it depends on the algorithm and how many cores are available 12:11:29 Checkout's basically eso by virtue of being too low-level 12:11:29 each computation step produces a copied state of the graph, which each new node pointing to its predecessor(s) via a "past edge", which makes it possible to revert past edges. 12:11:37 s/which/with. 12:11:41 it's not really an esolang designed for GPUs, more a description of how GPUs worked converted to esolang form 12:11:45 s/\./\// 12:11:58 ais523, do they still work that way? 12:12:09 I assume so 12:12:12 unless it's changed in the last year 12:12:20 which is possible, I guess, but seems moderately unlikely 12:12:30 I made huge block of instructions and then ran simulation just for fun on 128 cores |3 12:12:48 * kallisti thinks he's probably going to implement the graph lang in Haskell because why not. 12:13:22 ais523, hm I'm missing an FMA instruction. I think most GPUs have them 12:13:43 But I made some tests and if I make a simple algorithm, that's about 20 instructions and run it with one core, it takes 40 cycles to complete with one core and only 12 cycles with four cores. 12:13:50 Of course, while producing same result 12:13:54 ais523, but yes, it matches what I know about GPUs pretty much 12:14:03 though I'm not sure about the selection of instructions 12:14:12 selection of instructions was mostly a guess 12:14:54 ais523, and you don't seem to represent there being some hard coded functionality still left. Like dedicated linear interpolation circuitry or texture lookup units 12:15:10 It supports parallelism, but it's not so massive parallel like GPUs are 12:15:24 Vorpal: yes, it doesn't allow for hardcoded highlevel stuff 12:15:26 it's very low-level 12:15:32 it /does/ allow for texture lookup; that's what rocopy is for 12:15:34 * kallisti is also going to BREAK THE MINDS OF ALL PROGRAMMERS EVER by making & and | the boolean logical operators because this makes way more sense than && and || 12:15:35 Frooxius, I look forward to seeing this language 12:15:38 ais523, ah. 12:15:59 ais523, with texture interpolation? 12:16:02 no 12:16:11 hm that is like the key feature of textures to me 12:16:19 -!- oerjan has quit (Quit: leaving). 12:16:37 ais523, I haven't used OpenCL so for all I know it might match that 12:16:40 I mostly used GLSL 12:19:18 -!- monqy has quit (Quit: hello). 12:19:46 ais523, is abstain/1 like in intercal? 12:21:21 it's more like computed abstain forced at 1, then regular abstain 12:21:24 and still more like an if statement 12:21:28 hm 12:21:32 it's basically the same as an if except for timing 12:22:23 ais523, iirc real GPUs tend to execute the same code on all processing elements in a given core, just throw away any results that wasn't actually taken by the given processing eleme nt 12:22:26 element* 12:22:47 Vorpal: indeed 12:22:51 that's what I'm getting at with abstain 12:22:55 right 12:23:02 the code has to be executed, it's just that it can ignore what it does 12:23:09 indeed 12:23:44 ais523, where do you handle that for loops? I do believe GLSL allows different loops to take a different number of iterations 12:23:58 err that is 12:24:05 -!- Frooxius has quit (Ping timeout: 240 seconds). 12:24:05 the same loop on different processing elements 12:24:14 I guess you just abstain the last few times 12:24:18 Vorpal: it'd have to cap it to the maximum number of iterations 12:24:28 well yeah 12:24:39 however, all sane GPU programming would make a loop have the same number of iterations for the entire weave 12:24:50 well yes 12:24:57 ais523, not sure what you mean by weave here 12:25:12 Vorpal: it's a technical GPU term 12:25:16 as is half-weave 12:25:21 what does it mean though? 12:25:27 basically, a half-weave is the number of actual commands that run simultaneously on one processing element 12:25:30 ah 12:25:37 and a weave is the number of commands that /effectively/ run simultaneously 12:25:40 right 12:25:44 because there's a 1-cycle pipelining delay 12:26:21 actually I could do something TOTALLY CRAZY 12:26:33 so the rule is that weaves give you perfect simultaneity, and that you need to synchronize things like memory accesses within a half-weave to get the best results 12:26:39 and make v and ^ for logical conjunction/disjunction 12:26:42 ais523, hm 12:26:55 ais523, but these details seems to be hidden from you when you are writing GLSL? 12:26:55 kallisti: nah, use Unicode 12:27:00 Vorpal: right, indeed 12:27:04 GLSL is rather higher level than OpenCL 12:27:06 but I can't type Unicode quickly. :P 12:27:10 ais523, ah. 12:27:18 I guess I want to avoid opencl then? 12:27:28 because that stuff sounds annoying 12:27:55 ais523, I just noticed "avoid if when at all possible" seemed to work pretty well for glsl 12:28:13 Vorpal: well, it depends on what you're writing the code /for/ 12:28:22 if you want to write vertex and fragment shaders, glsl is a pretty good choice 12:28:29 ais523, also does anyone actually use the geometry shader? 12:28:35 it doesn't seem to perform well at all 12:28:42 I think using Haskell's list monad will make the logic programming stuff much easier. 12:28:52 if you want to write bitcoin mining code, you're probably better off with opencl 12:28:58 ais523, right 12:28:58 Vorpal: I'm not sure; they're a comparatively new thing 12:29:08 and I'm not entirely up-to-date on what they actually do 12:29:37 ais523, and if you want to use the GPU to accelerate image manipulation? I know hugin uses GLSL for it, but is it actually the best choice? 12:30:03 but I can't type Unicode quickly. :P <-- I can. Try M-x set-input-method RET TeX RET 12:30:11 it is awesome 12:30:29 what if I don't know TeX though? :P 12:30:29 Vorpal: hmm, I'm not sure 12:30:35 possibly depends on what manipulation you're doing 12:30:36 kallisti, you need to learn it 12:30:53 main advantage of something like opencl is that you could make sure that memory was being loaded in an optimal way 12:30:54 ais523, well in the case of hugin, mapping flat images into whatever shape it needs to be for merging in a panorama 12:30:59 it doesn't use it for the actual merging 12:31:05 just the bending of the input images 12:31:22 I guess you might want to use the texture units there 12:31:36 to get interpolation when there wasn't a 1:1 map for the pixels (the usual case) 12:31:50 can you access the texture units from opencl? 12:33:56 sure, it's called "constant memory" 12:34:12 ais523, but can you get the interpolation then? 12:34:34 not sure; my guess is it'd involve a nonstandard but nonetheless common extension 12:34:38 heh 12:37:51 ah okay, now I see why they say Haskell's type system is like a mini-Prolog. 12:39:31 -!- derdon has joined. 12:40:05 -!- sebbu2 has joined. 12:40:05 -!- sebbu2 has quit (Changing host). 12:40:05 -!- sebbu2 has joined. 12:41:14 -!- sebbu has quit (Ping timeout: 240 seconds). 12:41:49 -!- sebbu2 has changed nick to sebbu. 12:45:39 ais523, btw does opencl have built in noise functions? 12:45:52 ais523, glsl does but most GPUs just return 0 on them 12:45:57 it doesn't have too much built in stuff 12:45:58 which makes them effectively useless 12:46:13 it's one of those languages which is bare-bones and expects people to write libraries for it 12:46:39 and with most I mean all but one card series which I believe is nowdays discontinued 12:46:51 (some 3dfx thingy iirc) 12:48:29 http://en.wikipedia.org/wiki/Logical_consequence 12:48:31 I don't really see 12:48:48 what makes this different from implication over the conjunction of every element in the set... 12:49:38 ais523, GLSL kind of reminds me of NQC. NQC is a C-like language for the Lego Mindstorms standard firmware. It had lots of useful domain-specific functions and not much else. 12:49:41 like why does it get its own name, basically. 12:54:03 > let entails :: [Bool] -> Bool -> Bool; entails ss s = not (and ss && not s) in entails [2 < 4, 2 > 0] (2 == 3) 12:54:04 False 12:56:13 > let entails :: [Bool] -> Bool -> Bool; entails ss s = not (and ss) || s in entails [2 < 4, 2 > 0] (2 == 2) 12:56:14 True 12:56:16 much better 12:57:45 De Morgan's laws to the rescue. 12:58:15 wow what a strange texture format: floating point, 9 bits of precision, shared exponent. GL_RGB9_E5 12:58:27 so 5 bits of exponent I think? 12:58:45 three 9s are 27, plus 5 is 32 12:58:48 yes 12:58:51 so it packs neatly 12:58:54 ais523, still it is a pretty strange format 12:59:43 there is also GL_R11F_G11F_B10F 12:59:48 those floats lack sign bits 12:59:56 and the blue one has less precision 12:59:57 why 13:00:14 So that it'd sum up to 32. 13:00:28 And why would you need negative numbers in a texture? 13:00:39 true 13:00:55 fizzie, still it is a strange format with less precision in blue 13:01:08 Vorpal: there are a bunch of asymmetrical pixel formats like that 13:01:13 indeed 13:01:14 there's quite a common 556 one, for instance 13:01:21 hm 13:01:21 I think it's based on what the eyes are best at distinguishing 13:01:28 I thought that was 5-6-5 with 6 on green, most commonly. 13:01:41 not in opengl as far as I can find 13:01:52 fizzie: I'm not sure what order it's in, but 6 on green is entirely believable 13:01:58 there is 3-3-2 (integer) for example 13:02:14 normalized integer even 13:02:16 what on earth would a 2-bit float be like anyway? 13:02:18 not sure what that is 13:02:39 or even sillier, a 1-bit float 13:02:45 heh 13:04:44 The old OpenGL glTexImage2D man page I have here lists GL_UNSIGNED_SHORT_5_6_5 for the external format. 13:05:13 -!- Frooxius has joined. 13:05:36 Also the 4_4_4_4 all-four-bit RGBA, and the 5551 "I guess we can spare a single bit for an alpha channel" formats. 13:05:41 And the 10_10_10_2. 13:06:09 I was mostly looking at floating point formats 13:06:29 but sure I can find all of those apart from 565 13:06:57 fizzie: does 5551 have 128 shades of colour, and 128 shades of transparent? 13:07:01 that seems a little weird 13:07:27 or, hmm, you could define transparent white as actual transparent 13:07:27 just two shades of transparent? 13:07:38 and have a fixed arbitrary value for the alpha as the other value 13:07:51 ais523: 128? 5+5+5 is 15 bits. 13:07:54 Frooxius: it's not Either Transparent (Word5,Word5,Word5) 13:08:01 it's (Word5,Word5,Word5,Boolean) 13:08:03 fizzie: err, right 13:08:09 32768 13:08:58 Vorpal: Your list is probably for the internal color formats, which might not have a 565 one. 13:09:27 fizzie, it probably is, I'm looking on the opengl wiki 13:09:32 wrt texture formats 13:09:39 image formats even 13:09:53 hm why does Prolog only allow horn clauses.. 13:10:01 ais523: what? I know three word5 and a boolean but what does the boolean mean? You use the first three to store the color and boolean to determine two levels of transparency? 13:10:19 it's 5 + 5 + 5 + 1, right? 13:10:21 1 bit is a boolean 13:10:35 my point is that once you've set the alpha channel to transparent, you still have 15 bits of color 13:10:43 kallisti, iirc they are easy to compute? 13:10:50 lame 13:10:53 that you're just wasting, because different shades of totally transparent are visually indistinguishable 13:10:56 Yeah, but why have 15 bits of color? 13:11:06 kallisti, like always possible to find an answer to 13:11:07 Frooxius: so if it's not transparent, then you can have colors 13:11:15 kallisti, unlike some other forms 13:11:15 Yeah, that's what's bothering me as well 13:11:18 we have 32769 useful possibilities out of 65536 here 13:11:18 but that is all iirc 13:11:22 ais523: Retaining color values even in fully transparent regions might still make sense; it's not like it's rendered as-is always. 13:11:27 I was suggesting that perhaps the format should do something with the other 32767 13:11:32 If the bit means that it's completely transparent then the color doesn't matter that much 13:11:40 fizzie: oh, indeed, and many graphics packages have an option to do just that 13:12:11 ais523, well you might want to use it for something else. It is not like the pipeline is fixed 13:12:38 What about to store first some bitmap (literally map of booleans) that determine transparency and then store ONLY visible pixels, that is ,the transparent ones will be skipped. If you want to save space 13:12:39 well, if you're using it for something else, why are you putting an RGBA meaning on it anyway? 13:12:49 Frooxius: that'd be hell on a GPU's memory model 13:12:55 that's a compression format, not an in-memory graphics format 13:13:09 Oh, sorry, I didn't know you were talking about in-memory 13:13:25 I kind of popped in the middle of discussion x3 13:13:40 They have those weirdo in-memory compressed texture formats too. 13:13:56 S3TC and whatever. 13:13:59 yeah 13:14:35 Yeah, though the one I mentioned can't be easily accessed, in order to find a pixel by its x and y position, you would have to scan the bit-alpha map first 13:14:36 well, if you're using it for something else, why are you putting an RGBA meaning on it anyway? <-- because that isn't what you do, those are just names assigned to the specific channels 13:14:47 ais523, you could just call them xyzw or 0123 13:15:59 ais523, I used textures for other stuff than images. Like a height map that I then used in the geometry shader. 13:16:13 Vorpal: well, indeed, that's the point 13:16:26 I'm just not convinced that splitting into 5+5+5+1 format is useful for nonimages 13:16:27 Hmm... though I understand the feeling. I was designing an opcode and I needed to encode 5 directions, but I had to use 3 bits for that and I still have 3 variations undefined... and it keeps bothering me and I keep thinking of how can I use them |3 13:16:27 ais523, it ended up in the red channel 13:16:37 hm 13:17:15 Frooxius, just draw a whatever-those-diagrams were called. 13:17:23 when you calculate the gates by hand 13:17:29 Karnagaugh maps? 13:17:31 or something like that 13:17:32 ah yeah 13:17:34 those 13:17:39 I think my esolang will work with any kind of boolean statement since there's no logical implication involved (i.e. nothing like Prolog's :- ) 13:17:40 But that's something different. 13:17:44 ais523: Well, you *do* get a RGB555 image plus a mask bitmap in the same "thing". You could use it for the "can fly through" mask for a cave-flying game. 13:17:58 Frooxius, well you could work out what sort of opcode encoding would give you the least number of gates :D 13:18:00 red/green/blue/collidable? I suppose that makes sense 13:18:08 I'm talking about assigning the bits meanings 13:18:12 I was thinking about that myself, and decided that collidable often needs more than one bit 13:18:22 how so? 13:18:26 the implications are state transitions, rather than logical statements. 13:18:52 well the variations, if I have 3 bits, to store 5 states and other 3 are undefined 13:18:56 Frooxius, indeed, but I mean you should check which assignment of the bits give the simplest logic 13:19:17 Vorpal: to determine what happens on collision 13:19:19 I think at least one cave-flyer had a strictly black-and-white mask bitmap, albeit stored in a separate file. (Though some I recall having more complicated formats, for things that can explode/be set on fire/whatever.) 13:19:24 ais523, game over :P 13:19:26 the logic is simple, I mean, decoding it 13:19:52 There's a simple straightforward way 13:19:54 Vorpal: well, I'm used to games with collisions having multiple sorts of collisions 13:19:58 Frooxius, come on, if you ever want to implement it in TTL logic and wire wrapping you could save yourself a lot of work by making the logic required simple :P 13:20:04 -!- mr_schlauch has quit (Ping timeout: 252 seconds). 13:20:07 e.g. in platformers, often you take damage hitting enemies from the sides, but not from above 13:20:30 I'm implementing it on FPGA 13:20:33 ais523, not sure you would store that in the image format anyway 13:20:44 Frooxius, well sure, but what if you want to do it old school in the future? 13:20:52 ais523: The RGB10_A2 format gives you four types. 13:21:07 Well I already saved myself a lot of work 13:21:10 heh 13:21:30 because the way it's designed, I can use exactly same decoding on these 5 states as with another form of encoding, which uses 30 variations 13:21:43 Vorpal: also, you just use two layers of n-input NANDs 13:21:48 and I can use same logic to decode both. 13:21:58 to efficiently implement any truth table with TTL logic and wire-wrapping 13:22:03 hm 13:22:07 efficiently in terms of time 13:22:20 can be inefficient in terms of logic size in some cases 13:22:36 There's not much of a truth table, it basically corresponds to numeric base 5 13:22:50 ais523, if you have like 4 in-signals and you can arrange the values so that they are groupable in a kaurnaugh diagram you save yourself some wires 13:23:01 as well as gates 13:23:13 if the problem's small enough to K-map it 13:23:21 then you're probably not going to run out of gates anyway 13:23:26 true 13:23:36 I dunno if I would do it old school way though. It would be too large anyway 13:23:39 Who is this Frooxius person? 13:23:41 Heh, that S3TC/DXT1 format is the fanciest. Each 4x4 pixel block is stored as two RGB565 (there's the 565 again...) color values, color0 and color1, followed by a 32-bit integer holding two bits per pixel in the block; each pixel is either color0 (bits 00), color1 (bits 01), (2*color0+color1)/3 (bits 10, color0 > color1), (color0+color1)/2 (bits 10, color0 <= color1), (color0 + 2*color1)/3 (bits 11, color0 > color1) or black (bits 11, color0 <= color1). 13:23:54 ais523, but even for larger problems you could still save some gates. 13:24:03 even though it might be more work figuring out how 13:24:31 Also it's Karnaugh, not "Karnagaugh" or "kaurnaugh". 13:24:36 okay 13:25:02 Yeah, I don't remember how to spell it in English 13:25:29 It's the guy's name, you don't spell it any differently in any other language. 13:26:05 We spell some names a bit differently in our language 13:26:17 How impolite. 13:26:24 It's like everyone has to call SOMs "Kohonen maps" no matter how stupid they think it sounds. 13:26:25 ? 13:26:46 It's not THAT different, I don't really remember how to spell his name 13:27:07 I don't remember all the names 13:27:11 fizzie, the names of the ancient greeks tend to be spelled differently in different languages though 13:27:33 Vorpal: I guess there's some variation allowed when the alphabet differs. 13:28:11 Plus our language has modifiers. If I were to spell your name in some conjunction in my language, it would be "fizziovy mapy" 13:28:18 It's due to the grammar. 13:28:33 Most nouns are modified and have many variants 13:28:43 Otherwise it would sound... REALLY weird 13:29:04 usually only the ending portion of the name is modified though 13:29:35 which language is that? 13:29:38 Finnish is a very inflectional language too, and admittedly we add a suffix to Karnaugh; it's just that generally I think everyone's name should be spelled the way they want it. 13:30:03 Czech 13:30:05 ah 13:30:21 Sadly the name isn't Finnish-enough looking, so we have to call it "Karnaugh'n kartta" with an apostrophe. 13:30:41 in Swedish we don't generally modify names beyond the "belongs to"-suffix. Because plural and definite form suffixes doesn't make sense on names 13:30:48 well I guess plural might 13:30:51 I think that Karnaugh has only suffix, but sometimes last one or two letters are modified as well 13:31:01 for family names 13:31:27 We've got 15 noun cases, and many of them make sense for names. 13:31:33 I mean... I just don't remember how exactly to spell his name, that's why I added "or something like that" 13:31:33 fizzie, strangely enough it is called Karnaughdiagram in Swedish, not Karnaughkarta 13:31:55 Well, it's not a "map"-map all geography-like. 13:32:05 indeed 13:32:09 it's called map in my language 13:32:20 well "mapa" 13:32:30 It's called map in Finnish too, but "diagram" makes equally much, if not more, sense. 13:32:33 Whoops, it's bank-time. -> 13:32:33 But that one doesnt mean just geography map 13:34:36 -!- Frooxius has quit (Read error: Connection reset by peer). 13:36:03 -!- Frooxius has joined. 13:36:17 oops, sorry, broadband connection (EDGE) x3 13:36:30 There's a bad signal here 13:36:51 -!- Frooxius has quit (Read error: Connection reset by peer). 13:36:51 http://en.wikipedia.org/wiki/A_Book_from_the_Sky 13:37:08 -!- Frooxius has joined. 13:37:20 aaaarg, bad connection again 13:37:31 regarding the 5551 though... what if the last bit activates some transparency mode, where the first 15 bits get reallocated like 4443 - RGBA, that is 4 bits for every color channel (so the color resolution lowers a bit) and 8 levels of transparency 13:39:00 forget my link.. awesome topic.. i need to scroll up on this one i think 13:39:04 color formats 13:39:37 Sounds slightly complicated, though certainly possible. Also, 9 levels when you count the non-transparent case. 13:39:40 http://fc05.deviantart.net/fs71/i/2011/104/0/8/nyan_cat_timelapse_by_kingaby-d3dygfa.jpg 13:39:49 i guess they could do some huffman encoding of images kind of 13:40:10 like.. determining the probability rates of color neighbourhoods 13:40:10 jpeg uses these fancy things called wavelets. 13:40:16 yaaay DA, did you make that kallisti? 13:40:24 Frooxius: not at all 13:40:50 If you want to call DCT a wavelet transformation... 13:41:43 I was under the impression that the JPEG2000 nobody uses does actual wavelets, though. 13:41:44 like .,.. if middle pixel is FF0000, then topleft pixel is a% likely to be 000000, b% likely to be 000001, c% likely to be 000002... hsahss% likely to be FFFFFF 13:42:03 Anyway, that reminds me of this joke I made http://fc00.deviantart.net/fs71/f/2011/338/5/f/eight_gigabytes_of_ram_by_frooxius-d4i5698.png :3 13:42:23 fizzie: oh yes that's the one I was thinking of. 13:42:24 -!- Frooxius has quit (Read error: Connection reset by peer). 13:42:40 -!- Frooxius has joined. 13:42:48 ugh again 13:42:51 Anyway, that reminds me of this joke I made http://fc00.deviantart.net/fs71/f/2011/338/5/f/eight_gigabytes_of_ram_by_frooxius-d4i5698.png :3 13:43:11 that got through the first time 13:43:28 Offhand I wouldn't be surprised if you could mathematically speaking describe DCT as a wavelet transformation with the right sort of really boring basis functions. 13:43:31 oh cool, sorry, I lost connection immediately after sending that, so I wasn't sure 13:43:34 and on the basis of these %'s, you could map the bits of the neighbouring pixels somehow 13:44:10 <-- sort of dumb, sort of smart, both at same time 13:44:18 OpenGL doesn't do Amiga's HAM formats. :/ 13:44:37 Okay, back out to the snow. -> 13:44:38 fizzie, what were those? 13:44:40 oh well 13:44:57 Hold And Modify, the pixels depend on neighbors. 13:45:16 You get more colors but it's difficult to do sharp edges. 13:45:41 fizzie: ahh.. so i had a nice idea but its done long ago eh? 13:45:47 actually here's link to the DA page, not direct to image http://frooxius.deviantart.com/art/Eight-Gigabytes-Of-RAM-272339180 Dunno why I linked that 13:46:15 everything has already been done :P 13:46:21 criuudhwudihewuidhwe uidhweuidh ewuidhewuihduiew dhwuih diuhw diuhw iudh iuwehdiuhweiudhweuihdiuwhduiwdwe 13:46:45 `log fuck fuck fuck 13:47:14 2007-02-11.txt:01:49:58: fuck fuck fuck fuck fuck 13:47:48 it's okay I accidentally invented FRP. 13:48:01 `pastlog wtf 13:48:20 2009-11-19.txt:04:38:00: WTF! 13:48:20 kallisti: oh cool 13:48:24 `pastlog wtf 13:48:38 2007-05-01.txt:00:19:54: but WTF does the group have that effect on me? 13:48:53 wow.. simonrc is popular in these logs 13:49:38 well, obviously if you search for swearwords you're going to get people who swear more 13:49:50 `pastlog motherfucker 13:49:54 lol 13:49:57 * ais523 wonders about the chance of no results 13:49:59 2011-01-18.txt:20:41:14: Jeb did it, motherfucker. 13:50:08 ah, no, there was at least one 13:50:33 `pastlog motherfucker 13:50:40 2011-03-22.txt:23:54:58: http://programming-motherfucker.com/ 13:51:13 `pastlog Feather 13:51:15 yes, I went /there/ 13:51:20 2008-08-23.txt:17:41:11: ais523, feather? 13:51:32 * Frooxius bubbles 13:51:49 ? 13:52:02 fizzie: well.. yes i feel proud that i just described HAM (in my poorly worded kind of way).. it is a testament to my comprehension of pixels 13:52:28 OK, esoteric idea: image format that's neither raster nor vector 13:52:40 hmm, what other possibilities are there? 13:52:42 -!- nooga has quit (Ping timeout: 252 seconds). 13:53:10 Some language to describe the image algorithmically? 13:53:12 * itidus21 laughs. 13:53:25 Frooxius: hmm, I was wondering along those lines too 13:53:27 sorry had to laugh 13:53:40 -!- azaq231 has joined. 13:53:46 not as an insult 13:53:49 -!- Frooxius has quit (Read error: Connection reset by peer). 13:53:53 but, just because someone had to 13:53:58 -!- azaq23 has quit (Ping timeout: 240 seconds). 13:54:35 ais523: my way of approaching this kind of problem would be to look for the generalization 13:54:45 and make another child from it 13:54:58 ah, right 13:54:59 -!- Frooxius has joined. 13:55:01 I hate this connection >.< 13:55:05 Some language to describe the image algorithmically? 13:55:08 I think they actually used something like that for one (or possibly more) game that they squeezed to 100 kB or so. They actually stored all textures and such algorithmically 13:55:21 so, vector and raster would be, children of some parent 13:55:52 humm 13:56:09 So the game took like... ages to load, because it needed to render all the stuff |3 13:56:13 ais523: ok ok.. heres one idea i had once 13:56:29 an 8x4 monochrome display... 13:56:40 let's see… raster images are a bit like an imperative description of what to draw to the screen 13:56:41 the video memory consists of a single 32 bit integer 13:56:42 as is, say, RLE images 13:56:58 more complicated compression schemes are more like an OO description 13:57:18 and vector images are a bit like a declarative description, if you consider "what to draw to the screen" to be a rasterisation 13:57:29 so, hmm, what else is left? 13:57:49 hmm.. its too hot and im too hungry for this lovely topic wuaahhh 13:58:15 clearly, we need constraint-based images 13:58:48 ais523: i am primarily interested in graphics 13:58:54 i have tried to figure some stuff out before 13:59:01 one idea i had once was.... 13:59:03 that 13:59:34 an image which has only 1 colour, can be stretched and shrunken without affecting it at all 14:00:43 hmm, not true for raster images, surely? 14:00:54 if it's 100x100, and you stretch it to 150x150 14:00:58 then you can't roundtrip it back to100x100 14:01:01 *to 100x100 14:01:06 oh, you mean solid color, I see 14:01:09 ya 14:02:17 i applied myself to thinking about graphics in the past but never really got far 14:02:25 but that was one idea i realized 14:03:22 it's still not an excuse for a modern os to ship without a ssh client or with a telnet client 14:03:33 ^ for all the people who just wouldn't believe me when I told them I knew an ssh fanboy 14:03:49 yeah, but 1 solid color is not much of an image 14:04:04 -!- Frooxius has quit (Read error: Connection reset by peer). 14:04:23 and on the spur of the moment i just descrbed a way that a set of images can be optimized for hold and modify without having heard of hold and modify before.. so i feel pretty accomplished from that 14:04:58 actually i think i have heard of it.. 14:05:06 in an old edition of computer and video games 14:05:17 but i think the article just said the prorgammers used some clever tricks 14:05:38 maybe its an unconcious uhm 14:05:47 unconcious plagiarism 14:06:23 meh i sure ramble 14:08:03 -!- Frooxius has joined. 14:08:35 Lost signal again >.< 14:11:44 i... i saved a document by accident.. and lost all the images inside it 14:11:46 oy vey 14:14:05 http://en.wikipedia.org/wiki/Kkrieger <- game you're thinking of (probably) 14:14:56 beats myself around the head with imaginary baseball bat 14:16:42 "Textures are stored via their creation history instead of a per-pixel basis" .. interesting 14:17:01 myndzi: maybe i was not actually thinking of ham at all 14:17:04 well, an interesting optimization task anyway 14:17:12 ham what 14:17:16 it was some scifi game in an old magazine 14:17:16 i want a ham sandwich! 14:17:17 :P 14:17:30 it said that the programmers used some tricks to get more colours 14:17:55 ah no, i was referring to frooxius's comment 14:18:01 kkreiger is probably the game he was talking about 14:18:09 who was? 14:18:19 Frooxius> I think they actually used something like that for one (or possibly more) game that they squeezed to 100 kB or so. They actually stored all textures and such algorithmically 14:18:32 demoscene dudes are pretty cool :) 14:18:58 a file went bad in open office 14:19:01 I read recently that there were some people developing an esolang-like language for golfing demos 14:19:06 i did repair but repair didnt go well 14:19:29 when i tried to save it.. i did so without thinking and overwrote it 14:19:40 oh my graviton 14:19:49 it doesn't really matter.. i retained all the text, but i had some silly images 14:19:58 and the images gave this file character 14:20:11 The connection... O.e I got no messages for a few minutes and then BAM! a few dozen messages at once x3 14:20:42 you got three copies? 14:20:45 i put a lot of work into my little documents.. i need to be more careful 14:20:46 haha, interesting 14:21:00 I don't recall name of that 100 kB game, though I can look it up 14:21:08 yeah i played the 96kb game 14:21:12 Frooxius: kkreiger 14:21:17 -!- Ngevd has joined. 14:21:21 good stuff 14:21:21 Hello! 14:21:28 yeah, I think that's the one 14:21:38 though it was an entry in a demo party 14:21:47 it's just the most notable one people seem to have heard of :) 14:22:10 myndzi, you're the one with a cyborg account, right? 14:22:14 kkrieger* 14:22:21 ^celebrate 14:22:21 \o| |o| |o/ \m/ \m/ |o/ \o/ \o| \m/ \m/ \o| |o| |o/ 14:22:22 | | | `\o/´ | | | `\o/´ | | | 14:22:22 /´\ >\ /| | /´\ /| |\ | /< >\ |\ 14:22:22 (_|¯'\ /'\ 14:22:22 |_) (_| |_) 14:22:36 I like artistic games a lot though. I try to make my own games as an art form 14:23:10 the game i am thinking of turns out to be Universe on Amiga 14:23:24 i once read they used some kind of tricks to get more colours 14:24:24 cyborg account? 14:24:27 "Universe was based on a modified version of Enchantia's game engine (the most notable addition was the in-game text and dialogue system and the increase in the Amiga color palette)" 14:24:35 probably not, i'm not sure what you're talking about :) 14:24:37 myndzi, half bot 14:24:41 Half not bot 14:24:44 oh lol 14:24:50 "account" doesn't really apply on irc 14:24:55 but nah, i just idle a bunch :) 14:25:01 Well, nick 14:25:09 And you do the celebrate thing 14:25:17 hehe 14:25:26 well it appears that somebody stored a convenience macro \o/ 14:25:26 | 14:25:26 /< 14:25:33 it draws legs on anything though 14:25:43 \m/ \m/ 14:25:43 `\o/´ 14:25:44 | 14:25:44 /´¯|_) 14:25:44 (_| 14:26:09 what's with the leading 9s? 14:26:28 leading ... 9s? 14:26:39 9 `\o/´9 14:26:39 | 14:26:39 /| 14:26:50 your irc client is rendering color codes weirdly 14:27:00 So's... mine? 14:27:06 it's ^k69^o 14:27:21 I see no nines nor any colours 14:27:31 which is how it should be ;) 14:27:43 I see no colors at all 14:27:47 it's not colored 14:27:50 there's a reset directly after them 14:28:00 it's just hidden tags so i don't interpret lines multiple times or when pasted etc. 14:28:01 Why? 14:28:14 long as it was copied in color anyway 14:28:23 kind of bot-loop protection 14:28:37 ah, right 14:28:43 one of the possible smilies starts with ` 14:28:51 well, dancers 14:28:59 so if not for that leading screwup, you could get a loop with hackego 14:29:10 -!- sebbu2 has joined. 14:29:10 -!- sebbu2 has quit (Changing host). 14:29:11 -!- sebbu2 has joined. 14:29:26 well, i wrote this script some time before i ever came here, but you have the idea ;) 14:29:37 it was a problem so i fixed it, i don't even remember what the problem was now 14:29:45 it might have only applied to me! 14:30:02 since i do some funky things with my own client 14:30:18 for example... 14:30:22 <- :myndzi!myndzi@c-67-168-184-168.hsd1.wa.comcast.net PRIVMSG #esoteric :for example... 14:32:45 have to go, byeeee 14:32:59 -!- sebbu has quit (Ping timeout: 252 seconds). 14:32:59 -!- cheater has quit (Ping timeout: 252 seconds). 14:33:00 -!- Frooxius has quit (Read error: Connection reset by peer). 14:33:03 -!- sebbu2 has changed nick to sebbu. 14:38:08 one thing i have pondered about graphics is that things like graphics plots never resemble anything 14:39:07 like, it is not common for a formula to represent a bitmap 14:40:00 well, bitmaps don't frequently come in the form of elegant mathematical expressions ;) 14:40:05 have you read about fractal compression? 14:40:20 like most lineart is discontinuous 14:41:28 and then the idea comes as, just use the brute force of the computer which is available :P 14:41:34 myndzi, I seem to remember there is a way to represent any 1-bit bitmap as an equation. 14:42:04 ah yes https://en.wikipedia.org/wiki/Tupper%27s_self-referential_formula 14:42:05 yeah 14:42:07 1 or 0 14:42:07 :P 14:42:17 myndzi, no I mean as in each pixel is either black or white 14:42:18 but you mean 1 as in the bit depth i'm sure 14:42:19 not grey 14:42:34 see the link 14:42:35 i'd believe it, but is that representation significantly shorter or simpler? 14:42:47 myndzi, see the link and decide for yourself 14:43:02 haha, awesome 14:43:03 I would call it clunky however 14:43:04 a mathematical quine 14:43:22 myndzi, thing is, you can select some numbers in there to draw any image 14:43:33 it's cheating, it's taking an encoding of itself as input 14:44:50 * myndzi shrugs 14:45:00 it doesn't look to be very efficient as far as compression goes 14:45:10 well that is correct 14:45:22 myndzi, I was simply replying to " well, bitmaps don't frequently come in the form of elegant mathematical expressions ;)" 14:45:35 I think the idea is pretty elegant :P 14:45:49 headache being induced 14:45:50 -!- cheater has joined. 14:45:50 except the fact that it requires a multiple-line constant :P 14:45:52 myndzi, anyway: procedural textures 14:46:06 myndzi, bah, details 14:46:44 myndzi, procedural textures tend to be more or less simple mathematical formulas 14:47:08 quite often there is some perlin noise in there though, which might not be so simple 14:47:29 well, yeah, but itidus was commenting on prevalence 14:47:39 such techniques might be prevalent in the demoscene but not really outside of it 14:48:05 myndzi, eh, I used procedural textures quite a bit. Minecraft water is by default a procedural texture afaik 14:48:34 I'm not sure how common it is in other contexts 15:01:46 -!- nooga has joined. 15:02:32 -!- Frooxius has joined. 15:06:21 -!- qfr has joined. 15:06:38 The .kkrieger-making tool, .werkkzeug, has this artist-friendly(ish) GUI for playing around with expressions and parameters. 15:06:57 -!- MSleep has changed nick to MDude. 15:07:22 For some bizarre reason, I keep thinking that "Euler" begins with J 15:07:24 -!- MDude has quit (Read error: Connection reset by peer). 15:07:28 > head "Euler" 15:07:29 'E' 15:07:34 It doesn't! 15:07:54 And POV-Ray "frontends" (and Blender, and probably other modelers) tend to include procedural-texture-generation UIs where you can spwengle with layers. 15:08:02 Because you grossly mispronounce it, Ngevd? :| 15:08:17 qfr, not so it sounds like it begins with a J 15:08:26 Jeuler, the jocular Euler. 15:08:47 It's only when I think "what's the initials of Project Euler" do I make this error 15:08:48 A rough English approximation of how it's pronounced is "oilah" 15:09:08 -!- MDud has joined. 15:09:08 You grossly mispronounce it with a silent J, perhaps. 15:09:08 In modern standard German that is 15:09:12 -!- MDud has changed nick to MDude. 15:09:21 Different in Swiss German 15:10:08 -!- Frooxius_ has joined. 15:10:31 -!- MDude has changed nick to MDud. 15:10:35 -!- MDud has changed nick to MDude. 15:10:56 -!- MDude has changed nick to MDuck. 15:11:00 -!- MDuck has changed nick to MDude. 15:11:05 -!- Frooxius has quit (Ping timeout: 240 seconds). 15:11:13 What? 15:11:18 -!- Frooxius_ has changed nick to Frooxius. 15:11:25 A dud duck. Is that like a duck which doesn't quack? 15:12:01 mIRC keeps switching nick/alternate nick and then keeping it the wrong way around. 15:12:31 mIRC? On MY freenode? 15:12:49 what happens is: 15:12:55 if you are USING your alt nick 15:13:02 and you change to a nick that's not your main nick 15:13:07 it modifies the setting 15:13:13 you can use /tnick to avoid this 15:13:18 Is mIRC a blasphemy here? 15:13:26 it becomes a problem when you get guested or something 15:13:28 Or something like that 15:13:30 mirc changes your main nick to Guest 15:13:44 so when you go to change to your main nick, you instead change the wrong one 15:13:50 or s omething like that anyway. you should get the picture :) 15:14:06 you can alias tnick and maybe reset nick and anick when you get disconnected 15:18:15 8-bit metal! >:3 http://freemusicarchive.org/music/Heosphoros/Embered_Recollections/Eleven_Acausal_Fire 15:18:34 i found something awesome yesterday 15:18:58 http://www.sotb.se/ 15:20:03 They don't sound bad :3 15:20:10 not at all 15:20:32 vocals are a little .. well, not bluegrass but it doesn't really matter 15:20:59 because of them i also found iron horse, and they seem to have a bunch of cover albums of bands like metallica or black sabbath etc. 15:21:03 even linkin park lol 15:21:15 Does anyone listen to Machinae Supremacy? 15:21:57 think i've heard of them, but i can't place it 15:22:13 SID Metal as they call it 15:22:24 Chiptunes + Metal 15:23:09 i found the bluegrass band 'cause i was looking for piano covers 15:23:14 i downloaded a bunch of dragonball z game music recently 15:23:15 there are some good piano renditions of various songs on youtube 15:24:03 I actually used their music in a short film I did, named "School as a computer game" :3 http://www.youtube.com/watch?v=hAAIPezSwVg 15:24:08 :o 15:24:25 ha, this is an interesting combination 15:24:32 What is? 15:25:00 -!- Patashu has quit (Quit: MSN: Patashu@hotmail.com , Gmail: Patashu0@gmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .). 15:26:01 machinae supremacy 15:27:10 yeah they're great! :3 They're even fine with me using their music in that video (they're actually even glad for fan works x3 ) 15:27:54 http://www.youtube.com/watch?v=iKQ048-O4vs#t=1m2s <- i want to find a whole album with songs like the intro riff here 15:29:04 -!- nooga has quit (Ping timeout: 276 seconds). 15:29:06 HAHA oh wow 15:29:07 http://www.youtube.com/watch?v=p8cLJcm_RoU 15:29:10 totally didn't know that 15:31:32 Machinae Supremacy has played once or twice (or thrice; can't quite remember) at Assembly. 15:32:05 Though recently, they seem to get more metal-like and less chiptune-y :-( 15:32:29 And Press Play On Tape did it last year; they're also quite 8-bitty, though not at all metal. 15:32:46 Or I guess officially they spell it PRESS PLAY ON TAPE. 15:33:16 The songs I used in the short film are actually the ones that are available for free on their website 15:36:52 Oh, I see they've released (via Pirate Bay, no less) their Assembly 2011 concert video. 15:39:47 Frooxius: that is really a very cool video 15:39:56 thanks O.O 16:09:57 interesting youtube channel 16:10:45 its kind of funny, that, your understanding of 8bit must be so mysterious 16:11:04 What do you mean by mysterious? Oo 16:11:40 well i was born in 82, and my first computer was a NES.. im not sure which year that was exactly 16:12:16 ah.. 89 :-? 16:12:38 What? Are you asking if I'm 89? 16:12:42 i guess you're not all that young 16:12:46 I'm 91 16:12:49 oh i got my NES in 89 16:12:55 oh x3 16:13:12 I'm October 1991 16:13:23 im not sure how i figured that out actually 16:13:45 I still don't know what you mean by the mysterious though 16:13:59 itidus21, wait, you're *29*‽ 16:14:05 yup................... 16:14:16 You're younger than you look 16:14:22 Older, rather 16:14:26 I remember that we had Sega Master System when I was 3 or 4 and later Sega Genesis 16:14:40 My first console was a Playstation 2... 16:14:43 I feel young 16:14:48 no computer though really as in, PC and such 16:15:05 ahh maybe ngevd feels the mystery about 8bit then 16:15:22 We never had consoles, I just rented a Genesis (well, Mega Drive hereabouts) from the video store every now and then. :/ 16:15:41 Hmm, I think it was named Mega Drive here as well 16:15:45 What kind of mystery? 16:15:59 back then.. the option was.. 1) watch standard def tv 2) watch a vhs tape 3) play 8bit console 16:16:15 and if you were lucky you had some old computer 16:16:58 I see 16:17:04 so slot cars and remote control cars were a lot more exciting back then 16:17:30 Yeah. I know that even computer felt more exciting and mysterious for me when I was little. 16:17:36 Maybe that's what you mean? The feeling of mystery? 16:17:54 There is no way to know what he means: that's the mystery. 16:17:54 It's like how the Romans built the Pantheon 16:18:01 well.. for someone who wasnt raised on 8bit games then they have to wonder what exactly is it like to play 8 bit games 16:18:24 Actually, I play Super Mario Bros on a NES emulator from time to time... 16:18:29 ---- in a time when they are being sold for a lot of money :P 16:18:35 I play old games in emulators nowadays too :3 16:18:45 Though dad has NES as well for a while 16:19:03 But mostly it was Sega Master system. Which is 8 bit actually 16:19:12 i mean like... there was no 3d, there was no polygons, there was no street fighter 16:19:23 I've got a friend who's got a Betamax player 16:19:34 So I played some 8-bit games in my childhood, but not really that much, because later dad sold the console 16:20:00 i dunno exactly 16:20:29 I remember... I couldn't even read much, so the help of M602 (something like Midnight Commander) that was on the computer seemed like a huge mysterious book that would take me ages to read |3 Now I can read it like in 5-10 minutes 16:21:12 Though I didn't get computer until I was 12 16:21:42 Frooxius: anyway, your youtube is quite interesting... you're very creative 16:21:47 Before then, we had nothing, because parents divorced 16:21:56 Thanks O.O 16:23:30 There was a Prolog system on our 286; now *that* was the weirdest. It even had some example programs that implemented an "ask about geography" thing. 16:23:33 in that housepets animation, did you work out the animation skeleton or was it done automatically? 16:23:44 Which one? 16:23:56 the one where you move him around like a puppet 16:24:30 Oh, no it was done manually, I positioned the parts with code 16:24:58 It was just silly experiment, it's not even much good |3 16:25:03 hmm... did you make the whole system? 16:25:48 Well I quickly scripted it, I basically wrote a code that positions the images on the screen based on input angles and X, Y positions and then created a simple keyframe system, that calculates the frames between two keyframes 16:26:07 i mean you didn't cheat with flash or anything right? :-D 16:26:15 it's not made with flash 16:26:19 ok i understand 16:26:23 so you did indeed do all the work 16:26:39 i just had to be sure 16:26:43 Well it's very simple anyway, it's just an array of angles and positions and all it does it just pick one current one, find the next one and interpolate between them 16:27:08 -!- Vorpal has quit (Ping timeout: 260 seconds). 16:27:12 i was trying to work on a similar idea myself recently... 16:27:23 i didnt get very far exactly 16:27:39 i sort of got an interpolated arm moving 16:27:41 like if the keyframe[0] is for frame 0 and position 40 and keyframe[1] is for frame 2 and position 20, then it basically first calculates ratio of both 16:27:48 that is 16:28:04 i think one limit i had was this arm thing i made could only bend at one joint 16:28:20 (keyframe[n+1].frame-keyframe[n].frame) 16:28:28 that's the size difference 16:28:35 errr I mean. 16:28:50 Like the span of frames and the ratio is calculated like 16:29:02 and it was about the time i gave up when i started to think about ways that it could work out the necessary joint bends to reach the target 16:29:27 r = (current_frame-keyframe[n].frame) / (keyframe[n+1].frame-keyframe[n].frame) 16:29:34 Then you can calculate the position as 16:30:06 actual_x = (keyframe[n].x * (1.0-r) + keyframe[n].x * (r)) 16:30:08 do you use the same system to animate tiggy? 16:30:13 No 16:30:23 That's not keyframed 16:30:49 Plus you can first apply some function on the r 16:31:09 ah don't worry im not all that smart.. i won't remember any of this later 16:31:18 like SinFunc(r), which outputs also 0.0 to 1.0, but assumes that input r is linear and output is sine 16:31:34 So the animation is nice and smooth - has smooth start and smooth end 16:32:43 SinFunc(r) can be defined like { return Sin(r*(pi/2)); } 16:32:49 -!- elliott has joined. 16:32:53 Hello elliott! 16:33:02 hellooo elliott! 16:33:04 Or just "helliott" in short. 16:33:25 hello 16:33:25 elliott: You have 4 new messages. '/msg lambdabot @messages' to read them. 16:33:44 Joor so popular. 16:34:05 three of those messages were me 16:34:08 Tiggy has instead several animation states defined, like when he's walking, running, jumping and such. Each one of these has some input variables that are used to calculate the positions of the body parts - they are positioned by code as well 16:34:15 Well, self-popular, then. 16:34:46 Usually it's walking speed and or surrounding's - distance to the floor or ceiling, or vertical speed and such. 16:34:58 * elliott wonders who Frooxius is 16:35:15 Frooxius: i am sort of the dumb guy here.. i am clueless about esoteric programming.. 16:35:24 elliott, he's vaguely new 16:35:32 I just joined today ^^' 16:36:12 However, it does smooth transitions between these animations, using a similar way as between two keyframes (calculate the ratio first and then do a sum of the first state *(1.0-r) and second state *r 16:36:27 elliott: Frooxius is new, ontopic, and seems to understand what the channel's like 16:36:37 you can look at the mess when we welcomed em 16:37:31 ais523: Sad, then, that the Elliott Experience(tm) will likely scar em for life. 16:37:47 and he is into gamedev.. yay 16:37:48 Plus smooth transitions can happen during various times. For example, when he's walking, then he's walking at specific speed and then there's a small range of the velocity, where the walking animation is transitioned to the running one, based on the speed actually (the speed in the small range is used as the ratio for the smooth transition) 16:38:17 and much better at it than i am 16:38:53 * pikhq mutters 16:39:12 If only Homo sapiens were intelligently designed, then I could curse the designer of the sinus. 16:39:18 For example, he walks at 10.0 speed and I can have code that calculates the ratio like r = limit( ( speed-10.0)/4.0, 0.0, 1.0) 16:39:31 So the transition range is 10.0 to 14.0 16:39:44 limit is limit(val, min, max) limits the value to certain range 16:40:19 Is this game an esoteric game? 16:40:32 Sorry, not really ^^' 16:40:41 We shall have to fix that, then. 16:40:46 Though I have some weird ones in plans 16:40:52 Pick a weird topology, apply to game space immediately. 16:41:05 Well experimental games at least 16:41:06 I recommend the real projective plane. 16:41:18 Phantom_Hoover: that's actually quite a good one for games, I think 16:42:10 Here's the two-step plan to making an esoteric game: 1. Check if your game is one of my game plans. 2. If it's not, make it that and implement it. (You may need to learn a few languages.) 16:42:17 It is the ONLY. WAY. 16:42:30 nuuuuu 16:42:31 Hahahaha, as if you'd ever use any language other than Haskell. 16:42:36 * Frooxius starts running in triangles 16:42:44 Phantom_Hoover: That's at least one language! 16:42:50 hmm 16:42:50 There's also the Cabal file... 16:42:51 Or condone the use of anything that wasn't either Haskell or Haskell, but moreso. 16:42:59 he is the chosen one.. in 2012 16:43:01 See, that's two languages. 16:43:05 itidus21: oh god what. 16:43:22 a mysterious mix of intelligence and creativity 16:43:51 I... 16:44:05 Frooxius: Congratulations, you're The Prophet(tm). 16:44:08 elliott: hey, implement elliottcraft (ais523 version) for me 16:44:09 Tell us about how the world will end. 16:44:11 I mean, i'ts named after you! 16:44:13 it is likely he will understand esolangs 16:44:17 *it's 16:44:18 WHATDIDIDO? Oo 16:44:24 I have no idea. 16:46:40 the force is strong with him i tell you 16:46:51 hmm... maybe it will end with Kernel Panic. Or a BSOD. 16:47:10 a mysterious mix of intelligence and creativity 16:47:14 Or whatever-Apple-Mac-OS-X-does-when-it-goes-bonkers 16:47:17 Is this intelligence relative to itidus21? 16:47:25 hmm... 16:48:06 i stand by my comment :-D 16:49:15 JUST SEEN: someone self-censoring 'screwed'. 16:49:48 s*****d? 16:49:59 Worse. 16:50:05 'Scr*wed'. 16:50:38 That's totally Nitrloglibimostri*vilious 16:51:05 Yay b*wdl*r*z*t**n 16:51:11 Frooxius: OS X just kernel panics too. 16:51:15 B****fuck 16:52:18 elliott: isn't an OS X kernel panic an image of a power button, plus instructions to reboot your computer in five different languages? 16:52:31 if a Mac's going to screen-of-death, at least it's going to be a /stylish/ screen of death 16:52:44 whereas Linux just locks up and flashes the num lock and caps lock keyboard LEDs 16:53:01 (and I don't think I need to explain what Windows does, it's so well known) 16:53:44 ********k. 16:53:56 I would ask what DOS does on kernel panic 16:54:01 but I'm not entirely convinced it even has a kernel 16:54:12 B****fuck <-- just realised the joke... 16:54:24 Ngevd: it's an old joke 16:54:31 but wow, that was almost as slow as Vorpal 16:54:40 Yeah. Like display an advanced and detailed 3D realtime render of rotating apple with a little diamond worm with a speech bubble saying "According to 9 out of 10 fashion experts, it's very positive for your image if your OS crashes once in a while. Thus, with sole intentions of helping your image, we just crashed your OS. Your Apple" 16:55:04 ais523: The C64 ROM hasn't got a kernel, but it *has* got a KERNAL. 16:55:05 incidentally, most OSes don't react sanely to a GPU crash 16:55:26 fizzie: the BBC Micro just had a bunch of subroutines at the top of memory that did stuff like writing to the screen 16:55:36 with standard names like oswrch 16:55:40 and osrdch 16:55:58 (which made asm programs hard to read, as I mentally pronounced both words as "ostrich") 16:57:33 holy shit why is google's search bar under like 10 nested divs and tables. 16:58:18 ais523: That's not much more than what the KERNAL has, except I think it's got the standard IRQ, NMI and RESET handlers too. 16:58:35 -!- azaq231 has quit (Quit: Leaving.). 16:58:37 It's even also at the top of the memory. 16:59:15 Well, my BytePusher version of Hunt the Wumpus is tricky... 17:02:21 Tables? 17:02:35 Tables? 17:02:49 TABLES? Oo 17:06:20 ais523: Also FreeDOS has a component called KERNEL; it contains the KERNEL.SYS file which implements the DOS system calls. I suppose that corresponds to MSDOS.SYS, and possibly also IO.SYS, in MS-DOS. 17:06:37 yep, seems about right 17:07:07 and osrdch 17:07:17 Does it make the processor stick its head in the sand 17:16:42 I think I got a "GURU MEDITATION" error out of some website the other day. 17:18:04 My notebook came with a copy of FreeDOS 17:18:08 I put it into the trash 17:18:56 qfr: it's a legal requirement that Microsoft invented, that computers have to be sold with an OS 17:19:01 (at least, they managed to force it through) 17:19:14 FreeDOS is typically used as a very cheap method of complying with that requirement 17:19:16 :L 17:19:21 by computer companies who'd otherwise be selling bare boxes 17:19:46 What's the easiest way to convert a 256x256 bitmap to a Bytepusher codepage? 17:19:51 qfr: you did put the copy of FreeDOS in the trash, not the notebook, right? 17:19:51 xscreensaver's BSOD "hack" contains error messages from: Windows 3.1, Windows 95, Windows NT, MS-DOS, AmigaDOS 1.3, Linux, SCO UNIX, BSD UNIX, HPUX, Solaris, Tru64, VMS, HVX/GCOS6, IBM OS/390, OS/2, MacOS (MacsBug, Bomb, Sad Mac, and OSX), Atari ST, Apple ][+, and NCD X Terminals. 17:22:19 Ngevd: If you just need the bytes, and it's a one-off thing, Gimp has a "raw image data" file-writing mode which I guess should suffice. 17:24:34 Actually I'm not terribly sure if it includes the palette if you write an indexed-color image. 17:25:41 But at least a grayscale image is written as a sequence of bytes in the "obvious" manner. 17:27:01 ais523: I decline to comment 17:27:21 hey, you aren't elliott! 17:27:43 oh right: Frooxius, you wouldn't happen to live in Hexham, would you? 17:28:11 No, sorry. 17:28:18 phew 17:28:19 How about Finland? 17:28:35 Why would I live there? 17:28:42 That's a *very* good question. 17:28:45 Why would anyone? 17:28:48 With a Czech hostname, both of those are rather unlikely. 17:29:23 There's two people in this channel in Hexham and god knows how many in Finland 17:29:33 Ngevd: but does anyone else know how many? 17:29:43 Deewiant: I'm sure a place as cosmopolitan as Hexham has a fairly-sized "Czechtown". 17:29:46 ais523, good question 17:30:53 ais523: It's at least five by my last count. 17:31:04 -!- Klisz has joined. 17:31:16 am I the only esolanger in Birmingham? 17:31:28 Let's see... a tehwa, D eewiant, f izzie, i neiros, m tve, and Z warddijk at the very least. 17:31:37 So at least six. And that's before we get to the bots. 17:31:44 (Okay, there's only one Finnish bot.) 17:31:51 Oh, and that's just people here now, so it's at least seven. 17:32:00 elliott: I don't think "m tve" did? But you didn't count "o klopol". 17:32:40 Birmingham, second largest city in the UK, has one esolanger, Hexham, a town with about 1% the population, has two 17:33:19 Two in Sweden? 17:33:53 fizzie: Did what? I assumed he's a Finn because you know him. :p 17:33:56 Deewiant: Aren't all of "V orpal", "o lsner" and "F ireFly" from Sweden? Though I might misremember. 17:34:10 Yes, and a few more too. 17:34:11 I believe. 17:34:14 Are there any Canadian esolangers? 17:34:21 coppro is Canadian 17:34:23 elliott: I don't think I know em, and I had a vague feeling e was from Germany. But I'm certainly not certain. 17:34:27 Is Zwaarddijk a Swedish-speaking Finn or vice versa? 17:34:28 elliott: a loril seems to be in Finland 17:34:34 Pretty sure it's the first one. 17:34:38 Unless you meant some other. 17:34:41 Oh, wait, you were just counting separately. 17:34:51 fizzie: Okay, fair enough. Maybe I'm thinking of some other Finn you know. :p 17:35:07 Deewiant: I conclude my official tally with the result: "Too many". 17:35:09 lol I like cpressy wrote a script in Perl that literally generates line noise. 17:35:13 +how 17:36:27 kallisti: don't you mean random values? 17:36:28 Ngevd: *at least two. 17:36:34 Also, cpressey used to live in Canadia. 17:36:39 for it to be /literal/ line noise it'd need to be trying to get data from a noisy connection 17:36:54 and reading noise instead 17:37:05 I have seen genuine line noise before now 17:37:06 ais523: http://catseye.tc/projects/noise/script/noise randomly generated in a certain way, yes. 17:37:23 when we linked up a couple of serial ports by physically sticking copper wires into the relevant sockets 17:37:28 and it got knocked 17:37:40 noise is a tiny utility whose purpose is to simulate line noise — those random bursts of static that occur when communicating with a non-error-correcting modem over an unreliable phone line. Start it up in the background and keep working at your shell prompt — or, keep trying to! 17:37:53 I've got to get some of my friends into esoteric programming 17:38:03 Ngevd: do you have friends that program? 17:38:03 ais523: It could be a physical-simulation sort of line noise. They simulate acoustic instruments and so on, why not line noise. 17:38:18 heh 17:38:33 fizzie: I actually wrote one of those, come to think of it 17:38:35 kallisti, two, one's more of an acquaitance, due to him being a bit of a dick, and the other doesn't live in Hexham 17:38:50 I was testing a Morse code decoder I'd written that was designed to work on noisy input 17:38:58 hmmm, that's about as many people I know as well. I guess a few more if you count people I've met. 17:39:01 but I don't count those. 17:39:27 ais523: noise cancellation is fun. 17:39:29 I am going to leave for a while 17:39:32 -!- Ngevd has quit (Quit: Goodbye). 17:44:04 @unmtl State s a 17:44:05 s -> (a, s) 17:54:22 * kallisti finds himself using Facebook less and less. 17:57:05 you still use fb? 17:57:37 yes. 17:57:42 people I talk to use it 17:57:43 stop 17:58:05 I probably will once the new terrible profile change takes place. 17:58:19 like, I was fine with every other change 17:58:21 until this one. 17:58:30 kallisti: you have reason to think one's coming other than the fact that they happen often? 17:58:37 Ngevd: why? 17:59:04 stop 17:59:05 are you zzo 17:59:22 elliott: do you seriously have to ask whether any given person is zzo or not? 17:59:37 ais523: are you elliott? 17:59:45 if I were, do you think I'd admit it? 17:59:48 kallisti: are you monqy? 17:59:53 kallisti: yes 17:59:55 clog: are you glogbot 18:00:03 clogbot 18:01:31 elliott: how was your weak squishy human sleep? 18:01:40 I have been awake since last we spakened 18:01:54 spaconed, like bacon. 18:02:29 selenium.common.exceptions.StaleElementReferenceException: Message: u'Element not found in the cache' 18:02:32 WHY 18:15:32 Selenium sucks, anyway. 18:16:00 Phantom_Hoover: well yes. 18:16:18 Tellurium is better in every way. 18:16:47 "Using chr, ord, and -32 is not the right way of doing this. Use toUpper." "@augustss: It's good enough for ASCII." 18:16:55 NO FUCK YOU NOTHING IS "GOOD ENOUGH FOR ASCII" JESUS CHRIST 18:18:06 elliott: even toUpper isn't correct without some knowledge of the language 18:18:29 elliott: is someone trying to find excuses /not/ to use toUpper? 18:18:40 and instead use... that? 18:18:41 what? 18:18:59 that's going to basically fuck up anything that wasn't lowercase. 18:19:00 is the input known to be made out of lowercase letters? 18:19:06 Is this Haskell? 18:19:16 presumably, based on function names. 18:19:50 chr and ord are commonly used function names for those operations 18:19:50 * elliott decides to just link rather than tediously explaining everything: http://stackoverflow.com/questions/8700564/haskell-converting-small-chars-to-capital 18:19:55 -!- augur has quit (Remote host closed the connection). 18:20:00 guy keeps opening trivial homework questions without even trying 18:20:12 people keep answering them by giving a complete solution >_< 18:20:25 chr . subtract 32 . ord is not only incorrect but requires more effort than toUpper. 18:20:54 elliott: well, are there any rules against answer homework questions? 18:20:59 yeah but he hadn't imported Data.Char so he was getting "not in scope" 18:21:03 so much easier to use a broken solution 18:21:15 kallisti: you are meant to try and give help for homework questions, not the solution outright 18:21:24 (they are tagged "homework", so there is no excuse) 18:22:43 -!- nooga has joined. 18:23:18 hmmmm how /does/ toUpper work with Unicode characters. 18:23:45 it /should/ be locale-dependent 18:23:51 is there like, a big table? 18:23:55 ais523: for what definition of should 18:24:03 i do not believe the unicode standard talks about locales 18:24:57 elliott: well, it depends on the language 18:25:01 Turkish is the normal example 18:25:13 and I think it more likely talks about locales than languages 18:26:21 ais523: I am dead sure that (a) the Unicode standard defines various case transformations and (b) they do not depend on any sort of external state. 18:26:46 elliott dead. 18:26:51 elliott: the external state would be used to determine which transformation was used, then, presumably 18:26:52 sure 18:27:42 ais523: how do I say "you're wrong" in a way that doesn't make your response "" 18:28:09 elliott: a link would be helpful 18:28:29 it is impossible to correctly determine what the capital version of "i" is without knowing the language, anyway, is the point 18:28:41 http://www.unicode.org/versions/Unicode6.0.0/ 18:28:55 -!- nooga has quit (Ping timeout: 240 seconds). 18:29:10 specifically, http://www.unicode.org/versions/Unicode6.0.0/ch04.pdf 18:29:14 hmmm if that's the case then toUpper is not referentially transparent. 18:29:39 -!- kmc has joined. 18:29:43 * ais523 looks 18:30:18 I think I've just stopped paying attention to YouTube's featured videos altogether, even if they're relevant. 18:31:06 -!- augur has joined. 18:37:02 “If you are a programmer working in 2006 and you don’t know the basics of characters, character sets, encodings, and Unicode, and I catch you, I’m going to punish you by making you peel onions for six months in a submarine.” 18:37:02 —joel spolsky 18:37:02 Joel on Software 18:37:03 this is actually 18:37:05 on the unicode website 18:37:17 http://www.unicode.org/announcements/quotations.html#spolsky 18:38:49 elliott: page 7: " Also contains context-dependent mappings, with flags to distin- guish them from the normal mappings, as well as some locale-dependent mappings." 18:38:56 I knew it'd be there if I looked hard enough 18:39:26 (and I'm not taking it out of context either, although feel free to check yourself) 18:39:56 ais523: hmmmm how /does/ toUpper work with Unicode characters. it /should/ be locale-dependent 18:39:59 it isn't, your quote is irrelevant to that 18:40:29 elliott: my quote is from the database that contains the default uppercasing algorithms for unicode 18:41:03 it also says that there's a legacy best mappings database that isn't locale-dependent 18:41:16 that should only be used by legacy implementations 18:41:37 although that's at least partly to do with mapping one lowercase character to multiple uppercase characters 18:41:42 blah, i cba to actually read the spec, but i'm still going to maintain my belief that i'm pretty sure you're wrong :) 18:42:10 wow properties sure are bad in Python. 18:43:34 oh hmmm no it's a little bit better than it used to be. 18:45:03 elliott: in the actual case of lowercase i, http://www.unicode.org/charts/PDF/U0000.pdf says "Turkish and Azerbaijani use 0130 İ for uppercase" 18:45:51 ais523: that sounds like just a comment, not a definition 18:45:59 right, indeed 18:46:05 I'm trying to find the case mapping charts at the moment 18:48:21 elliott: anyway, I think it's possible that we're both right 18:48:33 it seems that there are pure legacy versions that map characters to characters 18:48:42 and more contexty versions that map strings to strings, and require locale info 18:48:50 the only case mapping charts I could find were for the legacy version 18:48:58 @unmtl Writer w a 18:48:59 (a, w) 18:49:06 "mtl"? 18:49:07 ais523: heh 18:49:11 monad transformer library 18:49:15 ah, OK 18:49:29 @unmtl WriterT (ContT r (StateT s (ErrorT e IO))) a 18:49:29 Plugin `unmtl' failed with: `WriterT (ContT r (StateT s (ErrorT e IO))) a' is not applied to enough arguments, giving `/\A. a (A, ContT r (StateT s (ErrorT e IO)))' 18:49:32 argh :D 18:49:37 @unmtl WriterT (ContT r (StateT s (ErrorT e IO))) [Int] a 18:49:37 [Int] (a, ContT r (StateT s (ErrorT e IO))) 18:49:41 ... 18:49:41 oh 18:49:46 @unmtl WriterT [Int] (ContT r (StateT s (ErrorT e IO))) a 18:49:46 (a -> [Int] -> s -> IO (Either e (r, s))) -> s -> IO (Either e (r, s)) 18:49:50 ais523: like so ^ 18:49:56 @mtl (a -> [Int] -> s -> IO (Either e (r, s))) -> s -> IO (Either e (r, s)) 18:49:56 Maybe you meant: ft map msg pl unmtl url 18:50:01 that doesn't exist though :P 18:50:30 elliott: so it's working out the type that actually represents the type of a monad action obtained by stringing together a bunch of monad transformers 18:50:47 it's just expanding the definitions recursively 18:50:52 yep, indeed 18:51:06 except they're actually data types, not type synonyms, so the two types are not actually equivalent :) but it's what they /mean/ 18:51:51 they're isomorphic if you ignore the fact that a data declaration adds an extra bottom. :> 18:52:00 but many of those are newtypes, right? 18:52:01 kallisti: they're newtypes. 18:52:03 yes. 18:53:23 ais523: http://www.unicode.org/Public/UNIDATA/SpecialCasing.txt "-- contains additional information about the casing of Unicode characters. (For compatibility, the UnicodeData.txt file only contains case mappings for 18:53:37 characters where they are 1-1, and independent of context and language." 18:53:47 0130; 0069 0307; 0130; 0130; # LATIN CAPITAL LETTER I WITH DOT ABOVE 18:53:56 fizzie: thanks for finding it for me 18:55:02 elliott: I'm tempted to make semicolons an infix operator for statement blocks... 18:55:09 talk me out of it. 18:55:26 kallisti: don't work for spammers 18:55:29 oh, talk you out of /that/ 18:56:06 There's the language-specific (and context-specific; sometimes the mapping depends on surrounding characters, like for sigma and... I guess that's about it) ones. 18:56:14 oh no, I think I ruined my Monoid instance 18:56:24 hmm it might not be a problem though 18:56:36 kallisti: ICA uses infix semicolon as sequencing, it works fine 18:56:56 the main problem is precedence 18:57:00 low 18:57:06 there's no precedence that doesn't look weird in some combination or other 18:57:06 the precedence is low. problem solved. 18:57:08 -!- iconmaster[1] has joined. 18:57:15 kallisti: lower than if? while? lambda? 18:57:32 yes 18:57:38 those are functions with () notation 18:57:38 pair formation? 18:57:47 I don't think I have that. 18:57:59 a,b;c,d is a bit of a weird case 18:58:08 because clearly a,(b;c),d is the only way it'd type 18:58:42 I don't have to worry about that because I don't treat , as an operator. 18:59:01 so technically if , is an infix operator it's lower precedence than any operator. 18:59:16 as it's defined as part of the function syntax. 19:00:07 hmmm yes I like that. I'll do that. 19:01:48 actually top-level statements require no line terminator, but I suspect if I don't add one it will make the errors look like crap. 19:05:47 -!- oerjan has joined. 19:09:54 I think using Haskell's list monad will make the logic programming stuff much easier. <-- note that iirc there exists a monad-logic package which is more flexible than lists 19:09:55 hello oerjan welcome to ~AMERICA~ 19:10:11 * oerjan looks suspiciously at elliott 19:10:28 was that scripted? 19:11:46 -!- elliott has quit (Read error: Operation timed out). 19:11:59 ~AMERICA~ 19:13:01 oerjan: I assume it also handles non-determinism? 19:13:23 well what i recall is it has this function: 19:13:23 -!- elliott has joined. 19:13:28 :t (>>-) 19:13:29 forall (m :: * -> *) a b. (MonadLogic m) => m a -> (a -> m b) -> m b 19:14:08 which is like >>- except reorders things to ensure all combinations are tried 19:14:42 19:13:01: oerjan: I assume it also handles non-determinism? 19:14:47 no it's a logic monad without nondeterminsm 19:14:48 aka 19:14:48 Maybe 19:14:51 > [1..] >>- \x -> (,) x <$> [1..] 19:14:52 [(1,1),(2,1),(1,2),(3,1),(1,3),(2,2),(1,4),(4,1),(1,5),(2,3),(1,6),(3,2),(1... 19:15:25 *is like >>= 19:15:49 and also i think there are more efficient instances than [] 19:15:52 yeah 19:16:55 i think there's a LogicT monad transformer 19:17:04 oerjan: hmm, are monad instances uniquely determined? i suspect not, but can't think of a counterexample :) 19:17:04 :t LogicT 19:17:05 forall a (m :: * -> *). (forall r. (a -> m r -> m r) -> m r -> m r) -> LogicT m a 19:17:07 I know Functor is 19:17:36 elliott: heh i wondered about that too, whether an Applicative can extend to two different Monads 19:18:18 oerjan: it would be weird to have Functor and Monad uniquely determined but not Applicative 19:18:20 Applicative obviously isn't 19:18:28 hmm well 19:18:31 if ZipList is a monad they aren't 19:18:39 oh that 19:18:40 but if ZipList isn't a monad, there might well be only one Monad for a given Appliactive 19:18:42 Applicative 19:18:52 er 19:18:54 ZipList is a Monad ignoring bottom >:) 19:18:58 that's a different question :P 19:19:03 ok what i was originally asking was 19:19:08 are monad instances uniquely determined for a data type 19:19:08 not 19:19:09 i'm not _entirely_ sure what it is with bottom 19:19:11 are monad instances uniquely determined for an applicative instanc 19:19:11 e 19:19:18 some data types have multiple Applicatives so they're not equivalent 19:19:25 oerjan: i do not believe you have proved that 19:19:30 ok so a simpler question 19:19:40 which one is simpler? 19:19:41 is there a type which has two Monad instances. 19:19:46 right 19:19:56 in fact there is an obvious one 19:20:08 State can be reconsidered as Reader + Writer 19:20:14 hmm 19:20:17 -!- copumpkin has changed nick to HURR_DURR. 19:20:19 that has a Monoid constraint though 19:20:25 you could make the StateList monad, though 19:20:31 and have it be Reader + Writer as well as State 19:20:39 sure but that's a constraint on the parameter, not the monadic value 19:20:39 ok, cool 19:20:45 data T a = List [a] | Maybe (Maybe a) -- Nobel prize plz 19:20:49 are the applicatives the same? 19:21:19 well I guess that's not two different instances 19:21:20 just one still. 19:21:55 elliott: no they're not the same, the applicative of State still threads the state 19:22:09 liftA2 get get 19:22:11 er 19:22:16 liftA2 (,) get get 19:22:21 or hm 19:22:41 liftA3 (,,) get (modify (+1)) get 19:23:23 wat 19:24:04 well you could always do something stupid like... 19:24:25 make >>= only apply the function to the first list element if there is one. 19:24:26 oh and of course backwards state monad has the same underlying type as the forward one, and the reversed applicative i think 19:24:33 basically a Maybe monad instance for [a] 19:24:58 :t listToMaybe 19:24:59 forall a. [a] -> Maybe a 19:25:16 -!- quintopia has quit (Ping timeout: 252 seconds). 19:26:14 elliott: Functor is special i think, because it's so weaved into parametricity; the free theorem for g :: Functor f => a -> f a is g . k = fmap k . g 19:26:26 yeah 19:29:38 data T a = List [a] | Maybe (Maybe a) -- Nobel prize plz <-- i'm not convinced that's either an Applicative or a Monad 19:30:15 there _are_ laws to fulfil, after all. 19:31:10 elliott: and that's basically what i was trying to get at with your CoContra stuff from yesterday - i expect something similar applies 19:31:29 similar to what? 19:31:47 to g . k = fmap k . g 19:32:14 Right. 19:32:22 *suspect 19:34:43 Gregor: NAG NAG NAG 19:35:11 `log zjoin.*scanl1.*diag 19:35:18 emacs has taken a liking to randomly freezing on saves for some reason. 19:35:22 -!- quintopia has joined. 19:35:35 2011-12-17.txt:05:00:42: @let zjoin = ZipList . diag . scanl1 (zipWith (flip const)) . map (getZipList) . getZipList where diag = concat . takeWhile (not . null) . map (take 1) . foldr (\x xs -> x:map (drop 1) xs) [] 19:40:02 ah okay, now I see why they say Haskell's type system is like a mini-Prolog. <-- without backtracking though, afaik 19:40:14 and no proper constraint solving 19:43:57 i suppose it does at least allow reordering constraints by taking the once it can solve immediately first 19:44:01 *ones 19:44:58 @tell Gregor !!!!!!! 19:44:59 Consider it noted. 19:46:23 oerjan: ban Gregor, he's obstructing my construction of ch2 19:46:32 obstructing my construction so induction has no suction 19:52:00 oerjan: btw i think the word you're looking for is "woven" :P 19:55:39 despite your request, it's quite for the best, not to be too sure it should be the cure to ban the man 19:57:03 what 19:57:05 also 19:57:11 ur the one who complaininged abotu the log formats 19:57:13 ings 19:58:48 oh i see, this obligates me to institute a cruel and unusual regime 19:59:01 -!- Ngevd has joined. 19:59:08 no, you've already done that part 19:59:14 oh right 19:59:18 Hello! 19:59:51 hellooooo! :3 20:02:31 "Syntax error: Unknown instruction" Yeah, but WHICH ONE?! Who implemented this? Oh wait, I did |3 I seriously annoy myself sometimes *giggles in a somewhat silly way* 20:03:14 i 20:03:51 what 20:03:57 what is |3 meant to mean 20:04:13 I keep forgetting Ron Paul is a serious politician 20:04:14 * Phantom_Hoover is terrified of what he may find out, but asks out of curiosity. 20:04:29 Ngevd: Don't worry, he isn't. 20:05:03 |3 is an emoticon, like a >.< face or -_- but with cat-face 20:05:06 -!- augur has quit (Remote host closed the connection). 20:05:25 Frooxius: I don't believe you. 20:05:37 it's clearly like a pipe on the 3rd file descriptor or something. 20:05:49 Well it can have multiple meanings 20:05:52 Frooxius......................... 20:06:00 What? Oo 20:06:11 is it like a robot cat 20:06:23 because that is the only way that could conceivably look like a cat 20:06:32 yeah, that too probably 20:07:35 It's like that guy in Star Trek TNG, with the weird sunglassesd 20:08:07 geordi 20:08:17 Possibly 20:08:30 it's cat-geordi 20:08:32 I don't really watch Star Trek enough to have ever seen a full episode 20:08:42 Geordicat 20:23:00 Odocat. 20:23:05 (It is a very smug cat.) 20:25:30 ah yes https://en.wikipedia.org/wiki/Tupper%27s_self-referential_formula <-- that's not actually a quine, since the actual bitmap is given in k to be supplied separately 20:26:29 i recall someone made a better one somewhere that was more like an actual quine 20:26:52 * oerjan swats Vorpal in absentia for being absent -----### 20:26:59 swat Gregor for being absent pls 20:27:07 but yeah that thing is STUPID 20:27:19 * oerjan swats Gregor for being absent -----### 20:29:30 For some bizarre reason, I keep thinking that "Euler" begins with J <-- presumably then you are pronouncing it with an english eu, not a german one 20:29:41 a german one sounds more like oi in oil 20:29:52 i know its oiler but ewler sounds so much better 20:30:04 no it doesn't :P 20:30:16 oerjan, I don't make this mistake with, e.g., euthanasia 20:34:59 ais523: you missed a couple spams 20:35:32 -!- sebbu2 has joined. 20:35:33 -!- sebbu2 has quit (Changing host). 20:35:33 -!- sebbu2 has joined. 20:36:38 -!- sebbu has quit (Ping timeout: 240 seconds). 20:36:46 oerjan: seems Keymaker got them 20:37:19 heh 20:37:22 i know its oiler but ewler sounds so much better 20:37:25 Excuse me wrong. 20:37:43 Although it's not as bad as people who pronounce Gauss as 'goss'. 20:37:49 gorse 20:40:02 http://upload.wikimedia.org/wikipedia/commons/a/a1/De-carlfriedrichgauss.ogg 20:40:07 you should say his full name like this always 20:40:28 -!- nooga has joined. 20:41:14 oh it's 20:41:15 gouse 20:41:18 i say gorse 20:41:19 mentally 20:41:22 gorse and ewler 20:41:27 there's a gauss in the house 20:41:30 well 20:41:33 Phantom_Hoover: i don't actually say ewler 20:41:34 i say 20:41:36 youwler 20:41:39 wtf gorse why 20:41:42 oh wait you're british. 20:41:44 nevermind 20:41:52 au is like 20:41:53 or 20:41:54 gorse 20:41:58 I bet you say saw with an r don't you. 20:42:00 asshole 20:42:29 how can you rationalize that to make any sense at all? 20:42:41 like... what is the thought process behind adding random r's to words that don't have r's 20:42:44 * elliott just records him saying these things instead of trying to explain them 20:42:45 also 20:42:46 dude 20:42:54 http://en.wikipedia.org/wiki/Rhotic_and_non-rhotic_accents 20:43:10 I see 20:44:54 but that doesn't really explain why 20:44:57 saw has an r in it 20:44:59 when there's no r 20:45:00 in it. 20:45:12 kallisti: I think that's the intrusive r 20:45:37 It doesn't have an r in it. People with a non-rhotic accent just think it sounds the same as its nearest equivalent with an r 20:46:38 what? 20:47:07 -!- sebbu2 has quit (Read error: Connection reset by peer). 20:47:13 Sigh, microphone on this doesn't work. 20:47:29 Get Ngevd to do it. 20:47:36 Science dictates that your accents are identical. 20:47:41 -!- sebbu2 has joined. 20:47:42 -!- sebbu2 has quit (Changing host). 20:47:42 -!- sebbu2 has joined. 20:48:11 Ngevd: what is its nearest equivalent? 20:48:15 sore 20:48:20 oh... 20:48:42 Saw and sore sound the same; so, amusingly, do pawn and porn. 20:48:58 wouldn't a non-rhotic accent pronounce that as... saw without an r? I don't think I understand why a non-rhotic accent would add an r there. 20:49:31 Phantom_Hoover: People saying "pawn shop" will never not make me think "HOW DOES DECENT SOCIETY ALLOW OUR ACCENTS TO DO THIS TO US". 20:49:50 kallisti: Protip: Thinking of it as "adding an r" in places won't help 20:49:53 * kallisti didn't know that pawn and porn sounded the same. 20:50:08 elliott: but... that's what is happening. 20:50:17 you want me to unthink what is happening? 20:50:33 sheesh, just talk like Americans: problem solved. 20:50:45 Merry, Mary, Marry 20:50:50 just switch accents depending on which of porn or pawn you're saying 20:51:25 kallisti, *sigh*. 20:51:41 rs extend and... round off vowels. 20:51:48 elliott: so basically "non-rhotic" means "add r's to things." non-intuitively. got it. 20:51:56 kallisti: Nope. 20:52:00 You really are an idiot. 20:52:01 http://en.wikipedia.org/wiki/Rhotic_and_non-rhotic_accents 20:52:31 It means that rs before consonants aren't pronounced, and instead apply the aforementioned transform to the preceding vowel. 20:52:32 yes I read that. 20:52:52 The result of this is that 'or' sounds like 'aw'. 20:53:44 that doesn't really explain anything though. so "aw" becomes "awr"? 20:53:46 http://en.wikipedia.org/wiki/Linking_and_intrusive_R 20:54:10 oh hi. 20:54:56 No, you twat. 20:55:01 'aw' stays as 'aw'. 20:55:14 Because 'or' now sounds like 'aw', 'or' and 'aw' sound the same. 20:55:19 This is ridiculously simple. 20:55:22 Phantom_Hoover: ^ 20:55:22 so "awr" 20:55:28 with an r 20:55:31 ? 20:55:38 Jesus christ you really are an idiot. 20:55:42 The whole point of non-rhotic is that there's no r's 20:55:47 They both sound like 'aw'. 20:55:49 rho is Greek for "r" 20:55:50 Ngevd, um no? 20:55:56 Ngevd: ^ 20:56:05 'r' is still present if not followed by a consonant. 20:56:34 repeating what non-rhotic means is not going to help explain anything. 20:57:19 Yes, but I have explained precisely what the deal is with 'sore' and 'saw', and you have apparently not listened to a word I said. 20:57:28 oerjan, do you see the problem with explaining things to kallisti? 20:58:11 http://en.wikipedia.org/wiki/Linking_and_intrusive_R explains it perfectly 20:58:27 Phantom_Hoover: *MWAHAHAHA* 20:59:05 -!- HURR_DURR has changed nick to copumpkin. 20:59:54 basically in some non-rhotic accents an /r/ is added between two consecutive vowel sounds and other weird places. 21:00:15 and that's just... how it works. it can not be explained by the removal of /r/ sounds because that makes /no fucking sense/ 21:00:41 That's right! kallisti has figured it out! 21:01:02 I'm calling up Jimbo Wales and telling him his Wikipedia is wrong; some guy on the internet knows it makes no fucking sense. 21:01:16 it can be explained by the removal of /r/ sounds in some positions, followed by analogous insertion of r in the opposite positions 21:01:19 elliott: Wikipedia doesn't disagree with what I just said? 21:01:25 oerjan: yes. 21:01:48 kallisti, you know, what makes you an idiot isn't any particular stupidity; it's your complete inability to admit that you may not understand something. 21:01:56 ? 21:01:56 I think I know less about rhotic accents now than I have ever known before 21:02:16 Whenever you don't quite see how something fits together, you decide it's probably wrong, and then make it a point of pride to prove this. 21:02:20 `addquote I think I know less about rhotic accents now than I have ever known before 21:02:23 Phantom_Hoover: no 21:02:25 792) I think I know less about rhotic accents now than I have ever known before 21:02:48 I never knew anything about rhotic accents, and now I still know nothing about them. *happy* 21:03:14 olsner: think of it as /r/ gradually changing from a phoneme into a non-phonemic way of separating adjacent vowels 21:03:36 kallisti, yes, *you do*. 21:03:56 with the change being/stopping at different stages in different dialects. 21:04:04 If you'd just have a little humility from time to time and accept that you don't know everything, you might actually know a lot more than you do. 21:04:21 Phantom_Hoover: I don't know everything, obviously. 21:04:52 But instead you pretend that you do, or that you understand things just as well as the person explaining it, and they get frustrated and you get steadily more annoying as time moves on. 21:06:05 Phantom_Hoover: depends on the subject. for example, I'm fully aware of what a rhotic consonant is, and when it's being placed in weirds it normally doesn't go in. 21:06:39 kallisti, oh? Then why did you need to read that WP article? 21:06:46 Surely you knew everything it contained beforehand? 21:07:09 Phantom_Hoover: hey stop leaping to conclusions about other people's behavior! oh wait... 21:07:28 not everything no. I clicked it to learn more details. But I had a general idea of what a non-rhotic accent was beforehand, but was still confused by the sudden insertion of rhotic consonants. 21:08:10 * elliott notes that " I bet you say saw with an r don't you. asshole how can you rationalize that to make any sense at all? like... what is the thought process behind adding random r's to words that don't have r's" does not really sound like someone with an understanding of rhoticity, without actually getting involved in this trainwreck through cunning use of /me. 21:09:36 co-cromulent should be a word 21:09:48 kallisti, and yet you approached it with an air of smug pedantry, not confusion. 21:09:51 not quite sure what it means though 21:10:09 -!- iconmaster[1] has quit (Quit: Ayup, this is a quit message.). 21:10:30 -!- oerjan has set topic: Welcome to the world championship in conclusion leaping | This channel Copywrong 0 YOLD Rogger Sarcridh - All lights reversed (Except for things copyrighted by Gregor Richards) | http://codu.org/logs/_esoteric/. 21:10:33 Phantom_Hoover: I'm generally not confused when I don't know everything. ??? 21:10:43 this is the normal state of affairs. 21:10:48 but sure 21:10:53 I sound smug. often. 21:10:56 * oerjan has this feeling that was a bad idea 21:10:58 not everything no. I clicked it to learn more details. But I had a general idea of what a non-rhotic accent was beforehand, but was still confused by the sudden insertion of rhotic consonants. 21:11:14 Can you please, *please* try to check what you say for consistency? 21:11:57 -!- elliott has set topic: Welcome to the world championship in oerjan being as passive-aggressively judgemental as he possibly can | http://codu.org/logs/_esoteric/. 21:12:00 Phantom_Hoover: can't be arsed. 21:12:31 good world championship for oerjan, as he is (by definition?) the only contestant 21:13:13 I KNEW IT 21:13:18 Very good. Can you now concede the discussion? 21:13:26 imagine if there weren't jokes to deflect criticism with 21:13:33 the human race would be so fucked 21:13:34 Welcome to the world championship in passive-aggressively communicating only through /topic 21:13:51 Phantom_Hoover: I see what you're saying though. It makes sense. I can often be smug. Is that what I'm supposed to concede? then yes. 21:14:00 -!- oerjan has set topic: Welcome to the world championship in recursive passive aggression | http://codu.org/logs/_esoteric/. 21:14:20 I think I was expecting a different concession 21:14:27 kallisti, OK, I'm sorry; I forgot that your brain is context-free. 21:14:40 Phantom_Hoover: depends on how much sleep I've had. :P 21:14:47 It's not fair to argue with someone with such a condition when I have a fully-functioning long-term memory. 21:15:43 -!- pikhq has quit (Ping timeout: 248 seconds). 21:16:02 -!- zzo38 has joined. 21:16:09 Phantom_Hoover: I think perhaps I don't take a moment to consider that I don't have all the information before forming conclusions. Is this what you mean? 21:17:37 That is a suitably flattering way of putting "I am so arrogant that I assume that things are stupid even when people who know much more about them than me tell me otherwise". 21:18:00 -!- oerjan has set topic: Welcome to the world championship in recursive world championships | http://codu.org/logs/_esoteric/. 21:18:19 not passive-aggressive world championships? 21:18:19 -!- Phantom_Hoover has set topic: Welcome to the world champion | http://codu.org/logs/_esoteric/. 21:18:32 I mean, when did anything turn recursive anyway? 21:18:39 olsner: we had to expand due to great demand 21:19:35 olsner, when we remembered that we're a programming channel, so recursion jokes are required. 21:19:53 Phantom_Hoover: I... still think it's stupid. But at least understand how it happens. 21:19:55 When I saw xkcd 132 for the first time, the only guitar hero I had played was 3, which has a metallica song 21:20:11 olsner: when elliott berated me for berating Phantom_Hoover for berating kallisti 21:20:28 oerjan is my knight in shining armor. 21:20:31 i wasn't being passive-aggressive though, i mentioned you directly by name 21:20:32 always coming to my rescue. 21:20:44 Phantom_Hoover: but... adding the word recursion doesn't necessarily make it a recursion joke 21:20:46 elliott: ah. sorry about that. 21:20:57 olsner, I'm sorry, are you new to recursion jokes? 21:21:08 elliott: i may not be entirely sure about the term 21:21:12 You seem to be under the impression that they're meant to be funny, or even make sense. 21:21:52 yes, I expect such things of jokes 21:22:04 not making sense, but being funny, I expect of them 21:22:43 Phantom_Hoover: It makes sense, since you ignore the letter r and /r/ just becomes this thing you put between consecutive vowels. But still "non-rhotic" is a poor name for such a thing because it /adds/ rhotic consonants. The name is inherently contradictory and that's why I thought it was stupid. 21:22:43 Phantom_Hoover: We should do induction jokes instead? 21:22:55 actually already my first topic change was recursive, as i certainly included myself in the reference 21:22:57 When you type "induction" into Google it should say "did you mean: inductio". 21:23:05 Inductio! 21:23:07 Until it ends up at "did you mean: base case". 21:23:24 Phantom_Hoover: Sounds like a Harry Potter spell. 21:23:37 (I:[NDUCTION]) 21:23:51 If you can do a spell to one person, and you can do a spell to someone next to them if you've already done it to them, then you can use inductio to do it to the whole world simultaneously. 21:23:57 Or should that be (I : [N D U C T I O N]) 21:24:13 Phantom_Hoover: Is that an Inception joke (you will die if it is). 21:24:32 no I think it's a linked list joke. 21:24:33 You just made a crappy recursion joke with induction! 21:24:35 if that's even possible. 21:24:38 Recursion jokes are meant to be recursion jokes. 21:24:39 I can do them too! 21:24:47 Do you think a color specification for printing file, should be: CMYK + a value to use on grayscale-only printers + either black/white/normal to select what happens on pure black/white printer 21:25:09 if this recursion joke were funny, it would be a recursion joke, but as it isn't it's just a joke 21:25:13 Yo dawg I heard you like induction so we put an i in your nduction so you can pattern match while you recurse. 21:25:15 see, people, you need base cases! 21:25:22 ais523: please op me 21:25:32 you all know what you have done 21:25:33 elliott: who are you planning to kick/ban? 21:25:34 ais523, no, as it isn't it's just a recursion reference. 21:25:40 zzo38: why would you not just calculate the brightness of the RGB value for a grayscale printer? Hmm, I guess that doesn't always turn out perfectly. 21:25:49 ais523: you, oerjan and Phantom_Hoover, but I might let you back in after a few minutes 21:26:02 * elliott wonders what answer to that question would actually get him opped. 21:26:10 zzo38: but it sounds as though you have basically two distinct images in one file. How would you deal with such a file in an image editor, for example? 21:26:11 zzo38: what about a CGYRMBK printer? 21:26:24 ais523: What is a CGYRMBK printer? 21:26:26 elliott: I'm not sure there is one, but it at least makes me curious 21:26:38 zzo38: a printer that uses six colors of ink, plus black as an optimisation 21:26:45 most people see, say, a cyan+yellow mix as green 21:26:53 but the exact mix is slightly different for different people's eyes 21:27:02 and for a tetrachromat, you might not be able to do it at all 21:27:13 so using six channels rather than three makes sure you can control the color a lot more carefully 21:27:28 although I guess it's only used in really high-end printing 21:27:29 they should just use one channel for every possible wavelength 21:27:40 elliott: the problem is finding one /ink/ for every possible wavelength 21:28:01 elliott: the best answer is probably not to mention anyone by name.. 21:28:02 black ink mixed with a chemical that induces color blindness 21:28:03 Yes; printer techonology not work well if even intended for tetrachomat and so on; but computer display might be able to make one working for many wavelengths providing very high quality display of light 21:28:39 kallisti: well i left you off the list just in case 21:29:12 here's a good answer: 21:29:24 I suppose CGYRMBK would still be only high end printing though. I am not sure what happen if you want to print such a document on such a printer. Possibly you would just make up a new special command for this kind of printers 21:29:42 * kallisti would probably not ban very many people, but would have banned lament (or whoever he was) when he was literally just spamming a single number for pages. 21:29:49 this is just common sense. 21:29:51 that was mathnerd 21:29:53 Since the DVI format allows you to use whatever new kind of special commands you want to make up 21:29:56 anyway, if we're using one channel for each possible wavelength 21:30:02 what wavelength do we use for #esoteric? 21:30:04 also i assume ais523 knew i meant a one-time oppage 21:30:08 ais523: octarine 21:30:12 yes, fair enough assumption 21:30:17 elliott: what's that in nanometres? 21:30:22 ais523: i 21:30:25 ais523, 567nm. 21:30:54 that was i as in i \in C 21:31:18 elliott: I figured it eventually, although it took a few tries 21:31:55 -!- mr_schlauch has joined. 21:32:01 `welcome mr_schlauch 21:32:05 mr_schlauch: 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 21:32:33 gah, I can't read the wololo in the hostname as anything but an Age of Empires reference 21:32:59 freebnc.net? that sounds secur 21:32:59 e 21:33:14 what would the b stand for there? 21:33:38 Phantom_Hoover: I see you've tactfully disappeared from this thread of discussion. :P 21:33:41 ais523: err? 21:33:50 elliott: I know what a VNC is, but not a BNC 21:33:57 kallisti: but so has mr_schlauch 21:34:02 ais523: bouncer 21:34:08 ah, I see 21:34:22 free bouncer -> give your irc password to random people with no reason to be nice to you :) 21:34:28 kallisti, yes, for much the same reasons as my tactful disappearance from conversations with brick walls. 21:34:36 elliott: not identified 21:34:38 so no password being given 21:34:46 ais523: that doesn't make the idea of a free bnc any more secure 21:35:02 Phantom_Hoover: but you'll leave the walls offended! 21:35:25 ais523, they might not let me lean on them! 21:36:57 Phantom_Hoover: I was under the impression I had conceded somewhat. and the topic interests me because I do take a conscious effort to learn and grow as a person. I agree that I can be stubborn but I believe there's a bit of an attribution bias going on. 21:37:15 breaking news Phantom_Hoover admits to wanting to lean on kallisti 21:37:19 my ship....... has sailed.................... 21:37:37 lol 21:37:40 kallisti makes conscious effort to lean and grow as a person 21:37:45 he is a pea plant?? 21:37:49 yes. 21:38:02 Mendel would be proud. 21:38:07 he is my godhead. 21:38:51 Phantom_Hoover: hmm, or maybe not attribution bias, but a lack of self-awareness in how I present myself. 21:39:31 `addquote oh right: Frooxius, you wouldn't happen to live in Hexham, would you? No, sorry. phew How about Finland? Why would I live there? That's a *very* good question. Why would anyone? 21:39:33 793) oh right: Frooxius, you wouldn't happen to live in Hexham, would you? No, sorry. phew How about Finland? Why would I live there? That's a *very* good question. Why would anyone? 21:39:47 WHATDIDIDO? Oo 21:39:50 i was gonna addquote that at the time 21:39:52 but got too lazy 21:40:00 Frooxius: terrible things 21:40:01 prepare to be banned 21:40:04 nuuuuuuu 21:40:09 * Frooxius flails and runs in funny shapes 21:40:17 The fact that you seem to define "a conscious effort to learn and grow as a person" as "stubbornly refusing to let go of any misunderstanding when people try to explain things to me" says it all, really. 21:40:29 what are funny shapes 21:41:04 Octahedra 21:41:05 Lemonoid 21:41:19 triangulum bisectoids 21:41:25 rhombidodecahedron 21:41:30 dual of a pentagonal antiprism 21:41:42 alexander horned potatogons 21:41:46 Phantom_Hoover: not really, no. 21:42:03 alexander horned potatogons 21:42:03 vigintihedra 21:42:09 Phantom_Hoover: thanks, i know what to name my child now 21:42:26 Alexander Horned Potatogon Hird? 21:42:33 What if the child is female? 21:42:40 Alex is a female name. 21:42:55 But Alexander is not. 21:43:03 it could be! 21:43:09 Alexia is a female name, and a neurological condition. 21:43:29 In fact, if I ever have a daughter I will name her that and then snigger whenever I hear her name. 21:43:42 File under "why Phantom_Hoover must never reproduce". 21:43:46 I thought it was Alexandra? I guess Alexis could be a name too. 21:44:05 — Elliott "I will name my child Azimuth" Hird. 21:44:08 Phantom_Hoover: If they're a girl I'll just swap it around: Potatogon Horned Alexander Hird. 21:44:09 kallisti, Alexandria. 21:44:13 SHUT UP AZIMUTH IS A COOL NAME 21:44:15 (That's a city.) 21:44:15 although 21:44:18 not as cool as 21:44:20 Phantom_Hoover: o rly? :P 21:44:22 uh 21:44:28 kallisti, die, seriously. 21:44:29 nope it's the coolest 21:44:50 Phantom_Hoover: rest assured I know Alexandria is a city because it exists in the United States as well. 21:44:54 otherwise I would be oblivious. 21:44:56 Phantom_Hoover: im naming my kid Orly 21:45:10 middle name 21:45:11 Nowai 21:45:14 because 21:45:19 iw ant my child to grow up with a healthy sense of self-loathing 21:45:20 and despair 21:45:36 Wouldn't Alexander Horned Potatogon have the same effect? 21:45:58 * kallisti doesn't have to worry about naming his children because he plans to not have any ever. 21:46:01 yes, this is for my second kid 21:46:13 kallisti: so controversial 21:46:14 (insert obvious jokes, ha ha ha ) 21:46:25 Phantom_Hoover: alexander horned potatogon orly nowai hird 21:46:34 fuck it crossed the line of terrible back into awesome 21:46:40 they can just sign things as -AHPON 21:46:46 -!- elliott has changed nick to ahpon. 21:46:54 what ahpon 21:46:56 *ahponh 21:47:02 ahpon could easily be their pseudonym as an electronic or hip hop artist. 21:47:09 Phantom_Hoover: alexander horned potatogon orly nowai 21:47:18 WHATDIDIDO? Oo <-- you got innocently involved in a driveby quoting accident 21:47:34 "Bahahahaha nobody will guess who I am if I refer to myself by my initials!" 21:47:44 Phantom_Hoover: but 21:47:44 ahpon 21:47:45 si cool name 21:47:54 WHATDIDIDONOW? Oo 21:48:01 ahpon: you look stupider with that name 21:48:12 `words --eng-gb --canadia 25 21:48:16 Frooxius: packed too many words into one and lost your nose 21:48:18 -!- ahpon has changed nick to elliott. 21:48:18 engree meter noncarbering obia conocon nitin aftwott diblasmil stalatickli declack chic sweel exill tadtitin gasta psychon unproposte baffice scoholistico hetteraph archille dussarct wipentit weitmen treu 21:48:24 engree 21:48:26 -!- elliott has changed nick to engree. 21:48:30 * Frooxius goes to search for his nose 21:48:50 What about Stramillicon Tibia Rapunda Alexander Horned Potatogon Orly Nowai? 21:48:52 psychon is my new internet handle 21:49:16 A noncarbering declack? 21:49:20 Phantom_Hoover: that's so unproposte 21:49:32 I thought it was Alexandra? I guess Alexis could be a name too. <-- i believe in ancient times, alexis was a male name. 21:49:32 Phantom_Hoover: tibia is the best part of that 21:49:37 -!- itidus20 has joined. 21:49:39 because people will ask me like 21:49:41 why did you name your kid that 21:49:42 and i'll go 21:49:43 Probably a component of a Dussarct. 21:49:48 well tibia is my favourite body part after alll hah aha 21:49:55 Phantom_Hoover: tibia is a real thing dude........ 21:50:06 Yes? 21:50:16 Honestly, fancy not knowing what a tibia is. 21:50:24 well you are scottish 21:50:45 engree: it would be more reasonable to assume an American doesn't know what a tibia is. 21:51:08 Well yes, we do all kick each other in the shins so much that the tibia has been bred out over time. 21:51:35 Phantom_Hoover: are you unable to twist your leg joints? 21:51:54 -!- itidus21 has quit (Ping timeout: 252 seconds). 21:51:56 Why would you want to do that? 21:52:16 to do traditional folk dance of course. 21:52:21 as a scot this is important. 21:52:33 rhotic or non-rhotic folk dance? 21:52:47 the one where you add a bunch of r's, probably non-rhotic. 21:53:42 -- kallisti "gosh i'm really only smug about these things by accident" kallisti 21:54:05 only sometimes. :> 21:54:12 the rhotic or non-rhotic unladen swallow dance 21:54:42 Nitin Aftwott could be a name 21:55:23 stalatickly: prone to giggle uncontrollably when touching things in caves 21:55:31 engree: also that wasn't really smugness. 21:55:42 or when touched by caves? 21:55:43 that was a joke. ha ha 21:55:47 -!- pikhq has joined. 21:55:51 caves usually don't poke at people though 21:56:15 whatever you do, don't cross the weitmen 21:56:22 kallisti: jokes can be smug 21:56:23 I imagine this could be Nitin Aftwott's area of expertise 21:56:32 especially when they're indistinguishable from smartassery 21:56:42 and may make people more likely to see smug intent where there is none in the future! 21:56:46 Ngevds can be sleepy 21:56:49 Goodnight 21:56:51 -!- Ngevd has quit (Quit: Goodbye). 21:56:52 Ngevd: dude 21:56:52 its 21:56:53 nitin aftwott, spelunker 21:56:55 10 fucking pm 21:57:14 engree: hey at least I was being accurate! 21:57:29 it probably would be the non-rhotic one. if non-rhotic dances were a thing. 21:57:30 engree: 11 pm in CET 21:57:40 or is ngevd from hexham? 21:58:08 ... 21:58:26 olsner: i think you just outdid Vorpal 21:58:39 kallisti: regardless of style, you dance like an unproposte baffice 21:59:09 oerjan: hmm, at what? 21:59:10 oerjan: undid him how? 21:59:14 olsner: yes, ngevd is from hexham. 21:59:20 er *outdid 21:59:22 that's sort of what started the whole hexham thing. 21:59:26 olsner: obliviousness 21:59:34 oerjan: obliviousness to what? 21:59:39 ha ha ha ha ha 21:59:40 ha 21:59:44 ^ha 21:59:44 ha. ha. ha ha. ha ha ha. ha ha ha ha ha. ha ha ha ha ha ha ha ha. ha ha ha ha ha ha ha ha ha ha ha ha ha. ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha. ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha. ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha ...too much output! 21:59:47 * oerjan facepalm 22:00:10 What is that, a laughing Fibonacci? 22:00:19 whenever someone says facepalm I think of like a really cool kung fu move. 22:00:26 where you wack someone in the nose with your palm. 22:00:43 qfr: yes. 22:00:51 hmm, I don't think I ever saw the start of the hexham thing, it was already going when I first saw it 22:01:58 the hexham-helsinki-hell axis 22:02:29 engree: I guess it's wrong to be smug. unless you actually are superior because you know more! 22:02:33 hexland and finham 22:02:43 engree: this is the lesson I have learned from #esoteric 22:02:56 kallisti: well, between someone who's smug and wrong and someone who's smug and right... 22:03:08 alternatively: two wrongs, etc. 22:03:39 * oerjan passive-aggressively twiddles his thumbs 22:04:18 engree: I think I was half-right in that non-rhotic is a bit of a misnomer. But it's also not! it's craaaazy. 22:04:24 oerjan: do you really think just fidgeting and complaining whenever anything like this comes up actually accomplishes anything 22:04:48 WE WOULD ALL JUST GET ALONG IF WE NEVER EVER EXAMINED PEOPLE AND BEHAVIOURS 22:05:17 * kallisti feels that he is not not getting along with anyone right now. 22:05:17 maybe we could make the channel so you never see what anyone else writes 22:05:24 should prove conflict free 22:06:06 kallisti: I'm not not-getting-along-with-you, I'm just trying to explain why your behaviour is perceived as smug rather than eager to learn 22:06:39 engree: and now I understand. so cool. 22:07:03 :> smug face. 22:07:07 ...which is why complaining that these things are ~drama~ is way more disruptive than talking about these things. 22:07:20 drama? where? 22:09:02 also oerjan's not really disruptive. I like that he defends me (not necessarily what I'm actually saying). :D 22:09:10 therefore he is not disruptive 22:09:12 * kallisti good logic. 22:09:20 there is none. and don't take it too personally, he acts this way whenever anybody disagrees with the conduct of another, ever 22:10:13 oerjan: shame on you. 22:10:35 Zetro: oh and fuck you for being so quiet 22:10:37 xandy: you too 22:10:52 * kallisti hates everyone. rageignores everyone. 22:10:52 hmm, I don't think I ever saw the start of the hexham thing, it was already going when I first saw it 22:11:41 It was basically "Taneb shows up, mentions he's from Northumberland, I take a shot in the dark and ask him if he's from Hexham, both he and elliott have heart attacks." 22:12:06 Maybe when I sleep I become Taneb, go back in time, and act out the day as him. 22:12:23 Calculation of Chinese New Year: http://zzo38computer.cjb.net/img_14/chinese-new-year.png 22:12:29 also you have memory loss of what you did as elliott 22:12:37 which makes it way more convincing. 22:12:46 Phantom_Hoover: why did they have heart attacks? 22:13:28 olsner: What's a really small, boring town in Sweden? 22:13:33 Well, not really small. 22:13:36 Stockholm. 22:13:38 Like, pop. 10k. 22:13:47 Kinda ruraly, countrysidey-located. 22:13:49 aha, trick question: all of them! 22:13:52 Maybe has a market. 22:13:53 Ha. 22:14:00 No but seriously what's the equivalent of that, just name one. 22:14:19 Someplace people in the area will know about but people on the other side of the country might not. 22:14:24 anyway I will be making a conscious effort to not presume that I'm correct about disagreements when I don't fully understand the topic. (Note this is different from not acting smug as I don't think I can do that :P ) 22:14:28 http://en.wikipedia.org/wiki/Fagersta perhaps 22:14:43 olsner: OK, so imagine there's a guy on IRC in a small, tight-knight community who's from Fagersta. 22:15:02 maybe we could make the channel so you never see what anyone else writes 22:15:07 olsner: A few years later, someone else comes in, and everything is normal until they mention they live in Västmanland county. 22:15:10 Just /ignore *!*@* ALL 22:15:19 olsner: Someone says "Please tell me you're not from Fagersta", and they go "How did you know???". 22:15:41 actually, it's probably not that good, because people I know from fagersta allegedly run into other people from fagersta all the time 22:15:57 X-D 22:16:02 ha. ha. ha ha. 22:16:17 olsner: OK, let's put it this way: Hexham is known for having a big ol' church and a market. 22:16:19 3-order Fibonacci laugh has been permitted. 22:16:22 Västmanland, the land of vast men. 22:16:25 olsner: It's mostly houses. 22:16:28 And boring shops. 22:16:35 And boring people. 22:16:55 where I live is mostly Anytown, USA 22:16:57 olsner: And there are inexplicably two people who (a) like esolangs, (b) read Homestuck and (c) are in the same IRC channel, without (d) having ever consciously met or communicated before, ever. 22:17:03 If someone from Nowhere, Ireland turns up I will have to leave and never come back. 22:17:18 Phantom_Hoover: Oh my god, you have to ask everyone you meet whether they read Homestuck next time you end up there. 22:17:27 And carry a gun so you can shoot them. 22:17:30 It's prevention. 22:17:58 -!- ais523 has quit (Ping timeout: 240 seconds). 22:18:00 "unitary authority" is that kind of like a county? 22:18:22 oh no that's "ceremonial county" I guess one is a political entity and the other is formal/historic? 22:18:55 there is none. and don't take it too personally, he acts this way whenever anybody disagrees with the conduct of another, ever <-- i'm not really against pointing things out in a polite way, i just cannot keep from rolling my eyes at what feels like recursion of self-obliviousness. including my own. 22:19:19 oh no unitary authority is more like a state district, kind of. 22:19:27 at least in size. 22:20:10 oerjan: well, there's a difference between rolling your eyes and implying everyone else is wasting their time... if there's a recurring problem that comes up in-channel, then bringing it up is more likely to solve it than pretending it doesn't happen :P 22:20:50 * engree tends to find that the main problem with metadiscussion is that there's always somebody really loud who wants to pop all the layers away... I suspect this problem occurs in programming too :P 22:21:21 fuck this discussion. too meta. 22:21:28 this is like metametametadiscussion now. 22:21:37 This discussion is a RationalWiki trigger, can it stop? 22:21:52 discussion about the discussion about the metadiscussions 22:22:14 kallisti: My favourite thing about Stack Overflow is that they have a separate site running the same software exclusively for metadiscussion, with its /own reputation system/. 22:22:22 There are people with more meta rep than main-site rep. 22:22:33 (Nowhere, Ireland is named after a pile of stones. Seriously.) 22:22:34 You can set /meta reputation bounties/ on questions there. 22:22:35 let's go back to the main discussion, where we're just assholes to one another. 22:23:34 kallisti: Fuck you. 22:23:42 oerjan taking me seriously in 3, 2, 1... 22:24:14 engree: is there a word for when you cause something not to happen by predicting that it will happen? 22:24:17 kind of like a jinx I guess. 22:24:33 -!- pikhq has quit (*.net *.split). 22:24:33 -!- lifthrasiir has quit (*.net *.split). 22:24:33 -!- yiyus has quit (*.net *.split). 22:24:33 -!- SimonRC_ has quit (*.net *.split). 22:24:49 -!- lifthrasiir has joined. 22:25:05 kallisti: self-defeating prophecy 22:25:18 sounds good. 22:25:26 -!- pikhq has joined. 22:25:26 -!- yiyus has joined. 22:25:26 -!- SimonRC_ has joined. 22:25:41 I imagine a netsplit as like a huge storm seperated a bunch of ships.. 22:25:47 or an earthquake. 22:26:11 oerjan taking me seriously in 3, 2, 1... <-- please be more polite than that. you are getting close to my limit there. 22:26:19 -!- Zuu has joined. 22:26:20 You have a limit? 22:26:33 You'd've thought spamming the channel to the condemnation of all would cross it. 22:26:45 Phantom_Hoover: hey i _did_ ban fax. 22:26:56 oerjan, because nobody asked you to? 22:27:16 oerjan: That was a joke based on your repeated tendency to miss such in-context ironies. 22:27:35 oerjan: But yes, your limit is defined per person, and is approximately ten thousand ceilings lower for me than for most other people. 22:28:06 If you're not going to step up to the responsibility of banning e.g. blatant spammers, you really shouldn't threaten people with your op powers. 22:29:54 engree: you realize i was joking in my ^^ message? 22:30:32 oerjan, doesn't make what he said any less true. 22:31:07 oerjan: Fair enough, but the reason I missed it is that it's sufficiently similar to things you've said in the past. 22:31:10 I take my comments back. 22:31:38 hey if it needed to be said... 22:32:04 I put them back on the table! 22:32:15 SOMEONE PLEASE TAKE THESE COMMENTS I DON'T KNOW WHAT TO DO WITH THEM 22:32:31 * oerjan nails one of them up on the eastern wall 22:33:28 engree: take yer comments and shove 'em up yer ass! 22:33:59 * engree founds #esoteric-meta 22:34:04 * engree sets mode +b *!*@* #esoteric-meta 22:34:07 (I['m soorrry I 'mtired) 22:34:17 m['e to 'o 22:34:21 (not really) 22:34:27 also that MathNerd314 event was because the whole thing started so ridiculously i couldn't take it seriously. 22:34:42 -!- copumpkin has quit (Remote host closed the connection). 22:35:53 -!- DCliche has joined. 22:36:05 *n 22:36:22 it was quite an experience i must admit 22:36:42 i lost it at "i am the singularity" 22:38:10 `words 10 22:38:15 sitalk mecut ted folson leiset rehen pantauth uuiorma cyclam han 22:38:33 did freenode reset the dates on all the ban lists again 22:38:40 cyclam = pokemon 22:38:58 pantauth = pokemon 22:39:05 -!- Klisz has quit (Ping timeout: 240 seconds). 22:39:09 it's irritating when you cannot distinguish old bans from new ones 22:39:15 leiset = pharmecutical 22:39:37 what was the mathnerd event? 22:39:59 -!- FireFly has quit (Ping timeout: 248 seconds). 22:40:08 `log mathnerd.*> [0-9]*$ 22:40:14 Uuiorma Rehen is probably a finnish name 22:40:27 No output. 22:40:30 huh 22:40:52 hmm, case sensitive? lack of quoting for the space? 22:41:00 `log mathnerd.*>.[0-9]*$ 22:41:07 2011-02-18.txt:22:52:01: Hask = (->) 22:41:39 `log mathnerd...>.[0-9]*$ 22:41:45 No output. 22:41:54 `log mathnerd.*>.*[0-9]$ 22:42:01 2010-04-25.txt:21:12:09: http://www.wolframalpha.com/input/?i=%28t_1+%2B+w*t_2+%2B+w^2*t_3%29^3+%2B+%28t_1+%2B+w^2*t_2+%2B+w*t_3%29^3+with+w+%3D+e^%282+i+pi+%2F+3%29 22:42:03 `log mathnerd.*>.[0-9]+$ 22:42:10 No output. 22:42:11 Hask = (->) 22:42:14 ^^ lol 22:42:32 hm wait 22:42:58 `log mathnerd.*> 22:43:05 2010-10-30.txt:21:58:41: that has to change... I want computer typography! 22:43:31 nah obviously it never really happened. 22:43:49 oh hm 22:44:03 `log mathnerd.*i am the singularity 22:44:09 2012-01-02.txt:22:44:03: `log mathnerd.*i am the singularity 22:44:19 I mean, I get what he's trying to say, but saying that Hask is literally equal to (->) is kind of silly.`log mathnerd.*>.*\d 22:44:29 oopse 22:44:30 `log mathnerd[3].*i am the singularity 22:44:37 No output. 22:44:58 `log mathnerd.*\d\s*$ 22:45:05 2010-05-04.txt:01:54:25: !haskell flip (-) 1 2 22:45:22 `log mathnerd.*>\s*\d\s*$ 22:45:28 No output. 22:45:33 yep never happened. 22:45:46 `log (?i)mathnerd.*>\s*\d\s*$ 22:45:52 No output. 22:45:58 -!- FireFly has joined. 22:46:19 actually was that when glogbot was down? 22:46:41 I think hackego was down. 22:47:59 -!- Jafet has joined. 22:48:40 * Sgeo is sad. AW servers are so crappy, a friend's trying to get a list of all property keeps crashing a world. 22:55:49 -!- Zuu_ has joined. 22:56:33 -!- Zuu has quit (Read error: Connection reset by peer). 22:57:22 Sgeo, I would yell at you for bringing up AW, but it's pathologically fascinating. 23:00:42 back 23:01:00 Hask = (->) 23:01:00 ^^ lol 23:01:02 he's correct 23:01:04 pathological and fascinating 23:01:50 engree: the Hask category is literally equivalent to the function type? 23:02:19 kallisti: if you look at category-extras you will see the line 23:02:20 kallisti: The morphisms is, I think 23:02:22 type Hask = (->) 23:02:31 yes the morphism is the function type 23:02:36 the objects are the types. 23:03:14 a morphism is _a_ function 23:03:41 the question I ask is: are categories their morphisms? 23:03:49 this seems incorrect to me. 23:03:59 kallisti: it's surely irrlevant, as mathnerd was almost certainly explaining some signature or declaration in category-extras 23:04:02 *irrelevant 23:04:09 but in haskell 23:04:11 @src Category 23:04:11 Source not found. :( 23:04:13 yes, they are. 23:04:16 fuck you lambdabot 23:04:20 engree: ah okay. I suppose that's the flaw of taking logs out of context. 23:04:22 kallisti: it's one possible axiomatization of categories to only consider the morphisms 23:04:54 How do you define the morphisms without objects? 23:04:57 oerjan: hmmm, I suppose the set of all morphisms does contain all of the relevant information... 23:04:58 Compositions? 23:05:04 Phantom_Hoover: yes 23:05:29 (How does Hask work with functions being types?) 23:05:29 you can identify the objects with the identity morphisms 23:05:50 Phantom_Hoover: it doesn't... 23:05:52 (Are functions-as-morphisms and functions-as-types separated?) 23:06:08 Phantom_Hoover: a function is not a type 23:06:18 the morphisms are function _values_ 23:06:23 (Int -> Int) isn't a type? 23:06:31 Oh, right. 23:06:54 those category theorists should really have consulted with programmers before deciding on their terminology 23:07:35 Those programmers should really have consulted with me before trying category theory wait i am become kallisti 23:08:18 It is Cartesian closed category, it has something to do with that things 23:08:24 Phantom_Hoover: what's funny is that I never actually say things like that. 23:08:33 and if I do I'm probably joking. 23:08:40 Phantom_Hoover: as for making the set of morphisms between two objects into an object in itself, categories where you can do that nicely are called "cartesian closed categories". i'm not quite sure if Hask is one precisely or just approximately 23:08:44 hey oerjan should I read Mac Lane 23:08:48 in a self-deprecating manner, in fact. 23:09:01 engree, he had things written on him? 23:09:15 Phantom_Hoover: Shut up all the cool kids refer to the book like that. 23:09:27 kallisti, self-deprecation doesn't make being stupid cool. 23:09:42 i think the absence of genuine categorical products might mess it up slightly 23:09:50 Phantom_Hoover: that's an interesting and irrelevant point. 23:10:06 oerjan, is this _|_ again? 23:10:49 kallisti: What Phantom_Hoover is trying to say is that you can't say things with impunity to mockery by declaring them jokes. (You're welcome, this would have taken 5 hours to communicate.) 23:11:30 engree: since when do I even say "oh I am an expert on this matter this random person should have consulted me" without it being obviously in the context of some kind of humor? 23:12:40 hey oerjan should I read Mac Lane <-- well although it's a standard recommendation, i haven't done so myself, so... 23:12:43 kallisti: That question should be directed at Phantom_Hoover, I just wanted to skip 5 hours of tedium. 23:13:07 Phantom_Hoover: yeah iirc 23:13:12 oerjan: I was hoping you'd read it so you could give me an authoritative warning it'd go way over my head :) 23:13:20 Won't Mac Lane be approaching it from a topological angle? 23:13:24 o.O BitBucket has an option to do git 23:13:43 The reason I'm using BitBucket is because Gregor has me thinking that it may be easier 23:13:51 Erm, that hg may be easier 23:14:02 engree: hm it probably has a lot of advanced examples, at least 23:14:22 oerjan: well the first i heard about mac lane was people saying it was just too much for them :P 23:14:36 but then, it's likely most mathematicians don't know all of them either :P 23:14:36 people who _actually know mathematics_!! 23:14:44 Chapter VI. Monads and Algebras. 23:14:44 Chapter VII. Monoids. 23:14:46 good ordering 23:15:06 Chapter VII: Monoids. A monoid is just a monad not necessarily in the category of endofunctors, what's the problem? 23:15:46 Endomorphisms of a category make a monoid too 23:18:07 -!- Patashu has joined. 23:18:17 Phantom_Hoover: One day I will know more category theory than you and THEN the tables will be TURNED. 23:18:21 engree: i guess this may be one book where you're not expect to get all the way through :P 23:18:25 *ed 23:18:32 engree, I don't really know category theory? 23:18:42 one day, coming now 23:18:47 Phantom_Hoover: THAT IS WHY IT WILL BE EXCEEDINGLY EASY 23:19:09 I'm kind of baffled why you thought I did. 23:19:13 I didn't. 23:19:16 * engree would prefer Categories for the Working Magician. 23:19:50 hmm, page 1 doesn't look so bad 23:19:57 * engree is checking the amazon preview :P 23:20:12 Behold, as I saw a functor in half! 23:20:58 "whenever possible we write f x and not f(x), omitting unnecessary parentheses." 23:21:07 oerjan: category theory was evidently doomed to end up in haskell from the start 23:21:20 obviously 23:22:00 huh this is simpler than i expected 23:22:01 although 23:22:02 I'm fairly sure the topology book with the surprise category theory was a graduate texts in mathematics book too. 23:22:03 it is only page 4 23:22:29 i really don't like these diagrams though :'( 23:22:38 they should make linear notation for them :P 23:22:52 engree: what, the diagrams are like half the point 23:23:12 The whole point of the diagrams is that it gets rid of inelegant linear notation and lets you go from page to brain a lot faster. 23:24:20 trying to grasp the snake lemma without diagrams - not pretty. 23:25:18 not that i remember what the snake lemma actually said. 23:25:26 oerjan: Phantom_Hoover: yeah but they're ugly :P 23:25:48 oerjan: so what did you read to learn cat theory (as i will henceforth call it, forever) 23:25:50 I've always found them quite pretty. 23:27:00 engree: i think it was partly osmosis. also homological algebra and algebraic topology books 23:27:26 * kallisti learned programming by osmosis. 23:27:29 I learn by Wikipedia and by Haskell and by ask people question in this channel 23:28:02 * engree tries the last one 23:28:06 oerjan: what is category theory 23:28:07 and of course the K-theory used in my PhD 23:28:09 in fact I probably spent about 6 months slowly reading things about Perl before I ever actually wrote a real program. 23:28:40 http://en.wikipedia.org/wiki/It%27s_My_Turn_(film)#Accurate_Math_on_Film I'll watch this and learn the snake lemma 23:28:45 * engree tries the last one 23:28:50 Algebraic topology books? 23:29:08 Patashu: ask people question in this channel 23:29:10 er 23:29:11 Phantom_Hoover 23:29:31 About algebraic topology? 23:29:42 engree: ask me all of your category theory questions. I am the expert. 23:29:52 wait, grothendieck literally lives in the mountains in the middle of nowhere? 23:29:55 awesome 23:30:35 NationalityNone (Stateless) 23:30:36 wait, how did he manage that one 23:31:45 "In January 2010, Grothendieck wrote a letter to Luc Illusie. In this "Déclaration d'intention de non-publication", he states that essentially all materials that have been published in his absence have been done without his permission. He asks that none of his work should be reproduced in whole or in part, and even further that libraries containing such copies of his work remove them." 23:31:50 ... 23:32:17 engree: Some countries actually state that you have the right to become stateless. 23:32:26 engree: for example: did you know that a category is a set of objects, a set of morphisms from one source object to another target object, and an associative composition operator with an identity element on those morphisms? 23:32:27 Phantom_Hoover: You didn't hear about that? 23:32:36 engree: yes you can learn these things and more by asking me questions. 23:32:41 Why would I have? 23:32:50 Phantom_Hoover: Well, it came up in here. :p 23:32:59 grr, the article doesn't explain how he became stateles 23:32:59 s 23:33:08 * engree considers citation needing it 23:33:23 http://en.wikipedia.org/wiki/Talk:Alexander_Grothendieck#Statelessness heh 23:34:01 You just CAN'T do cohomology of groups just after explaining Snake Lemma :D 23:34:02 killingbuddha1 2 weeks ago 23:34:07 Phantom_Hoover: help, I wandered into some bizarro youtube 23:34:16 Oh dear. 23:34:16 everyone has a phd in mathematics 23:34:29 It's also quite possible, given his age, that his citizenship is from a non-existant country. 23:34:32 @belyi3 Valid point: how do these things come about? The answer is: from algebraic topology. Starting with Euler characteristic and Betti numbers of surfaces, one generalises to homology and cohomology groups. Then some very smart people realised that the underlying operations in homological & cohomological computations can be abstractised so that only the algebraic remnants remain. So this is what you get. 23:34:32 Like you, I'd love to see a more historically motivated account of cohomology. 23:34:32 abc75 1 year ago 23:34:32 Unknown command, try @list 23:34:39 Phantom_Hoover: HELP... 23:35:00 pikhq: born in germany, lives in france? doubt it 23:35:01 -!- monqy has joined. 23:35:13 That was the context in which the surprise cat theory came. 23:35:53 Or something; I was kind of sleepy by that point and I had an interview the next day. 23:36:02 engree: maybe it has something to do with East/West Germany? 23:36:05 engree: Germany runs under jus sanguinis, and didn't grant citizenship to people who would otherwise be born stateless until more recently than that. 23:36:11 pikhq: fair enough 23:36:14 wtf, http://www.grothendieckcircle.org/ actually removed links to his papers 23:36:29 (I should go on long trips with only textbooks to entertain me more; I learnt a lot on that trip.) 23:37:33 -!- Zuu_ has quit (Ping timeout: 252 seconds). 23:37:45 -!- Zuu has joined. 23:38:46 Oh, his mother was German. 23:39:57 There's no way that he was *born* stateless, and his original citizenship would not have ceased to be in effect... 23:41:10 "In 1939 Grothendieck came to France and lived in various camps for displaced persons with his mother, first at the Camp de Rieucros, and subsequently lived for the remainder of the war in the village of Le Chambon-sur-Lignon, where he was sheltered and hidden in local boarding-houses or pensions." -- maybe this? 23:41:57 Grothendieck is hilarious 23:42:31 Hmm, wait. The Nazis denaturalised people. 23:43:06 And the law reinstating the citizenships only reinstates citizenship on people who take residence in Germany after 1945. 23:43:35 So, he could actually have become stateless because of the Nazis, and continue to be stateless by merit of never having gone back to Germany. 23:43:47 You just CAN'T do cohomology of groups just after explaining Snake Lemma :D <-- iirc that is correct, since the snake lemma is a building block several steps before defining (co)homology 23:44:11 So, yes, it is perfectly feasible for him to be stateless. 23:44:22 And be able to gain a citizenship trivially. 23:44:50 does stateless even have a practical impact on one's life? 23:44:53 +ness 23:45:04 kallisti: absolutely 23:45:24 kallisti: You need to do some really annoying paperwork to do a few things. 23:45:31 e.g. get a passport. 23:45:41 you're still subject to all the laws in the area you reside in. 23:45:50 so it basically just makes life more inconvenient. 23:45:57 Someone made a list of the most difficult and complicated kind of mathematics, and "motivic cohomology" was at the top. 23:46:45 pikhq: I doubt you could get a job while stateless? 23:46:49 This status is largely because of post-WWII international law which requires nations to treat stateless people that happen to be in there country as, essentially, legal immigrants. 23:47:00 s/there/their/ 23:48:07 so what did the nazis actually do 23:48:17 strip german citizenship of people they didn't like? 23:48:26 Yes. 23:48:27 well, jews at least 23:48:44 oerjan: "Anyone they like" is by far the more accurate classification. 23:48:52 okay 23:48:58 Jews were merely a significant proportion of that set. 23:49:10 Erm. 23:49:12 Didn't like 23:49:12 XD 23:49:22 "fuck this country im out" --hilter 23:49:26 "WE HAVE REVOKED THE CITIZENSHIP OF HITLER" :P 23:49:27 the former worked as well. 23:49:36 It would provide a really convenient country for them to bomb, mind you. 23:49:57 "anyone they like" can mean that they chose whomever they wanted to be denaturalized. 23:50:48 anyoned they liked to denaturalize. :P 23:52:30 him iiy nam eiska llisti 23:54:16 oerjan: there's nothing about the set of morphisms of a category that requires it to form a bijective mapping right? 23:54:27 or is that required? 23:56:09 wat 23:56:39 so, no. 23:56:40 a bijective mapping to what 23:57:08 also, it's not required to be a set, it can be a proper class 23:57:26 a bijective mapping from the object set to the object set. 23:57:29 and, right. 23:57:51 no. for one thing, the objects are not required to be conceptual sets. 23:58:09 er no I mean... 23:58:20 the morphisms aren't acting on sets of objects themselves. 23:58:53 indeed not. such a category is called "concrete". 23:59:19 there is otherwise no requirement that morphisms be _functions_ 23:59:37 okay here's a better question: a single morphism can act on multiple objects in the category, yes or no? 23:59:46 or is there one source object 23:59:49 and one target object 23:59:55 no. a single morphism always has exactly one. 23:59:59 of each.