00:11:21 -!- Slereah_ has joined. 00:13:26 -!- Slereah has quit (Ping timeout: 264 seconds). 00:49:29 -!- Slereah_ has quit (Read error: Connection reset by peer). 00:49:46 -!- Slereah has joined. 00:53:57 http://web.archive.org/web/20031210145310/http://cyberspace.org/~lament/thue.html <-- hm although both original links are dead, wayback has a younger capture of the esolang one. although they're probably identical code anyway. 00:54:08 http://thue.stanford.edu/ 00:54:27 http://thue.stanford.edu/puzzle.html 00:54:27 lol. 00:55:07 shachaf: seems like a different one 00:55:24 too bad 00:58:13 * oerjan updates to use our handy wayback template 00:59:04 -!- impomatic has quit (Quit: impomatic). 00:59:21 something about rewrite systems makes me happy. 01:00:16 when I was studying the process behind markov algorithms I learned all sorts of cool things you can do using them, even though it is a bit unintuitive at first. 01:02:40 did we point you to /// yet (probably) 01:02:53 * oerjan is heavily biased, of course 01:03:06 being biased towards /// is sensible 01:03:14 yep! 01:03:19 I've looked briefly at /// 01:03:25 (I assume you're the creator) 01:03:32 Bike: it's just asking for a slanted view, really 01:03:34 he at least wrote some algorithms 01:03:40 shut uppppp 01:03:44 hurrrr. 01:03:44 LinearInterpol: not the creator but the main programmer 01:03:56 interesting. 01:04:02 I assume someone's made a \\\ already? 01:04:05 or ||| 01:04:37 olsner: hm i don't _recall_ so. 01:04:57 this might be a good time to mention i'm amazed this channel doesn't have a search-for-esolang function 01:05:13 Anyone knows how unary minus mixes with list subscripts in Python? 01:05:14 -!- tromp_ has joined. 01:05:30 `cat bin/wiki 01:05:32 cat: bin/wiki: No such file or directory 01:05:39 Taneb: the way you'd expect, of course 01:05:44 HackEgo could have had, i guess 01:05:52 shachaf, I mean like -i[0] 01:06:02 oh 01:06:06 Which seems to work the way I expect 01:06:13 there you go, then 01:06:37 (i was thinking of negative indexing, which doesn't actually work the way you'd expect) 01:06:50 doesn't it count from the end 01:07:29 yes 01:08:17 oerjan: where's my olist 01:08:27 `pastlog `olist 01:08:58 No output. 01:09:05 help 01:09:11 `run ls bin/*log* 01:09:13 bin/anonlog \ bin/etymology \ bin/log \ bin/logurl \ bin/pastalog \ bin/pastelog \ bin/pastelogs \ bin/pastlog \ bin/randomanonlog \ bin/searchlog 01:09:15 you people 01:09:26 `randomanonlog 01:09:30 brainfuck can be compiled to machine code.. that's faster 01:09:36 `randomanonlog 01:09:40 AFK all 01:09:42 `randomanonlog 01:09:46 Saturday shall be red fedora day! 01:09:56 `randomanonlog 01:09:56 `randomanonlog 01:09:56 `randomanonlog 01:09:56 `randomanonlog 01:09:57 `randomanonlog 01:10:04 (recording my gf, don't worry) 01:10:05 fizzie: Pls fix with analytical logical skills not zapping 01:10:05 yes, there are very few of new concepts there. still interesting to write a shortest hello-world and a quine :) 01:10:05 85 <-- gentoo 01:10:05 s/,/m/ 01:10:39 what a mysterious function. 01:10:52 fungot: why use skills if you can use zapping? 01:10:53 olsner: ( define it " want to learn two languages at once, ecraven. internally to t, because fixnums are usually not modified very frequently. 01:11:06 kmc: "new wood stoves" would be a good name for a ban <-- I'LL TRY TO KEEP THAT IN MIND 01:12:25 context: 10:17 I believe SF bans new wood stoves but does not yet require removing existing ones. 01:13:18 context :( 01:13:42 you mean it wasn't a typo? freaky. 01:14:09 oerjan: sry 01:14:34 oerjan: would banning me make you feel better 01:16:53 we're not banning wood stoves in norway yet, but there's some serious environmental pollution control 01:17:07 shachaf: doubtful 01:17:41 now the pain killers kicking in otoh... 01:18:52 -!- yorick has quit (Remote host closed the connection). 01:19:29 http://www.nytimes.com/2013/12/17/science/earth/outsider-challenges-papers-on-growth-of-dinosaurs.html not all is well in the land of dinos 01:19:40 myhrvold sure is an eclectic dude. 01:21:29 -!- Taneb has quit (Quit: Leaving). 01:23:54 -!- Slereah has quit (Read error: Connection reset by peer). 01:24:21 -!- Slereah has joined. 01:24:57 avant-garde cuisine and patent law should _not_ be mixed hth 01:29:28 "Don't you just change "assertEquals(x, y)" to "it(x).should().equal(y)" ?" 01:30:45 -!- carado has quit (Ping timeout: 245 seconds). 01:31:36 sensible 01:37:20 -!- nooodl has quit (Ping timeout: 265 seconds). 01:41:32 Sgeo: lol now your library is Elegant™ 01:41:55 -!- muskrat has joined. 01:44:33 (fwiw I just quoted someone replying to PLT_Hulk) 01:44:56 Fiora: the thing about stack pointer reminds me of the (admittedly less extreme) hack where Linux puts a task-specific data structure at the end of the 8 kB aligned kernel stack, so you can get its address by masking the stack pointer 01:45:14 huh, sneaky 01:45:22 so it's like athread local storage type thing with stacks? 01:45:29 very useful in exploit code too! :3 01:45:48 yeah 01:46:07 hooray for sneaky things 01:46:20 does HackEgo have a database of sneaky things like lambdabot does 01:46:43 -!- realz has quit (Ping timeout: 260 seconds). 01:47:00 lol 01:47:02 what's lambdabot's 01:47:08 @where sneaky 01:47:08 dropFromEnd n xs = zipWith const xs (drop n xs) 01:47:10 @where sneaky2 01:47:10 lazyReverse xs = go xs (reverse xs) where go (_:xs) ~(y:ys) = y : go xs ys; go [] ~[] = [] 01:47:13 and so on 01:47:54 -!- realz has joined. 01:47:58 Sneaky? 01:48:25 Is that dropFromEnd supposed to be broken or just clever? 01:48:40 > zip [1] [1,2] 01:48:41 [(1,1)] 01:49:40 clever hth 01:50:07 > let xs = [1,2,3,4,5] in zipWith const xs (drop 2 xs) 01:50:08 [1,2,3] 01:50:17 in particular, it's O(n) space where n is that variable 01:50:24 i think 01:50:28 in particular it works on infinite lists 01:50:40 > let xs = [71..] in zipWith const xs (drop 2 xs) 01:50:41 [71,72,73,74,75,76,77,78,79,80,81,82,83,84,85,86,87,88,89,90,91,92,93,94,95,... 01:51:53 now someone can explain to me what the point of that lazyReverse is. 01:51:56 -!- Sprocklem has joined. 01:52:03 > let lazyReverse xs = go xs (reverse xs) where go (_:xs) ~(y:ys) = y : go xs ys; go [] ~[] = [] in lazyReverse [17,2,39] 01:52:04 It works on infinite lists. 01:52:05 [39,2,17] 01:52:09 > let lazyReverse xs = go xs (reverse xs) where go (_:xs) ~(y:ys) = y : go xs ys; go [] ~[] = [] in lazyReverse [17..] 01:52:14 mueval-core: Time limit exceeded 01:52:28 great. 01:52:30 It gives you a cons cell in the result as soon as it sees a cons cell in the input. 01:52:41 shachaf: hm well ok, as long as you don't look at the elements 01:52:45 Right. 01:53:11 > let lazyReverse xs = go xs (reverse xs) where go (_:xs) ~(y:ys) = y : go xs ys; go [] ~[] = [] in length . take 5 $ lazyReverse [17..] 01:53:12 5 01:59:26 -!- Slereah has quit (Ping timeout: 240 seconds). 01:59:49 -!- Slereah has joined. 02:01:38 `cat bin/` 02:01:40 exec bash -c "$1" 02:02:02 -!- muskrat has quit (Ping timeout: 264 seconds). 02:02:24 hm, psoas, is that just coincidence 02:02:47 saføui 02:02:52 also a coincidence 02:03:05 dag 02:03:19 natt 02:04:21 -!- heroux has quit (Ping timeout: 252 seconds). 02:06:37 -!- heroux has joined. 02:14:43 -!- realz has quit (Ping timeout: 252 seconds). 02:15:27 -!- Slereah has quit (Ping timeout: 240 seconds). 02:15:47 -!- Slereah has joined. 02:31:55 -!- Sprocklem has quit (Ping timeout: 260 seconds). 02:36:39 -!- Bike has quit (Ping timeout: 260 seconds). 02:37:33 Finished watching the Freeman’s Mind episodes released so far. ’Twas funneh. https://www.youtube.com/playlist?list=PL6PNZBb6b9LvDWpI-5CPYUxG1Rnm-vr9V 02:38:26 -!- Bike has joined. 02:58:02 Not sure if real life or The Onion http://www.cbc.ca/thisisthat/blog/2013/12/11/man-emerges-from-bunker-14-years-after-y2k-scare/index.html 02:58:13 satire 02:58:32 that was easy. 02:58:33 it's just fantasy 02:58:47 `` ` ` ` echo asdf 02:58:49 bash: -c: line 0: unexpected EOF while looking for matching ``' \ bash: -c: line 1: syntax error: unexpected end of file 02:58:54 hmm. 02:59:05 so (reset (cons 1 (shift w (cons 5 (w '()))))) => (5 1) 02:59:25 Hehe, ok. 02:59:29 should (reset (cons 1 (reset (shift k (k (shift w (cons 5 (w '())))))))) return (5 1) or (1 5) 02:59:40 i'm afraid 02:59:44 (not which does it, but which would you expect) 03:00:43 is there some way to do this in cps instead @_@ 03:00:57 not without making it worse 03:01:35 well it's gibberish so it can't get worse 03:01:40 i'm gonna guess (1 5) though 03:01:58 any reason? 03:02:01 -!- Sorella has quit (Remote host closed the connection). 03:02:18 because i'm imagining that the outer "reset" is totally ignored 03:02:49 that is indeed how shift and reset work 03:02:56 -!- realzies has joined. 03:07:09 is the (reset (cons 1 ...)) one like (let ((w (lambda (x) (cons 1 x)))) (cons 5 (w '())) 03:08:59 pretty much 03:10:26 the various delimiting operator differ in how they treat nesting 03:10:37 so the latter one is like (cons 1 (let ((k (lambda (x) x))) (let ((w (lambda (x) (k x)))) (cons 5 (w '())))))? 03:11:40 yes 03:12:03 hm. 03:14:26 -!- Phantom_Hoover has quit (Quit: Leaving). 03:16:17 -!- LinearInterpol has quit (Ping timeout: 250 seconds). 03:16:56 if nested shifts referred to nesting resets it would be equivalent to (let ((w (lambda (a) (cons 1 (let ((k (lambda (b) b))) (k a)))))) (cons 5 (w '()))) 03:17:20 "Facebook is seeking an experienced Software Engineer to help us port the world’s best PHP run-time on servers based on ARM processor" 03:22:06 I'm not sure which regime is more pleasant to use 03:29:30 quantum computation is whack 03:29:40 quantum PHP 03:29:44 YES 03:32:21 and reset and shift are functions right 03:34:04 I don't know if they are called functions 03:34:55 i mean, so you can do stuff like (map reset (list (lambda (f) (f (shift ...))) (lambda () (f (+ 1 (shift ...)))))))))))))))) and /we 03:35:34 yes 03:35:42 I think 03:35:56 what a pain in the ass. 03:36:03 :D 03:36:30 implementing this sounds annoying. 03:36:44 I faked it with macros 03:36:58 expanding to call/cc? 03:37:17 no, just code transformation 03:37:40 it doesn't allow me to hide the resets in a function though 03:37:54 how do you deal with (reset (list #1=(shift k ...) #1#)) 03:38:11 lets find out 03:40:17 -!- tromp_ has quit. 03:41:20 just fine 03:41:39 lol infinitely large programs 03:41:44 (reset (list #1=(shift k (list 1 (k 3))) #1#)) -> (1 (1 (3 3))) 03:41:46 -!- tromp_ has joined. 03:42:33 shouldn't hte list be symmetrical? 03:43:15 nope, juxtaposition turns into nesting, within a reset 03:44:38 so that's what you get from (reset (list (shift a (list 1 (a 3))) (shift b (list 1 (b 3)))))? 03:44:55 yes 03:45:19 I think the reader makes removes the cycle when it reads it 03:45:32 s/makes/ 03:47:17 yeah i don't get this at all. it depends on evaluation order now? 03:48:00 the wikipedia page actually explains this one well 03:48:11 http://en.wikipedia.org/wiki/Delimited_continuation 03:48:51 regular continuations expose evaluation order too 03:49:12 doesthiswork: where? 03:49:14 kmc: they do? 03:49:18 (let/cc k (+ (k 0) (k 1))) 03:49:27 oh well right. 03:49:36 i thought delimited continuations didn't, though. 03:50:20 props on choosing let/cc 03:50:37 delimited continuations are even _less_ pure 03:50:58 bike start reading at "(reset 03:50:58 (begin 03:50:58 (shift k (cons 1 (k (void)))) ;; (1) 03:50:58 null)) 03:51:02 thanks Bike 03:51:16 doesthiswork: begin has a particular evaluation order, thugh 03:51:18 though* 03:51:26 oerjan: but they're more composable! 03:51:34 oerjan: how so? 03:51:48 kmc: you can simulate state with them 03:52:47 like using them for yield? 03:53:11 i don't actually know how it works, i just read you can 03:53:26 i think you can do that with normal continuations too 03:53:43 fuck this im goin back to pron 03:53:50 goin back to prawns 03:53:52 you can implement coroutines right 03:54:05 -!- Sprocklem has joined. 03:54:07 and you can implement a ref cell with a thread and that works even in cooperative threading 03:54:11 you need mutable variables to simulated delimited continuations with only undelimited ones 03:54:42 bike: list doesn't have an evaluation order? 03:55:29 not in scheme? 03:55:52 I'm in cl 03:56:03 well what ever nerd 03:56:17 list is a function and so has unspec. eval order in scheme 03:56:58 what would be the point of faking delimited continuations in scheme. Someone else has already implemented them 03:57:33 because it's a scheme tradition to implement everything a hundred times 03:58:13 I suppose it is, they sound like forth-ers in that way. 03:59:26 the nice thing about faking with macros is I can see the intermediate steps 04:02:42 argh i forgot to turn off the quick heating mode again 04:03:01 * oerjan cannot even get heating frozen pizza right :P 04:03:54 * pikhq can cook 04:04:00 * pikhq is also eating PB&J. 04:08:08 fortunately it only makes it a bit too charred 04:08:11 but still 04:08:50 nooooooooooooooooooo 04:09:14 wow, you really like pizza 04:09:17 quintopia: you really hate charred pizza? 04:10:14 (only on the edge) 04:10:27 oerjan: i really hate that i can't solve this stupid problem 04:10:48 is it still the git problem 04:11:50 doesthiswork: actually i only eat it once a month or so 04:12:39 i just seem to mention it here, every time. 04:16:47 -!- glogbackup has joined. 04:17:30 !logs 04:19:08 @ask Gregor why do you let poor glogbackup outright lie (twice!) in its !logs message 04:19:08 Consider it noted. 04:19:23 !logs 04:23:34 -!- Slereah_ has joined. 04:25:11 -!- Slereah has quit (Ping timeout: 250 seconds). 04:27:51 @tell mroman Navier-Stokes sounds sciency <-- https://en.wikipedia.org/wiki/Navier%E2%80%93Stokes_existence_and_smoothness 04:27:51 Consider it noted. 04:30:32 huh, i didn't know hamilton tried to make 3ions for path finding <-- do you have some link about this? 04:31:40 oerjan: i'm looking for a program that can be proved nonterminating in higher-order logics, but not in ZF/FOL 04:32:09 finding one that is terminating and can't be proved so is easy, but the nonterminating one is killing me 04:32:31 (i say easy because there's a wikipedia article telling how to do it) 04:32:39 -!- Bike has quit (Ping timeout: 246 seconds). 04:33:36 biiiiiiiiiike 04:34:10 -!- oklopol has quit (Ping timeout: 245 seconds). 04:34:33 -!- Bike has joined. 04:35:51 biiiiiiiiiike 04:36:00 get a bouncer or a reliable server 04:36:07 huh, i didn't know hamilton tried to make 3ions for path finding <-- do you have some link about this? 04:36:50 quintopia: searching for an inconsistency in ZF/FOL should do the trick. 04:37:02 (by gödel's second incompleteness theorem) 04:37:18 Maybe main has the wrong type 04:37:27 Maybe it should be main :: CompileTimeIO (IO ()) 04:37:45 CompileTimeIO being IO enriched with metaprogramming stuff, perhaps 04:37:50 quintopia: assuming your higher-order logic proves ZF/FOL consistent, that is. 04:38:20 oerjan: so does that mean searching for a proof that ZF is consistent? 04:39:01 oerjan: by checking all proofs to see if they prove it 04:39:34 kmc: http://en.wikipedia.org/wiki/Icosian_calculus 04:39:59 nice, thx 04:40:02 quintopia: no. searching for a proof it _isn't_. 04:40:42 quintopia: or to be precise, enumerating all theorems of ZF/FOL and halting once you find a contradiction. 04:41:07 though i think i might have gotten the order backwards. 04:41:36 oerjan: ah. because there are no contradictions, but ZF doesn't know that. got it. 04:41:42 right 04:42:24 -!- tromp_ has quit (Remote host closed the connection). 04:42:30 http://en.wikipedia.org/wiki/Triangle_group#Hyperbolic_plane pretty 04:42:58 -!- tromp_ has joined. 04:45:03 kmc: check out this page then https://en.wikipedia.org/wiki/Uniform_tilings_in_hyperbolic_plane 04:45:33 (discussed here previously iirc) 04:47:00 -!- tromp_ has quit (Ping timeout: 246 seconds). 04:53:04 -!- tromp_ has joined. 04:55:55 oerjan: okay check my latest update on Onoz and make sure i did it right plox kthx 04:57:55 argh 04:58:25 i am coincidenaltiay on the page 04:59:51 quintopia: i don't you can check whether something is a valid godel number of a theorem. 05:00:14 what you need to do is check whether something is a valid godel number of a _proof_. 05:00:35 and whether that proof then ends in a contradiction. 05:00:58 *i don't think 05:01:42 i suppose that's a bit simpler than what i said above 05:02:26 more pretty! 05:03:06 oh okay so i could just let S be the program that checks the nth number and whether the result of that proof is that true=false? 05:03:19 yeah that would be enough 05:03:35 um except hm 05:04:37 the outer loop gives S every number n in order as long as a contradiction isn't found, right? 05:05:21 yes 05:05:45 the outer loop also prints 1 05:08:13 ok i think the idea is sound as written now. 05:16:12 > compare <$> [(0/0),0] <*> [(0/0),0] 05:16:14 [GT,GT,GT,EQ] 05:17:04 -!- glogbackup has quit (Read error: No route to host). 05:20:58 i feel like we shouldn't have to tag Uncomputable languages as Unimplemented. Uncomputable should be a subcategory of Unimplemented or something. 05:21:09 heh 05:21:12 -!- tromp_ has quit (Remote host closed the connection). 05:21:22 that sounds like a challenge 05:21:43 -!- tromp_ has joined. 05:22:10 Bike: okay. i'll give you a million dollars for a working implementation of any uncomputable language. :D 05:26:02 -!- tromp_ has quit (Ping timeout: 264 seconds). 05:34:45 -!- augur has quit (Remote host closed the connection). 05:35:12 -!- augur has joined. 05:35:13 -!- augur has quit (Remote host closed the connection). 05:35:19 -!- augur has joined. 05:49:36 which user was it that put a table of bf interpreter speeds on various problems on their user page? 05:50:20 -!- oklopol has joined. 05:59:10 http://esolangs.org/wiki/User:Rdebath#Performance_Matrix 05:59:18 quintopia: ^ 06:03:44 oerjan: i was thinking of david_werecat's bfbench 06:03:56 wow, what is that? 06:04:12 but this one looks more complete 06:05:40 what is bcci in the top row? 06:06:26 bcci seems to perform extraordinally in some tests and horribly in others 06:08:11 http://esolangs.org/wiki/Talk:Brainfuck#Interpreter.2Fcompiler_speed_test 06:08:37 "bcci: written to enforce the very strict portability rules of the BCC (a contest), and compute scores. " 06:09:09 http://www.hevanet.com/cristofd/brainfuck/bcci.c got it. 06:10:06 urgh, is sprunge still down 06:10:17 I always wanted to rewrite esotope-bfc for new decades ;) 06:10:43 yes. shit. 06:10:44 (and f*ck the python, python really is not a language for writing PL implementations) 06:12:40 quintopia: http://pastebin.com/PEpjaJRv that was fun. 06:15:40 yeah. pastie was slightly less annoying ime 06:18:55 Bike: please demonstrate that this implementation works by using it to decide some uncomputable problem 06:19:18 psh, what do you take me for? an engineer? i ain't need no tests. 06:20:10 if you really wanted you could try a few programs. anything in brainfuck, for example. 06:20:37 okay i've got one to test 06:21:04 please point me to a CLooP interpreter so that i may test it 06:21:47 do i gotta do everything 06:22:14 (also you should post it on the wiki if you haven't already. nice program.) 06:22:39 i guess i oughta get around to making an account some time 06:23:23 ... 06:23:27 what? 06:23:40 you just surprised me there 06:23:51 i figured you had an account 06:23:59 nope. i'm a parasite on this channel. 06:24:42 @ask ais523 just tested out your account creation question thing. it asked me when Somnypna was created and i said Homfrog and got rejected. 06:24:42 Consider it noted. 06:25:48 shocking 06:28:07 urgh, how do you do code blocks 06:29:38 -!- glogbackup has quit (Ping timeout: 264 seconds). 06:30:06 there. 06:30:44 Code::Blocks. 06:32:45 hmm. why is it that pforeach(infinity) is uncomputable? it seems like it should be possible to have an unbounded number of threads executing concurrently. indeed, executing the first thread on odd cycles, the second on 2 mod 4 cycles, the third on 4 mod 8 cycles, etc. should ensure that every natural numbered thread gets executed an unbounded number of times... 06:33:09 or do i misunderstand something 06:33:11 it mentions it takes finite time. 06:33:39 the language seems maybe 80% baked at best. i just picked the first one in the uncomputable category that looked good. 06:33:43 -!- Slereah has joined. 06:34:18 yeah but if you picked one that was mislabelled... 06:34:27 then your implementation is broken 06:34:45 but i guess the finite time thing 06:35:21 i shall define DLooP, "like CLooP but works" 06:35:38 -!- Slereah_ has quit (Ping timeout: 264 seconds). 06:36:11 i made a mistake anyway. 06:36:44 yeah i think the spec is borked. it doesn't say in the description of pforeach it finishes in finite time no matter what. it just says later it inherently does infinite work in finite time 06:36:54 yeah. 06:36:57 i was going off that. 06:37:06 seemed to be the intent since they put it under uncomputable. 06:37:12 well maybe we should just edit the page 06:37:46 to indicate that pforeach is guaranteed to take no longer than a constant times any one thread it is executing 06:38:10 then it will be able to do nondeterminstic computation in hyper mode 06:38:47 how about "if the block would halt for any value of the loop variable, the pforeach as a whole will halt." 06:38:54 for all values*, rather 06:39:18 in the range? probably specify that it just has to be values in the range 06:39:46 that's equivalent to my version, so whatever you like 06:39:59 i ain't editing it, i already dida ll this work 06:40:13 and i'm depressed since this means i have less excuse to sort out my own ideas enough to put them on the wiki 06:41:41 i think i will have to make it graphical and that means mspaint 06:42:13 you mean less excuse not to? 06:42:18 or more excuse to? 06:42:44 less excuse not to, yeah 06:44:00 then you shouldn't be depressed 06:44:04 you should be excited 06:44:23 i'm a bike. i'm incapable of feeling any emotion, let alone excitement. 06:44:45 you are capable of feeling motion 06:44:51 fast motion! 06:44:58 excitement is not a motion 06:44:59 are you the town bike? 06:45:25 yes, the demographics are very skewed towards sapient colors and dryer sheets in this town 06:45:47 so you give everyone a ride for free? 06:45:58 if they're polite about it and i'm not busy 06:46:15 wow. such kind. 06:46:25 damn straight 06:46:36 still 06:46:44 you don't need mspaint 06:46:50 why do you need graphics 06:47:24 because the language i'm thinking of would probably be easiest to hammer out as schematics rather than something text-based. 06:47:36 -!- oklopol has quit (Remote host closed the connection). 06:47:48 you could use unicode boxes. i hear that's the cool thing now. 06:48:23 -!- Sprocklem has quit (Quit: Leaving). 06:50:51 i'm thinking of making a program which is like mspaint but with unicode 06:51:07 fun, right 06:51:20 wlel i don't have mspaint anyway. this is linux. 07:13:54 oh look someone has made something similar already 07:13:57 http://www.jave.de/ 07:14:10 i can just steal their code and port it 07:29:48 -!- FreeFull has quit. 07:33:31 -!- CADD has quit (Read error: Connection reset by peer). 07:36:21 Bah, JavE. Truu ANSI artists do it in ACiDDraw. 07:36:33 Or maybe that's "trü". 07:41:03 fungot sp. 07:41:03 kmc: what have you. you have to 07:43:06 fungot: agaricales sensu lato 07:43:06 kmc: does it true? how could a glass be yelling??? fnord 07:43:34 you shouldn't feed fungot those agaricales hth 07:43:34 oerjan: be without brainfuck code running functionality? 07:44:09 so, should i take Category:Unimplemented off of Brainhype 07:45:51 oerjan: why not feed fungus to the fungot 07:45:51 kmc: still a chance work visa won't go through but it's looking like a lot of languages 07:47:07 kmc: because e's high enough already 07:47:29 you just assume the mushrooms i have are hallucinogenic 07:47:34 fungot agaric 07:47:34 Bike: there must be another one? lol 07:47:35 it's like i have a reputation or something 07:47:48 shocking 07:48:24 we planted a bed of wine caps (Stropharia rugosoannulata) in the backyard today 07:48:33 might bear fruits in 4 or 5 months 08:00:08 -!- LinearInterpol has joined. 08:00:33 p. sure wine bottles don't work that way 08:01:34 -!- impomatic has joined. 08:05:01 -!- carado has joined. 08:08:07 -!- LinearInterpol has quit (Read error: Connection reset by peer). 08:16:06 -!- Taneb has joined. 08:19:53 Pro tip: don’t force a rubber bottle cap in if it’s difficult to get out. 08:20:23 -!- LinearInterpol has joined. 08:27:28 -!- AnotherTest has joined. 08:27:54 GOT IT 08:38:03 -!- carado has quit (Ping timeout: 252 seconds). 08:56:11 -!- atriq has joined. 08:56:31 -!- Taneb has quit (Quit: Leaving). 08:56:33 -!- atriq has changed nick to Taneb. 09:05:44 -!- doesthiswork has quit (Quit: Leaving.). 09:22:52 -!- Slereah_ has joined. 09:24:28 -!- Slereah has quit (Ping timeout: 252 seconds). 09:43:15 -!- pikhq has quit (Ping timeout: 245 seconds). 09:56:57 -!- pikhq has joined. 09:57:28 -!- LinearInterpol has quit (Read error: Connection reset by peer). 09:57:53 -!- LinearInterpol has joined. 10:02:43 -!- pikhq has quit (Ping timeout: 243 seconds). 10:06:07 -!- oerjan has quit (Quit: leaving). 10:09:13 -!- pikhq has joined. 10:14:15 -!- LinearInterpol has quit (Ping timeout: 246 seconds). 10:27:17 -!- glogbackup has quit (Ping timeout: 248 seconds). 11:06:20 -!- Slereah has joined. 11:07:38 -!- Slereah_ has quit (Ping timeout: 245 seconds). 11:13:05 -!- ais523 has joined. 11:18:35 -!- Slereah_ has joined. 11:19:16 -!- Slereah has quit (Ping timeout: 260 seconds). 11:24:54 -!- carado has joined. 11:44:04 -!- LinearInterpol has joined. 11:54:28 -!- nooodl has joined. 12:05:05 -!- LinearInterpol has quit (Read error: Connection timed out). 12:06:11 -!- LinearInterpol has joined. 12:18:30 -!- LinearInterpol has quit (Ping timeout: 246 seconds). 12:27:36 -!- callforjudgement has joined. 12:27:45 -!- ais523 has quit (Disconnected by services). 12:27:46 -!- callforjudgement has changed nick to ais523. 12:58:26 -!- LinearInterpol has joined. 13:04:02 -!- boily has joined. 13:04:36 -!- metasepia has joined. 13:05:04 good redactyled morning! 13:13:33 -!- Sgeo has quit (Read error: Connection reset by peer). 13:29:43 -!- KingOfKarlsruhe has joined. 13:33:40 what 13:33:48 what is metasepia up to today 13:34:28 eh? 13:34:36 metasepia is the same as ever. 13:36:26 what are you up to today 13:36:42