00:12:58 -!- Jakob__ has joined. 00:14:06 -!- Jakob__ has quit (Client Quit). 00:26:49 -!- Leb has joined. 00:27:17 !bfjoust loop ({<})%-1 00:27:27 ​Score for Leb_loop: 0.0 00:40:55 that's just < 00:41:04 afaik. 00:44:49 !bfjoust +[>+]<[-] 00:44:49 ​Use: !bfjoust . Scoreboard, programs, and a description of score calculation are at http://codu.org/eso/bfjoust/ 00:44:57 !bfjoust Useless +[>+]<[-] 00:45:00 ​Score for FreeFull_Useless: 0.0 00:45:31 0 wins! 00:46:11 There's a Charlie the Unicorn 4?!? 00:53:22 !bfjoust loop ((()*-1)*-1{.}((((()*-1)*-1{.}(()*-1)*-1)%-1)*-1)*-1)%-1 00:54:57 -!- edwardk has joined. 00:57:09 There's a second one? 01:00:38 ok, so he dealt with the first one by overflow, but nesting it means that solution is not fast enough. 01:01:11 I see a simple solution :p 01:04:13 yup, there is, but it's not implemented yet. Which means it's still going ( http://codu.org/eso/bfjoust/breakdown.txt ), so I think that means someone needs to manually stop it before it's usable again 01:05:30 Are there good languages [as an average #esoteric'er considers good languages, excluding me] that use co-operative multithreading where the points of possible loss of control are obvious? 01:12:48 oh look, there's a simulator on http://codu.org/eso/bfjoust/egojsout/ . Hey, (()*-1)*-1 already takes forever. Yup, that definately needs a manual override. 01:12:58 !bfjoust broken [ 01:14:07 -!- nooodl has quit (Ping timeout: 240 seconds). 01:14:19 Sgeo: any language with coroutines 01:15:03 elliott: but there's the kind where the yield etc. can be abstracted away behind a function call without any indication that that is the case... or is that called something else? 01:15:25 Sgeo: so you want a language where you can't abstract? 01:15:41 any language with coroutines and no functions or macros 01:15:43 -!- Sorella has quit (Quit: It is tiem!). 01:15:44 wait, wait, i thought yield was usually a lexical thing 01:16:05 of course usually something that yields will be a coroutine unto itself 01:16:14 e.g., see Python's generators 01:17:02 elliott: I want the abstraction but not the fact that it's yielding to be abstracted.... e.g. what Bike said as a requirement 01:17:15 Which, Python's newer generators, Javascript generators, etc. 01:17:28 C# 01:17:32 I think a normal coroutine system satisfies your requirements if I understand them. 01:18:01 look at, I don't know, Modula-2 or something 01:18:51 you can do something like def foo: yield; def bar: foo()? man i haven't used python in a while 01:19:33 Bike: def foo(): { yield None } means that foo() will be an object with a .next() 01:19:48 (Python's syntax for this really sucks. "if you say yield in a function the whole thing is actually not the function it looks like") 01:20:03 (it should at least be, like, "def gen foo():" or something.) 01:22:04 Python used to suck worse with generators, though 01:22:26 At least, I think it did, maybe I just didn't know how to abstract properly 01:50:37 -!- Phantom_Hoover has quit (Ping timeout: 245 seconds). 01:53:25 -!- Leb has quit (Ping timeout: 246 seconds). 02:03:31 -!- variable has changed nick to trout. 02:03:40 -!- Sprocklem has quit (Quit: brb). 02:05:18 -!- Sprocklem has joined. 02:07:05 -!- Sprocklem has quit (Client Quit). 02:09:18 -!- shikhin has joined. 02:11:07 -!- Sprocklem has joined. 02:11:11 -!- Sprocklem has quit (Changing host). 02:11:11 -!- Sprocklem has joined. 02:15:16 -!- shikhin has quit (Ping timeout: 260 seconds). 02:15:56 elliott: what is a comment about Go doing in this? 02:15:57 http://crawl.develz.org/morgues/trunk/Sgeo/morgue-Sgeo-20120422-081744.txt 02:16:15 oh 02:16:16 derp 02:16:32 the real question is why you fought a D:1 gnoll, as a transmuter, with a club 02:16:46 wow I do not remember watching this game at all 02:17:39 I don't remember playing it. 02:17:44 ...the other real question is why you're looking at the log of a D:1 game from april two years ago 02:18:03 Because it was my most recent 02:21:29 what is D:1? 02:26:49 Dungeon level 1 02:29:44 -!- vyv has quit (Ping timeout: 276 seconds). 02:31:08 what does that mean? 02:31:08 -!- vyv has joined. 02:31:46 -!- shikhin has joined. 02:33:32 It's the first floor of a building called a Dungeon. 02:38:47 Insei, well at least that would explain the Go angle. 02:39:57 but good night, I'll probably dream of crazy p and n gates. 02:50:46 -!- Leb has joined. 02:51:58 back. So, someone fixed the bfjoust bot? 02:52:16 !bfjoust broken [ 02:53:36 I don't believe it was ever broken? 02:57:04 -!- tertu has quit (Ping timeout: 260 seconds). 02:57:26 !bfjoust loop (()*-1)*-1 02:58:25 http://codu.org/eso/bfjoust/breakdown.txt 03:07:48 -!- shikhin has quit (Remote host closed the connection). 03:17:54 -!- tertu has joined. 03:23:18 Fungot, perform the action which fixes bfjoust bot. 03:23:59 https://github.com/joyent/node/issues/1707 03:24:17 I again ask fungot to perform the action which fixes bfjoustbot, presuming the name is in fact case sensitive. 03:24:17 MDude: but what did you do this?" at http://paste.lisp.org/ display/ 918 03:24:55 Yes that lisp code must be able to fix it. 03:34:13 -!- Leb has quit (Ping timeout: 246 seconds). 03:40:51 -!- tertu has quit (Ping timeout: 265 seconds). 03:51:45 Apparently I am way too used to Python 03:52:11 It's still annoying that var hasOwnProperty = Object.prototype.hasOwnProperty.call; itself needs .call on it 04:01:30 -!- shikhin has joined. 04:09:02 I'm surprised JS people haven't started using custom dictionary types. 04:09:07 its objects are totally unsuited. 04:10:16 There's going to be a Map type in ES6 I think 04:11:01 "Key equality is based on the "same-value" algorithm: NaN is considered the same as NaN (even though NaN !== NaN) and all other values are considered equal according to the semantics of the === operator." 04:11:09 So, yet another type of equality 04:14:50 nice 04:16:35 Anyways, I should at some point go implement my horrible hack to get do notation into Javascript 04:21:57 heh 04:25:14 float keys in a map are such a fantastic idea. 04:28:29 -!- MDude has changed nick to MDream. 04:35:17 obviously 04:49:03 -!- zzo38 has joined. 05:02:43 -!- augur has joined. 05:11:35 -!- augur has quit (Ping timeout: 276 seconds). 05:19:50 -!- tertu has joined. 05:46:13 [wiki] [[Warpdrive]] http://esolangs.org/w/index.php?diff=39777&oldid=39775 * Rdebath * (+153) No accessible infinite memory. => !TC 05:52:05 -!- augur has joined. 05:57:31 -!- augur has quit (Quit: Leaving...). 06:20:36 -!- oerjan has joined. 06:25:32 -!- tertu has quit (Ping timeout: 240 seconds). 06:35:08 -!- MoALTz has quit (Quit: Leaving). 06:37:45 -!- Tritonio has quit (Ping timeout: 265 seconds). 06:45:11 I have idea, which would be, can it be done a kind of music compression (lossless, and compressing the note sequence, not the audio), such that nice classical-style music and other kind of nice music result in better compression? 06:52:29 !bfjoust wat < 06:52:59 !echo hi 06:53:00 hi 06:55:13 oh look, there's a simulator on http://codu.org/eso/bfjoust/egojsout/ . Hey, (()*-1)*-1 already takes forever. Yup, that definately needs a manual override. <-- pretty sure those don't use the same implementation. 07:06:42 zzo38: well, something in the line of _The Complexity of Songs_ by Don Knuth? 07:07:36 [wiki] [[Warpdrive]] http://esolangs.org/w/index.php?diff=39778&oldid=39777 * Oerjan * (+25) that's a bit long to hide in an example 07:08:06 the songs of complexity 07:09:01 lifthrasiir: I have not heard of that. 07:29:06 Some C functions take a "reentrancy structure"; what is a reentrancy structure? 07:29:08 -!- slereah has joined. 07:33:45 -!- edwardk has quit (Quit: Computer has gone to sleep.). 07:35:03 zzo38: joe loughry wrote back 07:35:27 There's no official documentation of the BANCStar numerical language 07:36:06 BANCStar was shipped with a BANCStar Generator which allowed you to create stuff 07:36:31 however, the BANCStar Generator was not as powerful as the underlying numerical language 07:36:55 which is why people started reverse engineering BANCSTar to be ablo to program in the numeric language to be able to do more powerful stuff 07:38:16 He may be able to get the source code of his LIST tool he wrote back then 07:38:29 (which appears to be some kind of "disassembler" for BANCStar) 07:38:39 mroman: That would be good; I would like the source code of the LIST tool if available. 07:38:47 So you'd have to reverse engineer BANCSTar from LIST 07:38:54 (I knew what the LIST tool was once you mentioned it.) 07:39:53 And I knew that there was no documentation of the BANCStar numerical language. However, I was wondering if the screen generator or the BANCSTAR system itself had any documentation which can be made available. 07:40:27 More scanned pages of the program may also be helpful. 07:40:36 I'll ask him :) 07:40:39 are basically all compilers based on abstract syntax trees? 07:41:06 diginet: I don't think so 07:41:21 zzo38: oh, really? interesting, do you know of any counterexamples? 07:41:39 I am not sure. 07:42:06 or more specifically in that case, (ignoring things like optimizations) do mostly all compilers which use ASTs work by walking the AST and "translating" the nodes from source to target language? 07:42:55 I don't know the answer to that. Some might do that without actually generating the AST. 07:43:29 (I believe SQLite does not generate the AST, although it otherwise does something similar. It compiles SQL into VDBE.) 07:44:34 diginet: as opposed to what, operating "directly" on source text? 07:45:02 most compiler operations don't have much to do with the syntax. 07:45:15 Bike: I'm not sure actually, I can't really see any nice way to compile without an AST 07:45:38 I guess the more important question is the second one 07:46:00 I know the OASYS compiler uses a recursive descent parser and generates the target code when the parser matches something. 07:46:32 most of the time things aren't context-free enough for a simple "walk" to work. consider, like, that a C compiler has to remember forward declarations, that kind of thing. 07:46:33 -!- Tritonio has joined. 07:47:05 Does one pass count as non-AST? 07:48:00 I.e. you use a parser library that can call code if it matched IDENT `+=` INT SEMICOLON? 07:48:39 mroman: Won't a parser library generally do that, or am I missing something somehow? 07:48:57 Create a tree? 07:49:04 -!- Tritonio1 has joined. 07:49:11 I know that yacc and Lemon can call code when matching, anyways. 07:49:33 Bison & Flex too 07:49:51 Yes 07:49:59 but Brainfuck should pretty much be compilable without a real tree 07:50:11 (I myself prefer Lemon; I don't know your own preferences.) 07:50:34 mroman: You would only need to keep track of loop nesting. You can use a stack for that, though 07:50:45 zzo38: i would have used a stack for that, yeh 07:50:47 -!- Tritonio has quit (Ping timeout: 252 seconds). 07:50:51 push the label number 07:51:09 and do "jmp " ++ pop() on ] 07:51:24 (or jiz, jnz whatever) 07:52:11 hm. 07:52:19 -!- Frooxius has quit (Read error: Connection reset by peer). 07:52:20 String replacement languages don't need a tree too I guess 07:52:22 -!- Froox has joined. 07:52:27 you can compile them line by line 07:52:41 and they have no "loop" other than after the last line you re-run it 07:52:56 Sometimes implementation of IF ... THEN and other block structures in Forth are also using the stack; it will create an empty cell and push the address when IF is compiled, and then pop it and store the current address at the popped address when THEN is compiled. 07:53:13 and ASM probably doesn't need a tree too 07:53:47 you just have to keep track of adresses and allocate enough space to insert jumps and adresses once you know them 07:54:52 An assembler I wrote for my school project inserts LOAD32 R0, XXXX; JMP R0; and remembers that XXXXX has to be replaced by the address of label ZZZ 07:55:08 and once it knows where that label is it will replace XXXX 07:56:46 (and ELSE does both) 07:56:48 -!- sebbu has quit (Ping timeout: 240 seconds). 07:57:15 -!- sebbu has joined. 07:57:51 -!- sebbu has quit (Changing host). 07:57:51 -!- sebbu has joined. 07:59:13 I feel confident saying that not all compilers use ASTs. :) 07:59:14 -!- nortti has quit (Ping timeout: 240 seconds). 07:59:17 -!- nortti has joined. 08:02:42 -!- Froox has quit (Ping timeout: 240 seconds). 08:03:02 That reminds me that I still haven't written a compiler for my language that targets x86 08:04:17 -!- Froox has joined. 08:05:32 -!- zzo38 has quit (Ping timeout: 240 seconds). 08:05:35 -!- Froo has joined. 08:05:42 -!- Froox has quit (Read error: Connection reset by peer). 08:05:44 -!- Slereah_ has quit (Read error: Connection reset by peer). 08:07:59 -!- zzo38 has joined. 08:08:20 -!- Slereah_ has joined. 08:11:02 -!- nortti has quit (Ping timeout: 240 seconds). 08:11:44 -!- nortti has joined. 08:17:34 -!- conehead has quit (Ping timeout: 240 seconds). 08:26:18 -!- monotone_ has joined. 08:26:35 -!- monotone has quit (Remote host closed the connection). 08:29:35 -!- shikhout has joined. 08:30:53 -!- mtve- has joined. 08:31:17 -!- mtve has quit (Ping timeout: 240 seconds). 08:32:42 -!- shikhin has quit (Ping timeout: 245 seconds). 08:43:32 -!- shikhout has quit (Ping timeout: 245 seconds). 08:53:45 -!- password2 has joined. 09:09:34 [wiki] [[Talk:Stasis]] N http://esolangs.org/w/index.php?oldid=39779 * Rdebath * (+542) Too static ? 09:12:22 crazy 09:14:39 -!- hogeyui has quit (Ping timeout: 240 seconds). 09:14:39 -!- hogeyui has joined. 09:28:27 [wiki] [[Talk:Stasis]] http://esolangs.org/w/index.php?diff=39780&oldid=39779 * Oerjan * (+187) Hm 09:31:51 -!- shikhin has joined. 09:34:39 -!- mtve- has changed nick to mtve. 09:38:26 -!- hogeyui_ has joined. 09:42:31 -!- hogeyui has quit (*.net *.split). 10:08:18 -!- boily has joined. 10:30:17 -!- Leb has joined. 10:39:30 -!- MindlessDrone has joined. 10:49:41 -!- nooodl has joined. 10:58:16 -!- password2 has quit (Ping timeout: 265 seconds). 11:01:13 -!- boily has quit (Quit: Poulet!). 11:03:28 -!- augur has joined. 11:03:58 -!- Leb has quit (Ping timeout: 246 seconds). 11:12:13 -!- Fenn3 has joined. 11:12:27 -!- Fenn3 has left. 11:17:26 -!- atehwa has joined. 11:50:47 -!- mhi^ has joined. 11:59:52 -!- tertu has joined. 12:03:47 -!- heroux has quit (Ping timeout: 252 seconds). 12:06:59 -!- heroux has joined. 12:12:59 -!- Sgeo has quit (Read error: Connection reset by peer). 12:16:14 -!- Phantom_Hoover has joined. 12:23:08 -!- oerjan has quit (Quit: leaving). 12:28:10 -!- yorick has joined. 12:31:52 -!- lollo64it has joined. 12:35:36 -!- rodgort has quit (Quit: ERC Version 5.3 (IRC client for Emacs)). 12:40:17 -!- rodgort has joined. 12:44:28 -!- slereah has quit (Quit: Leaving). 12:51:26 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 12:57:11 -!- general_cryptic has joined. 13:07:49 -!- scheurneus has joined. 13:08:03 hello all 13:09:40 -!- sign has quit (Quit: Here we are, going far to save all that we love - If we give all we've got, we will make it through - Here we are, like a star shining bright on your world - Today, make evil go away!). 13:10:38 -!- MDream has quit (Ping timeout: 276 seconds). 13:12:17 !help 13:12:18 ​help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help . 13:12:46 !bf_textgen Hello, World! 13:12:54 !bf_txtgen Hello, World! 13:12:59 ​129 ++++++++++++++[>+++++>+++++++>+++>+<<<<-]>++.>+++.+++++++..+++.>++.------------.<<+++++++++++++++.>.+++.------.--------.>+.>----. [378] 13:13:07 !help languages 13:13:08 ​languages: Esoteric: 1l 2l adjust asm axo bch befunge befunge98 bf bf8 bf16 bf32 boolfuck cintercal clcintercal dimensifuck glass glypho haskell kipple lambda lazyk linguine malbolge pbrain perl qbf rail rhotor sadol sceql trigger udage01 underload unlambda whirl. Competitive: bfjoust fyb. Other: asm c cxx forth sh. 13:13:23 !bf8 ++++++++++++++[>+++++>+++++++>+++>+<<<<-]>++.>+++.+++++++..+++.>++.------------.<<+++++++++++++++.>.+++.------.--------.>+.>----. 13:13:25 Hello, World! 13:13:35 !bf32 ++++++++++++++[>+++++>+++++++>+++>+<<<<-]>++.>+++.+++++++..+++.>++.------------.<<+++++++++++++++.>.+++.------.--------.>+.>----. 13:13:35 Hello, World! 13:20:07 -!- scheurneus has quit (Ping timeout: 246 seconds). 13:21:59 !bf8 ++++[>++++++++<-]>+>+[<.>[>+<-]>[<++>-]<] 13:21:59 ​!!!!!!!! 13:22:02 !bf16 ++++[>++++++++<-]>+>+[<.>[>+<-]>[<++>-]<] 13:22:02 ​!!!!!!!! 13:22:21 it cheats! 13:22:36 !bf32 ++++[>++++++++<-]>+>+[<.>[>+<-]>[<++>-]<] 13:22:36 ​!!!!!!!! 13:26:23 !bf8 -. 13:26:24 ​ÿ 13:26:32 !bf16 -. 13:26:33 ​ÿ 13:27:30 Huh, so what does that mean? 13:28:26 What's bfN? 13:28:42 I was assuming brainfuck with N-bit cells. 13:29:00 hm. 13:29:39 -!- general_cryptic has quit (Quit: Leaving). 13:29:48 That was my guess as well, but it looks like no? 13:30:53 hence "it cheats!" 13:31:31 Regarding the "-." output, that could well be brainfuck with N-bit cells and just . limited to 8-bit output. 13:32:13 A single 0xff byte is what came out both times, after all. 13:32:29 well, what I did should have printed 8 and 16 exclamation marks, and a timeout. 13:34:23 Oh, a times-two loop. Yes, that's more like a proof. 13:38:02 -!- general_cryptic has joined. 13:45:27 -!- MDude has joined. 13:50:38 -!- Sprocklem has quit (Ping timeout: 240 seconds). 13:51:35 -!- Patashu_ has quit (Ping timeout: 252 seconds). 14:07:06 -!- Jakob__ has joined. 14:07:11 hey 14:07:32 -!- Jakob__ has quit (Client Quit). 14:14:24 !help bf16 14:14:24 ​Sorry, I have no help for bf16! 14:19:27 -!- general_cryptic has quit (Remote host closed the connection). 14:19:30 -!- Sprocklem has joined. 14:26:30 -!- heroux has quit (Remote host closed the connection). 14:30:55 -!- heroux has joined. 14:37:36 -!- scheurneus has joined. 15:03:43 -!- shikhin has quit (Ping timeout: 276 seconds). 15:05:08 -!- shikhin has joined. 15:15:27 -!- mihow has joined. 15:46:40 -!- general_cryptic has joined. 15:50:43 -!- douglass_ has quit (Quit: Lost terminal). 15:50:52 -!- general_cryptic has quit (Remote host closed the connection). 15:51:18 -!- Tritonio1 has quit (Ping timeout: 240 seconds). 15:52:08 -!- general_cryptic has joined. 15:54:37 Don't hate BC/AD because it is not corresponding precisely to Christ's birth; October also is not the eighth month. Don't hate BC/AD because it is religious; so are the month names and day of week names. 15:55:34 Who hates BC/AD? 15:56:47 -!- subleq has quit (Disconnected by services). 15:57:04 -!- subleq has joined. 15:57:08 Well, some people do, I think... 15:57:24 You know what's worse than BC/AD? BCD. 15:57:32 You know what's even worse 15:57:43 Discrimination against left-handed people 15:57:49 Some people like to use the terms BCE and CE, which I find to be a bit more confusing 15:58:02 "right" also means "lawful/good/correct" 15:58:17 that's very discriminating against left-handed people 15:58:41 -!- general_cryptic has quit (Remote host closed the connection). 15:58:56 What's BCE? 15:58:58 because left-handed people are the devil? 15:59:08 mroman: BCE = "before common era" 15:59:09 -!- general_cryptic has joined. 15:59:23 -!- general_cryptic_ has joined. 15:59:26 subleq: yeah 15:59:28 sort of 15:59:52 -!- MDude has quit (Ping timeout: 260 seconds). 16:00:53 Wikipedia uses CE/BCE as a matter of policy, doesn't it? 16:02:50 I recall reading about that 16:02:54 fizzie: I don't know; I think I may have seen both (and I don't really have intention to change from one to the other, unless using both set of terms causes confusion?) 16:02:54 they use something :) 16:04:04 Perhaps it was just a proposal; I don't want to read through the entirety of http://en.wikipedia.org/wiki/Wikipedia:Neutral_point_of_view/BCE-CE_Debate to figure out. 16:04:28 I found it easily by typing WP:BCE 16:05:37 I agree with the things mentioned at WP:BCE 16:06:15 The BP notation was new for me. 16:07:25 I vaguely remember there's an Asimov story where the year "1 AE" is "the first year of Atomic Era", corresponding to 1945 AD/CE or something. 16:13:08 -!- scheurneus has quit (Quit: Page closed). 16:13:27 [wiki] [[Talk:BytePusher]] M http://esolangs.org/w/index.php?diff=39781&oldid=37348 * Nucular * (+51) Added link to JsBP JavaScript VM 16:15:00 O, OK 16:20:38 -!- edwardk has joined. 16:21:20 Can the unary XOR in INTERCAL be used for converting a number into a Gray code? 16:25:10 I prefer astronomical year numbering rather than BC, AD, BCE, CE, AE, etc anyways 16:25:25 I think is more sensible 16:31:56 fizzie: IIRC Orion’s Arm numbers years from the first moon landing or something. 16:33:47 the CE/AD argument is funny because it's like GODDAMN SECULARISTS, COUNTING FROM THE BIRTH OF JESUS 16:34:29 actually, counting from a couple years after the bith of jesus 16:36:21 xactly 16:41:20 nortti: Yes, that is my first argument. Bike's is my second argument. 16:47:32 -!- Tritonio has joined. 16:51:39 I prefer moon calendar 16:52:00 It just makes more sense 16:55:21 -!- tswett has joined. 16:56:13 Use whatever calendar you want to, but Gregorian calendar is now the common one and you should know how to deal with it. (You may also deal with UNIX time) 16:57:53 mroman: which moon calendar? 16:58:57 Yes, which moon calendar do you like? 17:00:10 personally, I'd like a solar calendar of 13 months, with all but one being 28 days 17:00:12 the lunar one 17:00:22 We should use a compromise calendar in which a month is half a lunar month plus one 24th of a solar year. 17:02:24 Say, can every positive integer be written as a sum of distinct fractions 1/n where n is a positive integer? 17:02:41 Yeah, it's gotta be possible. 17:04:57 -!- general_cryptic has quit (Remote host closed the connection). 17:04:57 -!- general_cryptic_ has quit (Remote host closed the connection). 17:05:45 Can you prove it? 17:05:57 Yes. 17:06:02 OK 17:06:30 Yes I think it is true too 17:08:01 -!- shikhin has quit (Ping timeout: 265 seconds). 17:08:01 Oh shucks, the fact that R has no non-trivial field automorphisms is actually pretty easy to prove? 17:08:26 Apparently every field automorphism of R must send positive numbers to positive numbers. 17:08:28 Hmm. 17:08:30 What are non-trivial field automorphisms? 17:08:40 Field automorphisms that aren't the identity function. 17:09:36 Why would it have to send positive numbers to positive numbers? 17:09:57 Ooh. Because a number is positive if and only if it's a nonzero square. 17:12:07 In real numbers, yes I can see it must be 17:13:05 Dang, here I was thinking that positivity wasn't really an algebraic property. But clearly it is. 17:13:30 Now it can be seen that it is! 17:13:40 In the real numbers, at least. 17:13:57 All right, let's simplify things. There are five numbers: 0, 1, 2, 3, and 4. 17:14:00 Yes, the property you mentioned is only for real numbers, clearly 17:14:02 4 + 1 = 0. 17:14:33 O, so do you mean it is modulo five system? 17:14:41 1*1 = 1, 2*2 = 4, 3*3 = 4, and 4*4 = 1. So the positive numbers are 1 and 4. 17:14:42 Yeah. 17:14:58 Of course, -1 = 4 and -2 = 3. 17:15:06 So 1 and -1 are positive, while 2 and -2 are negative. Makes sense. 17:16:30 I dunno, I think that doesn't make sense after all. 17:16:58 It does look a strange definition of "positive" and "negative" 17:17:20 Okay, let's move up a bit. Seven numbers: 0, 1, 2, 3, 4, 5, 6. 1*1 = 1, 2*2 = 4, 3*3 = 2, 4*4 = 2, 5*5 = 4, 6*6 = 1. So 1, 2, and 4 are positive. Meanwhile, -1 = 6, -2 = 5, and -4 = 3 are negative. 17:17:21 Although clearly it does have the properties you assert them to have in that context. 17:17:40 I like having the property that the opposite of a positive number is negative and vice versa. 17:21:53 The endomorphism ring of the multiplication group of Z7 is Z6. (Let's call that the "exponent ring" of Z7.) 17:22:37 Z6 doesn't really have a multiplication group, since it has zero divisors. It has a multiplication monoid. 17:23:25 -!- trout has quit (Quit: I found 1 in /dev/zero). 17:29:25 'Course, Z7 has a multiplication monoid, too. Let's look at its endomorphisms. 17:30:09 I guess the endomorphisms of the multiplication monoid are still the same. They're Z6. 17:31:16 -!- variable has joined. 17:32:16 How about the endomorphism ring of the multiplication monoid of Z6? Well, said monoid has identity element 1, and it's generated by 2, 3, and 5. Morphisms are fully determined by what they do to generators, aye? 17:33:35 -!- edwardk has quit (Quit: Computer has gone to sleep.). 17:33:41 Ooh, hang on. I think the multiplication monoid of Z7 actually has an extra endomorphism. There's one mapping 0 onto 0 and everything else onto 1, and one mapping everything onto 1. 17:37:43 The former could be called 6 and the latter could be called 0. Then it's an un-quotient of Z6, where the only way to write 0 as a sum is as 0 + 0, and 0 * x is 0 for all x, and 6 * x is 6 for all non-0 x. Aye? 17:38:27 -!- edwardk has joined. 17:40:52 -!- edwardk has quit (Client Quit). 17:43:28 Say, can every positive integer be written as a sum of distinct fractions 1/n where n is a positive integer? 17:43:29 ^ a finite sum? 17:45:58 nooodl: I think the answer is yes 17:46:15 see https://en.wikipedia.org/wiki/Egyptian_fractions 18:03:48 -!- Tritonio has quit (Ping timeout: 260 seconds). 18:06:57 -!- shikhin has joined. 18:10:21 How do I get rid of the warning to cast a pointer to a integer of a different size? In this specific case, I don't care if the size of a pointer is larger or smaller or equal to the size of long long integers. 18:16:55 -!- Sprocklem has quit (Quit: Class). 18:22:00 zzo38: I don't know, does casting in two steps (via size_t) help? 18:22:21 int-e: Yes maybe that will help 18:23:59 Yes it works 18:41:36 -!- oerjan has joined. 18:46:15 [wiki] [[User:Rdebath]] http://esolangs.org/w/index.php?diff=39782&oldid=39730 * Rdebath * (+12) /* Current brainfuck extensions to go back to. */ 18:47:06 int-e: isn't intptr_t more appropriate 18:50:43 well, what I did should have printed 8 and 16 exclamation marks, and a timeout. <-- shocking 19:00:38 maybe it's 16-bit brainfuck but with deadfish wrapping, where 256 goes back to 0!! 19:00:39 tswett: psst ordering doesn't make sense in fields of non-zero characteristic hth 19:00:59 which includes all finite ones 19:01:36 nooodl: does that wrapped deadfish come with chips 19:02:47 @tell tswett psst ordering doesn't make sense in fields of non-zero characteristic. which includes all finite ones hth 19:02:47 Consider it noted. 19:03:29 Who says I want ordering? 19:03:36 I'm fine with the sum of two positive numbers being negative. 19:03:41 @messages 19:03:43 O KAY 19:07:28 -!- Phantom_Hoover has quit (Ping timeout: 276 seconds). 19:09:06 Ooh, great idea. Esolang where there are keywords defining program structure, but the keywords don't have to nest correctly. 19:10:46 "if Ready then while Yellow do PokeSomething else RunAround endif EatCake endwhile" 19:11:09 Doesn't Pascal have that? 19:11:22 Not that I've heard of. 19:11:33 Of course, Haskell has every possible control structure. 19:12:15 Haskell doesn't have any control structures; you can make it up instead, out of computable mathematics. 19:12:41 doesn't "if" count 19:14:02 if is syntactic sugar 19:14:52 i'd say Haskell only has case ... of ... as control structure 19:14:55 scheme doesn't have any control structures, you can make them yourself out of call/cc, lambdas, and arrogance 19:14:56 for case ... of { True -> ...; False -> ... }? 19:15:25 nod, nooodle 19:15:30 `addquote scheme doesn't have any control structures, you can make them yourself out of call/cc, lambdas, and arrogance 19:15:33 1205) scheme doesn't have any control structures, you can make them yourself out of call/cc, lambdas, and arrogance 19:15:47 case-of is totally a control structure 19:16:31 i should figure out call/cc 19:16:36 Case statements are definitely syntactic sugar. 19:16:55 it's really scary?? also the Cont monad 19:16:57 -!- Melvar has quit (Quit: WeeChat 0.4.3). 19:17:06 -!- idris-bot has quit (Quit: Terminated). 19:17:31 -!- Phantom_Hoover has joined. 19:17:33 nooodl: Cont seems less scary 19:18:11 I think when I was playing with linear logic, I found that Cont, State, and Store are three vertices of a square. 19:18:28 -!- Burton has quit (Ping timeout: 260 seconds). 19:18:48 tswett: How does that work? 19:19:04 State s a = s -> (s, a) and Store s a = (s, s -> a). So clearly there's a dual relationship there. 19:19:10 Just swap the (s,) and the (s ->). 19:20:41 Now, Cont s a = (a -> s) -> s. Using ~ to represent the dual operator and | to represent the par operator, (a -> s) -> s = ~(a -> s) | s = ~(~a | s) | s = (~~a, ~s) | s = (a, ~s) | s. 19:21:22 Note that if you swap s and ~s, this becomes (a, s) | ~s = ~s | (a, s) = s -> (a, s), which is State. 19:21:34 So Cont and State are also in a certain dual relationship. 19:22:03 The fourth corner of the square is (~s, ~s -> a) or (~s, s | a). 19:22:24 i think State and Store are dual because they both arise from the same adjoint functors, but composed in opposite order. this is only possible because those functors are from Hask to itself. (at least this analogy works for Set.) 19:22:40 oerjan: right. The same is true of Cont and this fourth corner, I believe. 19:23:11 With State and Store, the functors are (s ->) and (s,). With Cont and the fourth corner, the corners are (s |) and (~s,). 19:23:16 s/corners/functors/ 19:23:30 okay Cont isn't very scary 19:23:34 Of course, neither of those can be interpreted in Hask any more. I think. 19:23:38 with Cont the functors are being Hask and Hask^op, iirc 19:23:53 and so Cont is actually _self_-dual. 19:24:17 callCC isn't very scary either?? the yin-yang puzzle still is 19:24:21 According to my linear logic, the dual of Cont is something other than Cont. 19:24:22 But uh. 19:24:33 the dual is a comonad on Hask^op, which is a monad on Hask, which is Cont itself. 19:25:04 It's not instantly obvious to me why the dual is a comonad on Hask^op. 19:25:33 oerjan: can you tell me what the functors between Hask and Hask^op are? 19:25:35 tswett: when you have adjoint functors between categories A and B, you get a monad on A and a comonad on B. 19:25:46 I believe yin-yang is also implemented as one of the Unlambda example programs 19:25:48 or wait 19:25:56 Sounds right so far. 19:26:06 i am not sure about that comonad part 19:26:24 I think you're right. 19:26:25 this is all very vaguely recalled 19:26:34 But do you remember what functors Cont decomposes into? 19:27:12 -!- melliflous has joined. 19:27:15 Cont r a = Cont ((a -> r) -> r), the functors are both (a -> r) 19:27:24 Ahh. 19:27:30 Of course. 19:27:53 -!- melliflous has quit (Remote host closed the connection). 19:28:07 -!- mellifluous has joined. 19:28:26 Then what I'm doing is a different decomposition of what's really a different monad that I'm writing the same way for the sake of confusion. 19:30:00 okay :P 19:30:26 But my monad could also be decomposed your way. 19:30:33 But my decomposition is into covariant functors. 19:30:48 huh 19:31:09 Of course, I'm using linear logic operators, meaning my decomposition has to be interpreted in a... 19:31:14 One of those categories you can interpret linear logic in. 19:31:16 maybe linear logic is its own opposite category or something... 19:31:50 A symmetric monoidal category ATWP. 19:32:01 `? atwp 19:32:02 atwp? ¯\(°​_o)/¯ 19:32:12 -!- M28 has quit (Read error: Connection reset by peer). 19:32:14 According to Wikipedia. 19:32:19 -!- M28_ has joined. 19:32:38 Monad can also be made from Free, Codensity, CodensityAsk, etc, for example Cont r = Codensity (Const r) and Either x = CodensityAsk (Traced x) and so on. 19:32:49 -!- Burton has joined. 19:33:09 And also, [] = Codensity Endo 19:33:13 Unfortunately, I don't know what Codensity, Const, CodensityAsk, and Traced are. 19:33:15 `` echo According to Wikipedia, ATWP means nothing. >wisdom/atwp 19:33:15 Or Endo. 19:33:16 No output. 19:33:50 tswett: Then you must learn. 19:34:15 i suppose that's not entirely true. 19:34:33 -!- conehead has joined. 19:34:53 but air transport white paper doesn't have its own article, at least. 19:35:39 There is also Co, which can make a monad (or a monad transformer) from a comonad. 19:37:44 -!- FreeFull has quit. 19:40:02 scott aaronson about being interviewed about that turing test thing "Luckily, while an experienced judge could easily distinguish me from an AI researcher, I only needed to simulate one for a few minutes of banter." 19:52:06 -!- Sprocklem has joined. 19:55:17 -!- Melvar has joined. 20:02:59 -!- lollo64it has quit (Ping timeout: 265 seconds). 20:13:49 -!- password2 has joined. 20:15:28 -!- password2 has quit (Max SendQ exceeded). 20:17:47 -!- Zuu has joined. 20:27:15 elliott: funny, I was going to suggest intptr_t myself but then got distracted while looking for whether the C standard actually has that type. (C99 does, as an optional type in stdint.h) 20:32:02 -!- drlemon has quit (Remote host closed the connection). 20:34:46 -!- password2 has joined. 20:37:15 -!- idris-bot has joined. 20:39:41 -!- mhi^ has quit (Quit: Lost terminal). 20:42:50 -!- Leb has joined. 20:44:17 -!- mhi^ has joined. 20:45:40 !bfjoust is-it-fixed? (.)*-1 20:50:11 it's not going to be fixed unless you ping Gregor. 20:51:26 !bfjoust breakdown-says-parsing-error-on-program-not-on-report (.)*-1 20:51:35 -!- Patashu has joined. 20:56:01 -!- password2 has quit (Ping timeout: 276 seconds). 20:56:13 I don't understand how the hill works. The Egobot source link gives error 500, so that's no help. 20:56:14 -!- Patashu has quit (Disconnected by services). 20:56:15 -!- Patashu_ has joined. 20:56:45 Then Gregor should fix that probably 20:57:46 -!- douglass has joined. 21:02:00 -!- MindlessDrone has quit (Quit: MindlessDrone). 21:05:33 Out of curiosity, does it do any good if you replace Leb_broken with something that's not broken? 21:06:26 fizzie: i bet you could fix it, right? 21:06:34 I don't know anything about it. 21:06:59 oh wait it's EgoBot not HackEgo. are they on the same host? 21:07:09 That didn't stop me from fixing HackEgo that one time, but still. The web parts at least don't run on the machine I can access, as far as I know. 21:07:41 And apparently the bot isn't, either. 21:07:43 well but !bfjoust itself is not giving any response. 21:08:36 it is generating the breakdown, just not answering back on irc 21:09:43 Based on few /whoises, EgoBot is on the same box with glogbot, which is a different one than HackEgo and the wiki. 21:10:09 So I don't think I can be of any help. 21:10:14 aww 21:10:37 -!- edwardk has joined. 21:11:29 oh, my "loop" is still in "in_egobot", so maybe it's getting locked there. 21:12:45 I was under the impression that was fixed. 21:13:12 At least, it is fixed in newer versions of the foolance code, but maybe the hill hasn't been updated. 21:13:51 (Newer ones remove loops that take no cycles.) 21:14:14 You can (probably) overwrite your "loop" by resubmitting something else. 21:14:37 With the same name, I mean. 21:15:56 Engaging in a bit of Pair Programming yay 21:16:03 Enterprise, agile, what have you 21:16:21 Getting all scrummy, eh? 21:16:46 -!- tswett_ has joined. 21:17:07 I should totally implement object-oriented programming in Coq. 21:17:43 -!- Sprocklem has quit (Quit: bye). 21:18:50 tswett_, yes you should 21:19:25 -!- Patashu_ has quit (Ping timeout: 276 seconds). 21:22:15 A class is simply a "state" type along with a directed acyclic graph of methods, where each method is a function taking the state and all methods pointing at it and some parameters and returning the new state and the return value. 21:22:24 Yup yup. 21:23:27 Subclassing just means creating a new class that happens to implement the interface of the old class. 21:28:35 -!- edwardk has quit (Quit: Computer has gone to sleep.). 21:33:40 !bfjoust loop lets see if this fixes it. 21:33:45 ​Score for Leb_is-it-fixed_: 5.7 21:33:45 ​Score for Leb_broken: 0.0 21:33:46 ​Score for Leb_breakdown-says-parsing-error-on-program-not-on-report: 5.7 21:33:46 ​Score for Leb_loop: 5.7 21:33:46 ​Score for Leb_broken: 0.0 21:33:46 ​Score for Leb_loop: 5.7 21:33:46 ​Score for Leb_loop: 5.7 21:33:47 ​Score for oerjan_wat: 0.0 21:33:56 yay! 21:34:16 well that was efficient. 21:35:33 !bfjoust clear-the-breakdown-please . 21:35:36 ​Score for Leb_clear-the-breakdown-please: 6.1 21:36:27 OOP is silly and shouldn't be implemented in Coq. 21:36:33 The "loop problem" has been fixed since Mar 23, 2013; the running code could really do with an update. 21:37:07 fizzie: right after Gregor updates to Quintopia's scoring method, i take. 21:37:27 So, what's the best syntax for multi-line comments? Is it {- -}? Is it (* *)? Is it ? 21:37:58 tswett_: -- (comment here) (more comment here) hth 21:38:03 {# #}? 21:38:21 oerjan: the good ol' "pound sign on every line" multi-line comment syntax? 21:38:29 Sounds good. 21:38:38 tswett_: what pound sign 21:39:21 --, obviously. 21:39:29 that's a pound sign? 21:39:31 -!- boily has joined. 21:39:33 Obviously. 21:40:04 but no. there's only a -- at the beginning, followed by as many multi-line parenthesized (with correct nesting) comments as you want. 21:40:09 -!- metasepia has joined. 21:40:10 ~duck CYUL 21:40:13 The "CYUL" ICAO airport code corresponds to MontréalPierre Elliott Trudeau International Airport in Dorval, Quebec, Canada and the IATA code is "YUL." 21:40:19 what. 21:40:25 what the fungot. 21:40:25 boily: and you can't tell the difference via text. 21:40:39 ~metar CYUL 21:40:39 CYUL 092100Z 36008G15KT 30SM FEW060 FEW120 SCT240 27/12 A2993 RMK SC1AC1CI3 SC TR AC TR SLP134 DENSITY ALT 1500FT 21:40:42 hth 21:40:52 my brain. it is overheating. 21:40:58 ~metar ENVA 21:40:59 ENVA 092120Z 01003KT 9999 FEW020 13/10 Q1023 RMK WIND 670FT 30004KT 21:41:01 just did one sunny bike ride. 21:41:22 TIL under natural sunlight, I can't tell the difference between a duck. 21:42:01 between a duck and ? 21:42:19 * tswett_ reads a paper about two-dimensional programming languages. 21:42:23 boily: thank you for that ping. 21:42:29 -!- oerjan has set topic: Please don't mind boily, he has a sun stroke | brainfuck survey: https://www.surveymonkey.com/s/L82SNZV | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 21:43:14 elliott: oh hi! :D 21:43:38 nortti: you know, one leg is both the same. 21:43:55 -!- oerjan has set topic: Please don't mind boily, he has a sun stroke and is not insane at all | brainfuck survey: https://www.surveymonkey.com/s/L82SNZV | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/. 21:44:46 thørjan. 21:44:54 This paper was published in 1972. 21:44:56 I hope it's still relevant. 21:45:08 several people published in 1972 are still relevant 21:46:07 When boily says he did a "bike ride", does he mean he was riding a bike or he was riding Bike? 21:46:20 how lewd 21:46:26 also, my ability to guess which english compounds are written in one word fails again 21:47:27 tswett_: I haven't ever physically seen any #esotëric member, except Roujo. I haven't mailed any member, except Quintopia. Bike is quite far from here. 21:48:48 #esotëric, you say? 21:49:24 -!- vyv has quit (Ping timeout: 260 seconds). 21:49:30 #esotëric. 21:49:42 So, it's not all too obvious how two-dimensional syntaxes would be defined. 21:50:13 You'd need two-dimensional lexical tokens 21:50:21 Lexical jigsaw puzzle pieces 21:51:20 -!- vyv has joined. 21:51:39 Okay. I'm thinking that the notion of a string would be replaced by the notion of a box. Concatenation would be replaced by juxtaposition. 21:51:47 Whitespace outside of tokens would always be considered insignificant. 21:51:54 I also don't know how would you make a two-dimensional tokenizer? 21:52:08 I.e. a box juxtaposed with a blank box is equivalent to the original box. 21:52:19 i believe that is the topic of a good amount of computer vision :p 21:52:23 zzo38: bilinear interpolation? 21:52:42 We get ambiguity pretty quickly. 21:53:10 Suppose you have an "a" in the upper left and a "b" in the upper right. Is that an "a" box above a "b" box or an "a" box to the left of a "b" box? 21:54:27 ~math problems~ 21:54:27 --- Possible commands: dice, duck, echo, eval, fortune, metar, ping, yi 21:55:24 ~echo punk motherfucker with a badge and a gun 21:55:24 punk motherfucker with a badge and a gun 21:56:55 -!- tswett_ has quit (Quit: Konversation terminated!). 21:57:22 ~echo `echo hello 21:57:23 `echo hello 21:57:23 hello 21:58:02 -!- tswett_ has joined. 21:58:16 ^echo ~echo foo 21:58:16 ~echo foo ~echo foo 21:58:16 foo ~echo foo 21:58:33 you might want to fix that 21:58:41 in the next version! 21:58:51 -!- tswett_ has quit (Client Quit). 21:58:53 (you know, the one that is coming real soon now >_>...) 21:59:07 otherwise, this would be bad: ^echo ~echo ^echo 21:59:08 -!- tswett_ has joined. 21:59:11 Dare I say ^echo ~echo ^echo? 21:59:12 ~echo ~echo foo 21:59:12 ~echo foo 21:59:40 ^echo Like, I assume fungot just says whatever twice? 21:59:40 Like, I assume fungot just says whatever twice? Like, I assume fungot just says whatever twice? 21:59:47 yes 21:59:56 haha 22:00:16 I'm not going to say ^echo ~echo ^echo, then. 22:00:20 @where+ test ~echo @run 123 22:00:21 Nice! 22:00:21 @where test 22:00:22 ~echo @run 123 22:00:22 @run 123 22:00:24 123 22:00:49 But I'd like to see someone else try it. 22:01:14 @where+ test ~echo @where test 22:01:14 It is forever etched in my memory. 22:01:23 @where test 22:01:23 ~echo @where test 22:01:23 @where test 22:01:23 ~echo @where test 22:01:23 @where test 22:01:23 ~echo @where test 22:01:24 @where test 22:01:24 ~echo @where test 22:01:24 @where test 22:01:25 -!- lambdabot has left. 22:01:32 -!- lambdabot has joined. 22:01:38 MUAH AH AH! 22:01:45 -!- tswett_ has quit (Client Quit). 22:01:53 ^echo ~echo ^echo 22:01:53 ~echo ^echo ~echo ^echo 22:01:53 ^echo ~echo ^echo 22:01:54 -!- tswett_ has joined. 22:02:08 nortti, fungot has an ignore list 22:02:08 Taneb: change x y)) 22:02:12 My Internet connection isn't working that well. 22:02:15 I guess I should get a job so I can move out and have wired Internet. 22:02:48 I'm totally disappointed by how nobody is saying ^echo ~echo ^echo. 22:02:54 ^echo ~echo ^echo 22:02:55 ~echo ^echo ~echo ^echo 22:02:55 ^echo ~echo ^echo 22:03:03 Thank you. 22:03:06 01:02 < tswett_> I'm totally disappointed by how nobody is saying ^echo ~echo ^echo. <-- 01:01 < nortti> ^echo ~echo ^echo 22:03:10 I feel much better now. 22:03:10 nortti said it first, but you were in a disappeared state. 22:03:24 Well darn. 22:03:40 had forgotten to account for fungot's better bot-ignoring 22:03:41 nortti: fun, but it seems like it gives me t too with the others 22:04:01 fungot: yes, that's why it is called the whole alphabet 22:04:01 nortti: i'm using 203, and want the fnord formatting 22:04:01 LA PREGUNTA ES: why didn't fungot obey the second command, exactly? 22:04:02 tswett_: it works flawlessly on powerpc slackware ( fnord). not sure what difference that would have given: roma, turt, iipc, trds, imap or mode 22:05:29 * boily appends a chocolate chip cookie to fungot 22:05:30 boily: when emacs is rewritten? i thought about 22:15:53 -!- coppro has changed nick to tookeytoo. 22:16:04 tswett_: metasepia is on fungot's ignore list. 22:16:04 oerjan: since they didn't have methods?' en osaa mihin muotoon pitää laittaa be late 22:16:45 -!- oerjan has quit (Quit: And good night). 22:17:05 -!- realzies has quit (*.net *.split). 22:17:14 -!- Sprocklem has joined. 22:19:21 -!- tookeytoo has changed nick to coppro. 22:24:39 -!- realzies has joined. 22:38:43 -!- Sgeo has joined. 22:39:00 -!- nooodl has quit (Quit: Ik ga weg). 22:39:45 -!- tswett_ has left ("Konversation terminated!"). 22:47:07 -!- Froo has quit (Read error: Connection reset by peer). 22:50:04 -!- edwardk has joined. 22:53:17 -!- yorick has quit (Remote host closed the connection). 22:55:49 -!- tswett has quit (Quit: tswett). 22:58:20 -!- FreeFull has joined. 23:00:26 -!- Frooxius has joined. 23:05:22 -!- boily has quit (Quit: SUNNY CHICKEN). 23:05:28 -!- metasepia has quit (Remote host closed the connection). 23:09:23 -!- mellifluous has quit (Quit: Leaving). 23:11:17 -!- tromp has quit (Remote host closed the connection). 23:11:20 -!- Ghoul_ has joined. 23:12:48 -!- Phantom_Hoover has quit (Remote host closed the connection). 23:17:25 -!- aretecode has quit (Quit: Toodaloo). 23:25:39 I wrote a C library to parse ZCDSF now, although it still contains a few mistakes. 23:25:55 What is ZCDSF? 23:26:36 shachaf: It is documented at http://zzo38computer.org/textfile/miscellaneous/zcdsf.txt 23:29:04 (The name was suggested by someone else; I abbreviated it.) 23:29:47 -!- Bike has quit (Ping timeout: 245 seconds). 23:30:43 -!- shikhin has quit (Ping timeout: 276 seconds). 23:31:49 -!- Bike has joined. 23:31:58 please do tell what was going on with egobot 23:32:06 -!- shikhin has joined. 23:32:42 -!- Sorella has joined. 23:37:20 the bfjoust thing? I sent (()*-1)*-1 23:40:15 -!- tromp has joined. 23:40:51 -!- mihow has quit (Quit: mihow). 23:41:37 and that freezes it? 23:42:07 oh i get it 23:42:17 fizzie corrected and submitted to gregor a fix to gearlance 23:42:21 and he has not installed it 23:42:23 makes sense 23:43:14 let's all go to gregor's house and sleep on his couch and floor until he fixes it 23:47:12 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 23:47:47 -!- nisstyre has joined. 23:52:51 -!- tromp has quit (Remote host closed the connection).