00:13:23 -!- adu has joined. 00:18:05 -!- ProofTechnique has joined. 00:22:44 -!- ProofTechnique has quit (Ping timeout: 264 seconds). 00:27:33 -!- Phantom__Hoover has joined. 00:29:13 -!- fractal has quit (Ping timeout: 265 seconds). 00:30:11 -!- aretecode has quit (Ping timeout: 265 seconds). 00:30:15 -!- Phantom_Hoover has quit (Ping timeout: 250 seconds). 00:32:50 -!- aretecode has joined. 00:34:25 -!- Tritonio has joined. 00:37:02 -!- fractal has joined. 00:46:21 I usually run long-running jobs on the university's computer 00:47:56 because as some of you know, my personal computer is total crap 00:54:42 helloren. what kind of long-running jobs are they? 00:59:49 graphics rendering, ai training, that sort of thing 01:19:06 -!- ProofTechnique has joined. 01:24:25 elliott: helliott. I find this acceptable: the +1 long sword of Punishment (weapon) {drain, +Blink +Fly rElec rPois Dex+2} 01:26:11 that's a very caster weapon, heh 01:27:16 -!- zemhill_ has joined. 01:27:54 -!- zemhill has quit (Remote host closed the connection). 01:29:17 #define up2(i,n) for(i=0;i<(n);i++) 01:29:33 boily: your term is slightly less huge than usual. I find this commendable. 01:33:32 #define up3(i,q,n) for(i=(q);i!=(n);i++) 01:34:00 #define malloc(x) ((void*)&(x)) 01:34:26 nice skilling 01:34:44 #define new(T) (T*)malloc(zv(T)) 01:34:58 #define zv(T) sizeof(T) 01:35:41 #define return for(;;) 01:36:54 #define zzzzz do{printf("FUUUUUU");exit(374872);}while(1) 01:36:57 -!- zzo38 has joined. 01:37:20 On a vastly more serious note, unshare() is neat. 01:38:32 elliott: my term is slightly huger when I'm on my laptop hth 01:38:43 that sounds a bit backwards. 01:38:46 elliott: also, I'm experimentaling with my skills. 01:38:54 by turning them all on :p 01:39:10 my laptop's display is 1920×1080, whereas my desktop's is 1680×1050. 01:39:18 it works. 01:39:47 -!- Phantom__Hoover has quit (Read error: Connection reset by peer). 01:41:32 #define randi(l,u) rand()%(u-l+1)+l 01:42:00 AAAAURGH! 01:42:09 aurgh! 01:42:19 what?!? 01:42:42 I got splattered to smithereens. 01:43:03 mismanaged the mob and I was exploded into tiny slimy bloody fragments. 01:43:44 -!- Tritonio has quit (Ping timeout: 252 seconds). 01:47:13 -!- Lymia has quit (Ping timeout: 250 seconds). 01:47:21 -!- oerjan has joined. 01:48:13 -!- Froo has joined. 01:52:01 -!- Froox has quit (Ping timeout: 264 seconds). 01:57:16 -!- FireFly has joined. 02:17:19 -!- hjulle has quit (Ping timeout: 245 seconds). 02:29:33 -!- Lymia has joined. 02:35:11 helloily. watcha playin? 02:35:28 nethacks? 02:37:46 quinthellopia! DCSS. 02:38:08 well, playing is a fancy word. I'm more down to earth, back to dying simply and effectively. 02:39:33 always look at the bright side of death 02:40:18 hellørjan. the more practice you have dying, the better you get at avoiding it! 02:43:59 g'earlymoily. fancy. 02:46:05 * boily is thinking to himself “I am not being called Girly Molly. I am not being called Girly Molly. Brain, stop being dyslexic.” 02:46:43 ye brane, staff beeing disliking 02:46:57 -!- dianne has quit (Ping timeout: 245 seconds). 02:48:04 I could be Molly Grue for all I know... self identity is such a hazy concept. 02:48:29 a gruesome idea 02:48:55 -!- dianne has joined. 02:55:24 -!- boily has quit (Quit: UNICORN CHICKEN). 02:59:54 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 03:19:36 -!- GeekDude has joined. 03:22:08 -!- GeekDude has quit (Client Quit). 03:46:19 confirmed: a single-layer perceptron utterly fails at doing xor 03:48:24 -!- MDude has changed nick to MDream. 03:49:18 But ti works with a 2-2-1 network, thus showing that my code is correctly implemented. ieiii! 04:13:29 -!- ProofTechnique has quit (Ping timeout: 246 seconds). 04:52:13 -!- bb010g has joined. 04:54:07 https://www.reddit.com/r/videos/comments/2ujjl8/he_may_be_british_but_the_point_applies_in_the_us/ 04:54:20 Horrifically anti-intellectual video or important point about missing priorities? 04:54:40 I tend to think it's both, that the things people aren't taught in school that he mentions absolutely should be 04:54:55 But don't really see a downside to teaching those 'useless' things as much 04:55:06 (Except that priotization is a thing) 05:12:01 Most of the things he mentions were taught to me by my parents 05:12:59 I don't think it's necessarily a good idea to rely on that in general though 05:13:33 Especially for important-but-not-yet-commonly-known things, such as recognizing signs of mental illness. Can't teach how to treat or perfect detail maybe, but can teach at least some recognition signs 05:14:51 True, that one is a good idea 05:15:37 But how to vote, pay taxes or budget, and the laws, were all taught to me by my parents 05:15:53 * oerjan now over 9000 05:17:01 hm i don't think my parents taught me any of those 05:17:03 I still don't know how to budget >.> I just sort of assume that if I set aside 20% of my income as 'allowed to spend frivolously' I'm good. Except that that account has become my -pay stuff online- account, which isn't perfectly correlation with -stuff I want but don't need- 05:17:18 although my mom was darn good at budgeting so i'm sure she would have if i'd asked 05:17:55 Also going to need to figure out taxes for the first time this year 05:18:22 One thing that he didn't mention is cooking. Absolutely everyone should be able to cook a meal for themselves. 05:18:23 (Last year my dad did them for me. Totally educational. I need to stop relying on him) 05:18:26 (i suppose they may have told me _some_ laws. i'm still unsure about many.) 05:20:55 i knew how to do my taxes once, but the government has made it so easy that i don't need to any more 05:21:10 The best point he makes imo is the one about history. I only know what the Cold War was abut because my father explained it. it was never covered in school. 05:22:25 They covered c. 1912-1945 when they should have covered 1950-2000 05:22:48 heh 05:23:16 education was never free from the influence of politics 05:23:26 among others 05:25:23 (basically everyone who doesn't have a complex economy (like running your own business or the like) gets a suggested tax form from the government, and if you basically agree with it you don't need to do _anything_) 05:26:31 How utterly sane. 05:28:52 the insane part is that this makes the tax authorities the most service-minded branch of the norwegian government, with the best publicity. 05:28:57 "you won't have a calculator every day" -- only true in primary education system. In University either the numbers are so small you don't need them, or you DO get a calculator 05:29:27 ...until you actually _disagree_ with them, that is. then things can get rather ugly. 05:30:19 I don't know my times tables, and this has not been a detriment since grade 11. 05:30:33 (but i don't expect they're worse than other countries in that respect.) 05:32:55 There were a few current event projects in my school, where we were tasked with writing about whichever current event we wanted 05:33:12 * oerjan does know his times tables. helps a lot with that calculator crossword in the newspaper. also, prime numbers. 05:33:31 The thing about calculators I disagree with though. Yes, we carry around calculators, but there's no way any of my teachers could have predicted that. 05:33:50 Most teachers can't see the future. 05:34:04 When i was in school hand calculators were already universal 05:34:21 it was the 90's after all 05:34:26 Would you have believed you would carry one in your pocket every day? 05:34:32 For your adult life? 05:35:03 My friend had one on his keychain, so yes. 05:35:44 Hrm, ok 05:36:33 I mean-- I was born in 1993. There were cell phones, laptops, etc throughout my childhood 05:37:04 the year september never ended 05:37:42 that's how i know i'm old on the internet, i was there _before_ that. 05:38:23 My dad told be email addresses used to look like name!name!name 05:38:34 I had crappy laptops during my childhood 05:38:59 I remember bringing a DOS laptop to my babysitter's house when I was a kid 05:39:21 I often make calculation by hand or by mind if it is simple enough, although I also have a TI-92 calculator that I usually have when traveling somewhere 05:39:35 My mom had a IBM DOS laptop that she made my dad carry because it was heavy as hell. 05:42:57 i still have the Oric-1 down in the storage room (technically it's my dad's), i think if i tried to turn it on the neighbors would call the cops on me, that had some _ugly_ radio interference. 05:44:56 (pre-DOS computer) 05:45:12 -!- adu has quit (Quit: adu). 06:28:45 -!- Froo has quit (Quit: *bubbles away*). 07:31:00 -!- Patashu has joined. 07:34:32 -!- chaosagent has quit (Read error: Connection reset by peer). 07:59:19 The rules of golf says that ice can be considered as casual water or as loose impediments at your choice. If it is loose impediments then you can remove it, but what happen if both balls are on the putting green, whoever ball is farther away from the hole wants to remove it, is the other player allowed to put it back exactly where it was before in order to treat it as casual water or you have to do without it instead? 08:03:50 -!- FreeFull has quit (Ping timeout: 246 seconds). 08:05:40 -!- tromp__ has joined. 08:05:40 -!- zzo38 has quit (Read error: Connection reset by peer). 08:09:16 -!- tromp has quit (Ping timeout: 255 seconds). 08:09:25 -!- zzo38 has joined. 08:12:05 What is "/w00tw00t.at.blackhats.romanian.anti-sec:)"? 08:18:55 zzo38: well, if both players can choose to remove or replace the ice at will any number of times, then clearly the non-active player gets to decide the outcome due to the infinite loop rules. 08:22:07 I get other strange HTTP requests too such as for "/lolo/lol/lo.php" and "/tmUnblock.cgi" and "/wqwq/wqw/wq.php" as well as one that doesn't have a valid request method; the entire request is "\xa7\x02" without GET or anything else. 08:22:57 zzo38: maybe that tried to be some request for some protocol other than HTTP 08:23:42 Well, it isn't a protocol I recognize. Other malformed requests include "\xff\xff\xff\xff@\x01r" and "\xff\xff\xff\xff@\x01s" 08:24:10 (I also don't know what "/muieblackcat" is.) 08:24:16 Do you recognize any of these? 08:25:01 -!- Frooxius has joined. 08:25:10 I reimplemented this font http://www.arcavia.com/Software/ProgFont/. http://snag.gy/lkMAc.jpg 08:26:52 All kinds of crazy code is running out there. Could be a malformed student project, a malfunctioning botnet, who knows 08:30:10 Also "/rom-0" and "/back.css" and "/tag_products.php?id_tag=%27" and "/w00tw00t.at.ISC.SANS.DFind:)" and "/1gophserv" (this last one seems to be a misinterpretation of a gopher URL as HTTP). And even "/user/soapCaller.bs" and various requests for stuff in /cgi-bin/ (I have nothing there) and many things that are trying to be proxy requests. 08:31:52 requests for cgi-bin are possibly hacking attempts? 08:32:24 I would think they try to see what software is installed. Well, there is no such file. 08:33:34 However, they try the same file too often, and they shouldn't do that after you can already see there is no such files. 08:46:40 zzo38: I've got /muieblackcat in my apache logs, let me see the others 08:47:44 Do you have files with any of those names on your computer? 08:47:50 no 08:48:01 well, let me locate, but definitely not in the HTTP 08:48:04 -!- Frooxius has quit (Quit: *bubbles away*). 08:49:48 I've got requests for /rom-0 (maybe it's some router or other embedded device thing), requests with User-Agent starting with () to try to use that bash vulnerability, 08:50:59 http://blog.malwaremustdie.org/2013/10/a-disclosure-of-whats-behind-w00tw00t.html 08:51:41 and yes, I've got /w00tw00t.at.blackhats.romanian.anti-sec:) too 08:52:04 what other files did you say? let me see 08:52:22 yes, /back.css too 08:53:16 and also /user/soapCaller.bs 08:53:27 so basically all of them, except /1gopherserv 08:53:46 yes, /tmUnblock.cgi too 08:57:08 /1gophserv is specific to my computer because probably someone tried to follow a gopher:// URL but it changed to http:// and then it didn't work. 08:57:24 zzo38: yeah 08:58:54 I get hits to files that actually exist, very often apparently from the bots of google, yahoo, and baidu 09:01:05 zzo38: have you got any of the bash bug requests? 09:03:00 uhm... 09:03:04 ghc does weird things 09:03:27 I don't know; I cleaned the log now and don't log user-agents 09:03:34 ok 09:03:34 If you multiply an MVar Double with a Double 09:03:35 like 09:03:44 someMVar * someDouble 09:03:56 in a function like foo someMVar someDouble 09:04:07 it will say: Expected type MVar Double -> MVar Double 09:06:36 http://codepad.org/dE059AxK 09:06:55 or is there a Num instance for MVars? 09:07:08 I'd expect it to report No Instance Num (MVar Double) 09:07:17 mroman: what? 09:07:30 wouldn't you need to read the mvar and then >>= multiply it 09:08:37 like, fmap (2.7*) :: MVar Double -> IO Double 09:48:10 -!- Tritonio has joined. 09:59:22 mroman: pretty sure your last $ var should be $ value hth 10:02:16 also that error message doesn't contain "Expected type MVar Double -> MVar Double" so what are you babbling about 10:06:53 you _could_ actually make a Num instance for MVars, couldn't you. or even an Applicative instance. it would be weird and not very thread-safe... 10:07:20 oh wait, no. 10:07:41 not without unsafeSomething. 10:07:57 -!- Phantom_Hoover has joined. 10:08:59 otoh if you had newtype CrazyApp a = CrazyApp (IO (MVar a)) 10:30:36 instance (Appicative f, Num a) => Num (f a) 10:31:32 that's what i was alluding to 10:33:10 Between 1788 and 1868, approximately 165,000 convicts were transported to various parts of Australia. All of them were category theorists. 10:34:00 OKAY 10:41:47 -!- SopaXorzTaker has joined. 10:58:58 -!- Patashu_ has joined. 10:58:58 -!- Patashu has quit (Disconnected by services). 10:59:58 -!- Patashu_ has quit (Client Quit). 11:06:27 -!- Patashu has joined. 11:10:52 -!- oerjan has quit (Quit: leaving). 11:17:50 The nvicts were hanged. 11:24:32 -!- Tritonio has quit (Ping timeout: 252 seconds). 11:26:40 -!- boily has joined. 12:00:31 Well, this is some wild stuff. Like Haskell in Lisp-ish syntax. https://github.com/ympbyc/Carrot 12:08:55 -!- oren has quit (Quit: Lost terminal). 12:22:18 -!- boily has quit (Quit: WHITEPOINT CHICKEN). 12:27:59 -!- Koen_ has joined. 12:28:44 -!- Phantom_Hoover has quit (Ping timeout: 264 seconds). 12:31:13 -!- vanila has joined. 12:33:32 http://esolangs.org/wiki/--C-%3DC-C-- 12:33:35 how is this turing complete? 12:34:54 -!- hjulle has joined. 12:40:34 You can write hello world and 99 beers in it, qed 12:42:37 lol 12:49:29 -!- oren has joined. 12:53:52 -!- Patashu has quit (Ping timeout: 240 seconds). 13:29:04 is C++ templates an esolang 13:31:06 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 13:31:45 -!- ProofTechnique has joined. 13:31:46 c++ templates is some kind of language 13:43:05 http://en.wikipedia.org/wiki/Barton%E2%80%93Nackman_trick 13:43:22 this is like math or something 13:50:45 everything is like math or something. usually like something, but sometimes like math. 13:50:57 so true man 13:54:11 Nah, this is a pointer. 13:55:12 yes, everything is math 14:01:47 But basically this whole trick is just a workaround of the fact that c++'s algolish syntax doesn't define which operand of == is the "self". 14:02:06 algolish as opposed to smalltalkish? 14:03:03 as opposed to all the excellent alternatives 14:03:53 for example, you could make a rule that a==b is always a.equals(b) 14:04:36 oren: that would be a bad idea, because then you could no longer write (0 == smartpointer) or write (nullptr == smartpointer) 14:05:24 You can, in fact, have two different definitions for a==b and b==a 14:05:32 Because C++ 14:05:52 good point. maybe b.equals(a) would be better for the constant == variable convention (which is only necessary because they used = for assignement) 14:06:24 -!- FreeFull has joined. 14:16:16 http://snag.gy/uZKT8.jpg 14:19:02 C++'s resolution rules are way too complex enyway 14:19:06 lol the size difference 14:19:16 btw you might be interested in PNG 14:22:20 vanila: Oh, you mean in the picture. yah, artists cometimes screw up the perspective like that 14:25:06 quick haskell question: in an Array Int (Map foo bar) will i be able to somehow update the map without changing the array? 14:26:24 Array e a is just a faster [a] 14:27:07 that doesn't answer the question 14:27:29 You're right, it doesn't 14:27:58 like: can i update a single element? 14:28:11 does haskell have mutable state? 14:28:31 you could use a mutable array instead of Array 14:29:04 isn't that horribly slow at writing? 14:29:15 I don't think so, I dont really know though 14:30:16 not slow at all. it just mutates in place 14:30:21 ah 14:30:23 okay 14:31:39 was there any progress on diff arrays to not suck 14:31:42 oh, monads 14:31:43 -!- FireFly has quit (Changing host). 14:31:43 -!- FireFly has joined. 14:32:35 yes, mutable arrays live in IO or ST monad 14:32:48 meh 14:33:14 If you don't know, use Data.Sequence. 14:33:54 oh, nice 14:33:59 ST is really cool because it is mutable internally, but can be used in a pure way 14:34:10 huh? 14:36:10 set aside the state 14:36:12 yes 14:36:28 when you use the state, it's impure 14:36:29 -!- ProofTechnique has quit (Ping timeout: 245 seconds). 14:36:59 also 14:37:06 boxed versus unboxed 14:37:08 ? 14:38:06 boxed 14:42:31 okay, sequence is too slow 14:45:49 -!- FreeFull has quit (Ping timeout: 256 seconds). 14:48:57 http://www.reddit.com/r/dailyprogrammer/comments/2ww3pl/2015223_challenge_203_easy_the_start_of_something/coyxvoj 14:49:21 most of the program is just gibberish. 14:49:58 haha, good one 14:52:37 of course, the program isn't actually square 14:52:48 it just looks square when printed in plaintext 14:52:49 :P 14:54:35 http://www.netfunny.com/rhf/jokes/88q3/0tenny.html 14:54:41 saw this on the wiki.. 14:57:32 https://gist.github.com/TieSoul/0e116f1156e2ae1d5ffe here's the "clean" version 14:57:41 if anyone's curious 14:58:47 also, Gist has a Befunge language category, but no highlighting. 15:02:41 -!- `^_^v has joined. 15:06:24 TieSoul: I think HackerRank supports doing exercises in Befunge. 15:06:35 Really? 15:07:30 Ahh, no, I'm mistaken, I think I was thinking of somewhere else. 15:07:40 It does have Brainfuck and Whitespace though. 15:08:31 I promoted Befunge at work the other day. 15:08:44 Mainly by showing fungot sources to colleagues. 15:08:44 how complex would the highlighting regexes for befunge be? 15:09:00 They commented that it all seemed very practical. 15:09:33 (I also showed them the graphified version.) 15:09:37 did someone say fungot? is he back? 15:09:47 Sadly, no. 15:09:56 hrm... 15:09:57 A BT engineer has promised to visit on March 3rd. 15:09:59 Befunge regexes? 15:10:06 sounds like an interesting challenge 15:10:30 in most editors, regexes are used to decide the syntax colorings. 15:10:53 Of course, I'll be off-country the next two weeks or so, so the fungot shortage shows no signs of abating. 15:11:11 ohh 15:11:13 you mean 15:11:21 Befunge highlighting 15:11:25 yeah 15:11:31 You could do the trivial context-free highlighting trivially. 15:11:40 I don't think you could accurately tell what's a string and what's not without running it 15:11:47 And the more complicated thing not at all, pretty much. 15:12:02 and some things could be both a string AND not 15:12:09 yep 15:12:19 and the contents of cells can change during running the program too 15:12:30 so context-free highlighting is pretty much the best you're going to get 15:12:38 Being both string and commands is just a matter of translucency. 15:13:03 hehe 15:13:11 For a "well-behaved" program, you can do quite a bit with static analysis, but the editor context is worse for that kind of stuff, since the code would spend most of the time being invalid. 15:13:38 Every time you misplace a >, the rest of the program would be re-highlighted completely differently. 15:13:39 fizzie: translucency if it's achieved using bridges (trampoline instructions), polarized light if it's achieved using different directions of execution 15:14:14 befunge highlighting can't be properly done with regexes. 15:14:17 b_jonas: Combined with one of those polarized 3D glasses, that'd be nice. 15:17:08 http://users.ics.aalto.fi/htkallas/fungot.png for those who haven't seen it yet. 15:17:52 it can't be displayed because it has errors 15:18:07 Works for me. It's a biggish file, though. 15:18:14 7485x15016 pixels. 15:19:04 automatically generated Befunge flowcharts? 15:19:16 http://users.ics.aalto.fi/htkallas/fungotsmall.png is a 1:5 scale replica, if 7485x15016 sounds scary. 15:19:19 Yes. 15:19:26 cool 15:20:02 There's a bit of crude heuristics to handle things like j. 15:20:45 jesus christ... pkill -9 firefox 15:20:53 "Sorry." 15:21:30 Also I think there was some heuristic about ignoring reflections from fingerprint instructions that don't "look like" they're being handled, since those are a big source of potential static control flows that don't (or shouldn't) occur in practice. 15:22:25 hrm 15:22:36 is the flowchart generator up for download? :P 15:22:38 what are fingerprint instructions? 15:23:21 oren: https://groups.google.com/d/msg/comp.unix.questions/Pg0Gv1Vk9G4/O-k8lym2DXoJ 15:33:32 -!- CADD has quit (Ping timeout: 265 seconds). 15:37:13 -!- tomlukeywood has joined. 15:37:23 -!- tomlukeywood has left. 15:37:37 -!- dulla has quit (Ping timeout: 264 seconds). 15:47:17 -!- dulla has joined. 15:48:24 TieSoul: I don't think so, I think I did it as a ugly one-off Java thing or something. 15:48:33 oh, alright. 15:49:28 b_jonas: The A..Z commands can be redefined by loading fingerprints. They have a general contract (of sorts) that they reflect on error, but of course for many fingerprints there are often instructions that never fail. 15:53:49 I use pkill -9 firefox when firefox has started swapping and is threatening to hang my system. 15:55:27 oren: Do you need swap? 15:57:23 I have only 2GB memory 15:59:19 Some programs need morethan that, but unlike Firefox they don't need it all at once 16:01:04 oren: I see. Perhaps you could run firefox with a resource limit on memory if you know its behavior in this regard? 16:02:11 I tried that, it doesn't seem to work well. If only I could ban firefox from swap while letting other procs use it 16:03:34 -!- paul2520 has quit (Ping timeout: 245 seconds). 16:04:01 -!- GeekDude has joined. 16:04:30 fizzie: ok 16:06:23 -!- FreeFull has joined. 16:07:16 hmm... maybe the problem would be less if I made a sawp file on a n SD card... 16:07:37 Why are all your strings backwards. 16:07:42 * Lymia pokes fizzie 16:08:38 Lymia: It's Befunge. 16:08:43 Lymia: You know, stacks. 16:08:47 Well, they're 0"gnirts"es 16:09:24 why not by convention put all strings in < direction then 16:09:45 Where's the fun in that 16:09:51 lol 16:10:19 -!- mihow has joined. 16:11:09 @where fun 16:11:09 I know nothing about fun. 16:13:42 `befunge <@."hello" 16:13:52 erm 16:13:59 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: befunge: not found 16:14:59 Clearly strings should all be in ^ direction 16:16:09 `funge <@_.<0"hello" 16:16:09 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: funge: not found 16:16:52 ergo: forward strings don't work in befunge 16:24:49 -!- Lymia has quit (Remote host closed the connection). 16:25:14 -!- Lymia has joined. 16:33:25 -!- paul2520 has joined. 16:33:31 -!- paul2520 has quit (Changing host). 16:33:31 -!- paul2520 has joined. 16:34:58 -!- TieSoul_ has joined. 16:35:52 -!- TieSoul has quit (Disconnected by services). 16:35:58 -!- TieSoul_ has changed nick to TieSoul. 16:43:53 -!- augur has quit (Read error: Connection reset by peer). 16:44:12 -!- ^v has joined. 16:44:38 -!- augur has joined. 16:55:36 -!- ^v has quit (Read error: Connection reset by peer). 17:00:01 -!- Phantom_Hoover has joined. 17:00:02 -!- oren has quit (Ping timeout: 252 seconds). 17:05:02 -!- SopaXorzTaker has quit (Remote host closed the connection). 17:07:53 -!- oerjan has joined. 17:09:40 Well, this is some wild stuff. Like Haskell in Lisp-ish syntax. https://github.com/ympbyc/Carrot <-- i am pretty sure there used to exist a "liskell" 17:10:15 oerjan: There's been a couple. There's even a "Haskell Lisp" Twitter account. But sadly none seem to have ever gone anywhere. 17:11:33 -!- AnotherTest has joined. 17:11:51 MLs don't work well with lisp syntax 17:12:04 that's why they usually use ML-like syntax 17:13:01 shocking 17:14:44 :/ 17:22:17 -!- FreeFull has quit (Ping timeout: 265 seconds). 17:22:30 vanila: is there a proof or something? 17:23:27 vanila: Well, what's weird about Carrot is, it does use an ML-like syntax, but with everything still being in prefix notation. 17:23:41 So = is still the declaration operator... 17:23:50 I also couldn't make heads or tails of the conditional syntax. 17:24:21 :t (head ||| tail) 17:24:22 Either [[a]] [a] -> [a] 17:25:06 :t either 17:25:07 (a -> c) -> (b -> c) -> Either a b -> c 17:25:15 :t (|||) 17:25:16 ArrowChoice a => a b d -> a c d -> a (Either b c) d 17:25:29 i guess either is the specialization 17:25:58 :t both 17:25:59 (Data.Bitraversable.Bitraversable r, Applicative f) => (a -> f b) -> r a a -> f (r b b) 17:26:08 :t (&&&) 17:26:09 Arrow a => a b c -> a b c' -> a b (c, c') 17:26:14 NOT SYMMETRIC 17:26:32 bad naming, no cookie 17:26:34 why c' and not d? 17:27:11 why indeed 17:28:24 maybe because c is not to c' as a is to b (because a is the arrow itself) 17:29:08 except, of course, ||| does it anyway 17:29:35 conclusion: it's to confuse people 17:30:25 I seem to recall a haskell manual stating "giving the type of a simple function is usually enough to understand what it does" 17:31:03 it has to be very simple and very polymorphic, though 17:31:05 I guess if I knew what Arrow meant I'd understand though so that's ok 17:31:22 Arrow is kind of a mess 17:31:30 okay 17:32:08 in afterthought it is like a mix of Applicative and Category, but not exactly the former because it has an extra argument 17:32:10 to be honest I don't even know what "a b c" means 17:32:40 a good approximation is to say a = (->), so a b c = (b -> c) 17:32:46 ooooh 17:32:58 that's the arrow used for 90% of use cases, anyhow. 17:33:15 okay 17:33:38 so &&& merges two functions or something 17:33:46 (it turns out that several of the Arrow methods happened to be useful, not already defined functions for the (->) case) 17:33:49 yep 17:34:04 > (succ &&& pred) 'b' 17:34:05 ('c','a') 17:34:25 nice 17:34:29 > (succ *** pred) ('b', 'K') 17:34:31 ('c','J') 17:34:34 they aren't already defined _because_ Arrow existed early enough in the library that people didn't bother to define specializations 17:35:58 and ||| despecializes 17:36:19 takes two functions and merges the domains 17:36:35 > (succ ||| chr) (Left 'a') 17:36:36 'b' 17:36:48 > (succ ||| chr) (Right 48) 17:36:49 '0' 17:37:06 nice 17:39:35 i think Arrow was invented before Applicative and had some of the same intended uses, so when the latter got more popular Arrow (which is really complicated in comparison) got much less use except for the (->) specializations 17:39:49 (both can be used for parsers, e.g.) 17:39:50 -!- MoALTz has quit (Quit: Leaving). 17:40:20 do you have an example of when Arrow isn't -> ? 17:40:43 :t Kleisli 17:40:44 (a -> m b) -> Kleisli m a b 17:41:02 when m is a Monad, Kleisli m is an Arrow 17:42:01 hmm. 17:42:07 so these days we just use Applicative instead? that's good, because I know what Applicative does. 17:42:25 well thank you for the lesson :) 17:42:32 > (Kleisli $ \x -> [x]) &&& (Kleisli $ \x -> [x+1]) $ 3 17:42:33 Couldn't match expected type ‘s0 -> t’ 17:42:33 with actual type ‘Control.Arrow.Kleisli [] c'0 (c'0, c'0)’ 17:42:34 (it's like a burrito) 17:42:37 gah 17:43:19 b_jonas: there's a sense in which Arrow = Applicative + Category + a law or two 17:44:05 oerjan: um... ok 17:44:11 I don't think I understand that but ok 17:44:26 well first of all every Arrow is a Category 17:44:56 secondly, if a is an Arrow then a b is morally an Applicative 17:45:25 (although haskell's class system doesn't allow this to be expressed as a superclass) 17:45:51 and you can define the functions going back and forth 17:45:58 the limits of hskell 17:46:41 although you need some extra laws to get the full Arrow laws 17:47:37 https://cdsmith.wordpress.com/2011/07/30/arrow-category-applicative-part-i/ 17:47:45 -!- MoALTz has joined. 17:48:27 oerjan: and does it work backwards too? can you take any Applicable m => m and make an Arrow a => a from it such that a b c is similar to b -> m c ? 17:48:47 -!- vanila has quit (Quit: Leaving). 17:48:56 wait, that's what you said Kleisli does 17:49:06 b_jonas: no Kleisli needs Monad 17:49:33 I'm trying to figure out how to write a binary counter in Brainfuck with a non-wrapping implementation 17:49:36 you need Category as well, and some compatibility laws 17:50:07 (it throws an error if you decrement from zero or increment from 255) 17:50:31 TieSoul: well you should be able to do it with just 0,1 values :P 17:50:59 i think you want internal padding 17:51:33 0 bit0 1 bit1 1 bit2 ... bitn 0 17:51:49 it has a fixed length 17:51:54 ah. 17:52:11 i guess you can do without the padding then, in principle 17:52:27 probably may need a temporary cell somewhere, though 17:52:38 the thing is, I can't figure out how to check for 1s without decrementing from zero. 17:53:15 juse use a couple of temp cells 17:53:54 hrm 17:53:58 everything's better with temp cells 17:55:22 ...I don't get how temp cells would help 17:56:07 -!- oren has joined. 17:56:12 I like dempster-shafer theory 17:56:42 I want to convert a number under 32 to its binary representation. 17:56:51 use a lookup table 17:57:07 in brainfuck? 17:57:29 why not? 17:57:31 it's a code golf thing btw 17:57:45 ohhhh then don't use a lookup table 17:59:03 I want to use a binary counter 17:59:18 but I have trouble figuring out how to do that in a non-wrapping implementation 17:59:31 (checking for 1s without decrementing from 0) 18:00:39 check for zero, then decrement, then check for zero again? 18:01:06 hrm 18:01:33 I could... have a 0 cell before/after every 'binary cell' 18:01:39 and then increment to 2 if it's 0 18:01:44 decrement 18:01:45 check 18:02:14 yeah, you need a zero cell handy anytime you want to do an if instead of a while 18:02:22 yeah 18:04:05 wait lol 18:04:14 I think I got confused there 18:04:19 what I said doesn't make sense 18:04:34 it's an 'if-nonzero', not 'if-zero' 18:05:35 that doesn't make much difference except the order of blocks 18:05:44 true 18:06:12 of, if-zero is ] [ right? 18:06:19 -!- FreeFull has joined. 18:07:00 Koen: something like >(moving to zerocell) ] [ 18:08:12 sorry no [<]>[ ... ] 18:08:32 wait 18:08:39 I think 18:08:50 what about [-<]+ 18:08:58 that should be a binary counter? 18:09:05 (going left) 18:09:40 and then returning to the original cell... somehow 18:09:44 if you reset to the first cell before it 18:10:20 you need some postioning data in a parallel set of cells 18:10:28 wait wait 18:10:31 I think I've got it 18:10:39 -!- MDream has changed nick to MDude. 18:10:45 I have a group of 'filled' cells to the right 18:10:57 and a fixed-size binary counter to the left (5 bits) 18:11:11 so I could just do >>>>>>[<]> to return to the original cell 18:11:36 assuming there's a 0 cell between them 18:11:42 yeah 18:12:23 I mean >>>>>[<]> 18:14:06 -!- Frooxius has joined. 18:15:00 -!- Froox has joined. 18:18:23 -!- Frooxius has quit (Ping timeout: 246 seconds). 18:23:04 What if allocation and garbage collection were hardware features? 18:23:28 then that'd be some slow hardware 18:24:23 well 18:24:24 in particular, what if you had a separate, primitive core that did the gc continuously 18:24:28 my binary converter seems to work 18:24:51 -!- mitchs has quit (Quit: mitchs). 18:25:21 "seems" to? 18:25:42 did you test it on all 0-32 18:25:52 I'm testing 31 now 18:26:39 works 18:27:14 32 doesn't obviously 18:34:58 -!- oren has quit (Ping timeout: 272 seconds). 18:38:02 -!- FreeFull has quit (Ping timeout: 246 seconds). 18:39:27 `! befunge <@_.<0"hello" 18:39:46 Unsupported instruction '' (0xffffffff) (maybe not Befunge-93?) \ 0 18:40:24 `! funge98 <@_.<0"hello" 18:40:28 ​/hackenv/bin/!: 4: exec: ibin/funge98: not found 18:40:37 `! befunge98 <@_.<0"hello" 18:40:45 0 18:41:02 OKAY 18:45:48 helloerjan 18:46:21 bonsopia 18:53:16 -!- mitchs has joined. 18:56:44 -!- oren has joined. 19:04:45 -!- Lymia has quit (Ping timeout: 265 seconds). 19:08:12 -!- Lymia has joined. 19:20:42 -!- adu has joined. 19:20:42 -!- adu has quit (Client Quit). 19:21:07 -!- oren has quit (Ping timeout: 245 seconds). 19:21:19 -!- vanila has joined. 19:36:02 -!- mihow has quit (Quit: mihow). 19:48:47 -!- mihow has joined. 20:10:05 https://www.hackerrank.com/challenges/baconian-cipher 20:10:16 I just made a 209-character solution 20:10:29 I'm pretty proud of myself :P 20:10:36 -!- oren has joined. 20:10:45 especially since I've never seriously done anything in brainfuck before 20:12:13 I have tried to write programs that /write/ BF prgorams, but i have not tried to write bf prgrams. 20:12:50 https://www.hackerrank.com/challenges/baconian-cipher I just did this challenge 20:13:00 my solution is 209 characters 20:13:05 could probably shorten it a bit 20:13:46 Huh. If I'm reading that correctly, isn't that just 5-bit text encoding? 20:13:55 yeah it is 20:14:14 in what language?? 20:14:19 sort of BF 20:14:19 -!- mihow has quit (Quit: mihow). 20:14:21 that's what I needed the binary conversion for 20:14:27 wow 20:14:33 i couldnt write this in BF at all, let alone 200 chars 20:14:41 hackerrank's implementation has no wrapping 20:14:46 so that makes the challenge harder 20:14:52 I couldn't write jack squat in BF. 20:15:05 https://gist.githubusercontent.com/TieSoul/17f9670ed239ad94f2be/raw/1d3ea0c59b409b76a70f3ba8140f9e26619c0298/bacon.b 20:15:08 here's my solution 20:15:20 But I might have a stab at it in F# just for fun. Give me an excuse to try out fsharp-mode in emacs now that I've got the intellisense working. 20:15:45 I could probably do a Ruby/Python one liner 20:15:51 :P 20:15:59 you use an advanced editor, J_arcane. 20:16:28 I detect sarcasm ... ;) 20:16:33 I only have synatax highlighting 20:16:45 because I use mcedit 20:17:24 my score is... 95.84! 20:17:26 so emacs is very advanced compared to what i use, no saracsm 20:17:28 What I use really depends on the language. 20:17:28 that's almost a hundred! 20:17:41 * TieSoul looks at leaderboard 20:17:51 > people with scores of 98.46 20:17:53 :1:20: parse error on input ‘of’ 20:17:55 :( 20:18:14 though 20:18:17 I'm in 40th place! 20:18:19 yay 20:19:18 cool 20:29:18 -!- TieSoul has changed nick to TieSleep. 20:32:31 night 20:33:44 -!- CADD has joined. 20:38:38 a language in which it is impossible to write an interpreter for a language unless that language is TC 20:39:22 oren: that's impossible 20:39:31 orly? 20:39:55 actually... hmm, no, it's not *obviously* impossible. 20:40:03 if you maintain a source/input distinction 20:40:18 but I would be very surprised if you could do that 20:40:34 -!- oerjan has quit (Quit: ZZZZ). 20:42:40 -!- arjanb has joined. 20:43:03 wait. trivially, a restricted compiler for any language, which only accepts the source code of a BF interpreter 20:43:17 It depends on whether that is your only restriction. 20:43:29 If it is only impossible to write ONE interpreter for ONE language, that's easy :) 20:43:56 But a language which will accept ANY interpreter for ANY TC language, but will reject any other program is a halting problem solver. 20:45:29 Yep, you either managed to make it trivial and uninteresting *or* impossible. 20:45:32 it might be even worse than that actually. it basically has to tell whether the halting problem is unsolvable on the langugae defined by its input program. 20:46:43 wait. DOES the haltingproblem thing go both ways? 20:46:53 -!- Patashu has joined. 20:47:15 are there languages where the halting problem is unsolvable, but the language is not TC? 20:47:38 kind of 20:47:49 there are undecidable problems in context-free grammars 20:51:45 http://www.pentacom.jp/pentacom/bitfontmaker2/ 20:51:56 this site is awesome 21:07:07 Hm, I just use a generic bitmap editor 21:08:35 I was doeing it with mtpaint 21:08:54 but this thing is way easier if a little limited 21:09:41 Wee! I have my char lookup table now. 21:14:00 So i made an utterly insane font, which I posted a screenshot of earlier 21:14:51 The game one? 21:14:53 Or another one? 21:15:15 a new one: 21:15:30 oren: where's the screenshot? 21:15:42 http://snag.gy/GZVB3.jpg 21:15:47 heres a new screen 21:16:19 That's really hard to read 21:16:21 that looks strange 21:16:31 no, it's not very hard to read actually 21:16:31 Especially the t and h 21:16:38 it uses underdot instead of capitals 21:16:48 but the v looks ugly to me 21:16:49 Well, apart from t and h I guess it's fairly readable 21:17:07 k is also a bit weird 21:17:09 what bout the f 21:17:16 My brain really doesn't like the way "that" looks 21:17:25 oren: nice, thank you for sharing 21:18:07 the f isn't too bad for me from a readability perspective 21:19:20 I made this bitmap font a while ago: http://xen.firefly.nu/up/pixfont/index.html 21:19:31 oren: what does the "z" look like? "z" is ugly in many fonts but you don't find that out from screenshots like this 21:19:34 Though I didn't try it out properly until yesterday 21:20:06 hold on 21:20:40 `1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./~!@#$%^&*()_+QWERTYUIOP{}|ASDFGHJKL:"ZXCVBNM<>? 21:20:41 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: /hackenv/1234567890-=qwertyuiop[]\asdfghjkl;'zxcvbnm,./~!@#$%^&*()_+QWERTYUIOP{}|ASDFGHJKL:"ZXCVBNM<>?: No such file or directory 21:21:10 ...that's one way to do it 21:21:53 http://snag.gy/0dBxW.jpg 21:22:16 thanks 21:22:29 wow, that dollar sign is ugly 21:22:37 Nice ampersand 21:23:11 -!- mihow has joined. 21:24:54 -!- ais523 has joined. 21:24:54 here is the font file for pasting into the editor https://gist.github.com/orenwatson/55b014da50347d032b1f 21:25:12 hais! 21:26:24 Hmm, I should try to convert my bitmap font to a proper font file 21:26:48 once again the numbers are the way I write them... 21:26:49 -!- augur has quit (Ping timeout: 252 seconds). 21:27:16 well, except I usually put a dot in my zeros 21:29:23 firefly: thta font is nice and small 21:30:06 I like small fonts when I'm programming 21:31:03 I actually prefer larger fonts personally, but I wanted to make a small but legible bitmap font for platforms where screen space is more limited 21:31:14 oren: wait, I have an old crazy font I'd like to show to you 21:32:36 In particular, I like fonts that conserve vertical space 21:32:58 As for smallness, I have this thing I made a long time ago: http://xen.firefly.nu/up/pixel-font.png 21:33:11 Though it uses manual anti-aliasing so it kinda doesn't count 21:33:43 It's surprisingly legible for being 3x5px glyphs, to me anyway 21:34:02 that's pretty damn good 21:35:49 -!- hassa-aravit has joined. 21:37:20 The S looks pretty ugly, hmm 21:38:12 I've made a 3x5 (well, 4x6 cell) font too, for rfk86. 21:39:35 https://zem.fi/rfk86/ should render using it, if things work out right. 21:39:49 Fancy 21:42:27 I like the lowercase s/z trick it uses, which I think I adapted (or even just copied) from mooz's TI-86 befunge interpreter. 21:45:31 -!- idris-bot has quit (Quit: Terminated). 21:45:52 -!- Melvar has quit (Quit: rebooting). 21:47:39 -!- augur has joined. 21:48:46 Hmm, it shouldn't be too hard to tweak my JS thing to generate a BDF font file 21:50:11 -!- Melvar has joined. 21:51:48 -!- Lymia has quit (Ping timeout: 256 seconds). 21:54:13 oren: http://www.math.bme.hu/~ambrus/pu/stickfont-screenshot0.png 21:54:36 it's a 16x9 font because I originally used it for VGA console 21:54:49 -!- idris-bot has joined. 21:54:53 not for serious purposes though, it was always intended as a silly font 21:55:08 -!- ais523 has quit. 21:55:16 v. double-struck 21:55:23 -!- ais523 has joined. 21:55:35 Part 1: http://rextester.com/UUWO55700 21:56:18 I didn't draw more characters than what you can see there though 21:57:05 Nice 21:57:11 -!- AnotherTest has quit (Remote host closed the connection). 21:57:32 FireFly: that small font looks nice 21:57:48 though I'm not sure I like the "S" 21:58:05 it is a little too light isnt it? 21:58:08 nor the way the N and H look very similar 21:58:32 the "S" is too closed, that is, the top and bottom curve too much down 21:58:55 the N and H might be a bigger problem though 21:59:47 -!- callforjudgement has joined. 21:59:51 -!- ais523 has quit (Read error: Connection reset by peer). 22:00:05 -!- callforjudgement has changed nick to ais523. 22:01:25 b_jonas: the 3×5 one, or the bigger one? 22:01:35 FireFly: in the 3x5 one 22:01:51 By the way, I like the “Munka és béke” poem (displayed in that screenshot) partly because it has almost every letter, and has most letters in both the first four lines and the last four lines, which is quite remarkable for such a short poem. 22:01:59 -!- tromp_ has quit (Ping timeout: 244 seconds). 22:02:07 So it's not really a pangram, but close. 22:02:11 Useful for demonstrations like this. 22:02:57 Poems for demoing charsets reminds me of Iroha 22:03:16 FireFly: is that the Japanese one that helps demo kana? 22:03:21 Yup 22:03:22 yup 22:03:32 It uses every syllable exactly once 22:04:00 it now contains ones that don't exist in modern japanese like wi 22:04:21 (well, wi does occur in names, like arawi keiichi) 22:05:00 hmm, I wonder if using every syllable exactly once is possible in English 22:05:01 -!- Lymia has joined. 22:05:04 it seems like it might be 22:05:37 ais523: there are too many syllables so you'd need a longer text, which is hard without reusing “the” more than twice 22:06:05 yep, you'd have to avoid common words 22:06:14 but long English prose that avoids common words has been done before 22:06:14 Well, if you can write a book without using the letter 'e'... 22:06:21 FireFly: the great thing about that book 22:06:26 Is the translations 22:06:28 is that it's a translation of a French book that also doesn't use the letter 'e' 22:06:30 yep 22:06:39 sure 22:06:41 ('e' is the most common letter in French too, IIRC) 22:06:43 -!- FreeFull has joined. 22:06:50 http://snag.gy/tRIpP.jpg 22:06:56 that's what I usually say when that book is bought up--the translator's job is more impressive than originally writing it 22:07:04 my font works well at small sizes too 22:07:18 (not to say that authoring it isn't also impressive) 22:08:12 without 'e' in FRENCH?? very impressive, 22:08:47 The fun part of Munka és béke is that it has two variants. The other variant has an “ű” but doesn't have “ő” in exchange 22:08:58 no wait, that can't be true 22:09:07 there are two “ő” so one must remain 22:09:20 it doesn't have some other letter 22:09:29 wait let me check 22:11:01 I have written a quine in Haskell 22:11:33 hmm, maybe it has “ű” but doesn't lose anything in exchange? 22:11:45 but I seem to remember it wasn't more close to a pangram than this version 22:12:03 whatever, I'm too tired to figure it out now 22:12:17 maybe there are 3 versions? 22:12:29 Does not 'e' in French also mean doesn't have any 'e' with accent mark too, or not? 22:13:05 oren: could be, but I only know of two 22:16:18 Do you know of any Z-machine implementation that actually supports small-endian other than ZORKMID? 22:16:29 (ZORKMID does support big-endian too) 22:16:51 isn't it called "little-endian"? 22:17:54 I don't know, I called it "small-endian"; Infocom called them "byte-swapped" story files (and as far as I know, never created any such story files nor ever implemented an interpreter that would support them). 22:18:41 good night 22:19:41 -!- gamemanj has joined. 22:24:52 -!- augur has quit (Remote host closed the connection). 22:31:29 -!- aloril has quit (Remote host closed the connection). 22:32:22 -!- gamemanj has quit (Ping timeout: 246 seconds). 22:38:46 ais523: e is far more common in french than in english, i reckon 22:39:08 Koen_: does that include é and ê and è or not? 22:39:48 hum probably 22:40:10 not sure they make a relevant difference though 22:40:59 but that's also just based on my impressions as a native french speaker 22:41:04 -!- aloril has joined. 22:41:28 i think it's easier to write in alexandrines than without the letter e 22:41:46 -!- `^_^v has quit (Ping timeout: 244 seconds). 22:43:03 -!- gde33|2 has quit (Read error: Connection reset by peer). 22:45:11 -!- tromp has joined. 22:57:14 Hmm, I don't think it's possible to do an 8×5 monochrome '½' that doesn't look like crap... 22:57:38 the bar is too long imho 22:59:04 http://xen.firefly.nu/up/2015-02-27_235830.png here's my best attempt at ¼ ½ ¾ 22:59:26 #....#.. 22:59:26 #...#.## 22:59:26 #..#...# 22:59:26 ..#...#. 22:59:26 .#....## 22:59:28 ? 22:59:34 Oh hm 22:59:36 oh, that's better. 22:59:37 maybe. 22:59:55 Oh, I meant 8-high and 5-wide 23:00:00 oh, oops. 23:00:28 I'm going to try 23:01:42 "just tilt your head right" 23:02:07 M---- 23:02:07 are you designing a game boy? 23:02:08 M---- 23:02:10 M---- 23:02:11 M---- 23:02:13 ---MM 23:02:14 ----M 23:02:16 ---M- 23:02:17 ---MM 23:02:32 the trick's to leave out the slash 23:02:37 Clever 23:02:40 .##.. 23:02:40 ..#.. 23:02:40 ..#.. 23:02:40 ##### 23:02:40 .##.. 23:02:43 ...#. 23:02:45 ..#.. 23:02:48 .###. 23:02:50 ? 23:02:53 okay ais523 is cheating 23:03:04 I'm juts being creative 23:03:05 *just 23:03:15 here's my glyph: [0.5 just mashed into the available space] 23:03:24 *"0.5", that is. 23:03:33 X.... 23:03:34 X...X 23:03:34 X..X. 23:03:34 X.X.. 23:03:34 .X.XX 23:03:36 X...X 23:03:38 ...X. 23:03:41 ...XX 23:04:07 1/2 works, but the rest is hard :) 23:04:18 ais523's try was friendlier to proportionate fonts irc clients 23:04:35 Koen_: I use a proportional font in my client 23:04:35 I found the 2 to be hardest actually 23:04:57 actually, this reminds me of a table I saw on a proportional-font-using forum 23:05:07 that used ' and ` as spacers in order to make all the columns line up 23:05:08 The "leave something out" trick is a good one, it's the basis for the rfk86 s/z too. 23:05:11 despite the proportional font 23:05:31 fizzie: that reminds me of the trick I used when trying to fit the whole alphabet on a 7-segment display 23:05:34 for M and W 23:05:44 (M was the top segment, middle segment, and the two lower sides) 23:05:52 Koen_: the font? I had the TI-84 in mind at first, now I'm just adding some more glyphs because I was happy with how it turned out 23:06:26 cool 23:06:52 can we generate a new font 23:06:54 * Koen_ had a ti-84 but it was stolen during mardi gras in prepschool 23:07:01 I remember that Windows 3.1 shipped with a set of raster fonts of very small sizes 23:07:35 -!- Fleur has joined. 23:09:38 I had a script somewhere for IRCing with the rfk86 font, based on the 2x2 Unicode quarter-block things. 23:10:31 There's the full set of them, so 3 lines is enough for a font 6 pixels high. 23:11:01 FireFly: http://int-e.eu/~bf3/tmp/6x13frac.png .. the fixed font here also leaves out the / (or bar) 23:11:03 You can do better if you abuse the Braille Unicode block 23:11:15 I'm typing with a speech recognizer again 23:11:24 me too 23:11:25 FireFly: but of course those extra vertical pixels help a lot 23:11:26 That gives you 8×2 "pixels" per character 23:11:31 `relcome Fleur 23:11:41 ​Fleur: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: . (For the other kind of esoterica, try #esoteric on irc.dal.net.) 23:11:43 int-e: that link gives not found error for me 23:11:46 happy birthday 30 pussy Busy Busy fizzy 23:11:55 Elliot how did you get the backtick 23:11:59 thankye, hullo :3 23:12:05 nortti: right, forgot to press enter for the scp command. should be ok now. 23:12:06 Hey i have an idea lets make an esoteric font 23:12:32 I think they have improved the voice typing 23:12:41 * FireFly ponders whether to remove the fractional slash or keep his current glyphs 23:12:44 vanila: OK, what are you going to put on it, and is it METAFONT or PC 8x8 bitmap font or whatever? 23:12:49 Although this is far less hilarious than last time 23:12:52 I could do alternate characters 23:13:10 Fleur: came here from the wiki? 23:13:19 FireFly: I believe you'll find that it's 4x2 pixels 23:13:20 zzo38, I thought it could be generated randomly, by trying to find a set of images which look very different (by some metric) 23:13:21 Maybe this phone just has a better microphone 23:13:27 int-e: oh. yes, I meant that 23:13:38 -!- boily has joined. 23:14:07 elliott: Sort of - I've always loved browsing the wiki for pleasure, and then nortti told me there was an IRC channel so I thought I'd join 23:14:48 well, there are significantly fwer brainfuck derivatives here 23:14:57 also significantly fewer esolangs in general though really... 23:14:59 *fewer 23:15:05 Fleur, did you invent any esolangs or have some favorites 23:15:58 vanila: I don't really have any particular favourites, I just keep clicking the random page button until something catches my eye :P 23:16:25 But I have attempted in the past to create my own (but nothing has particularly taken off further than ideas in my mind) 23:16:53 cool :) 23:17:04 :3 23:19:45 Flellour! first time on the channel? 23:19:54 elliott: am I allowed to delete the pages of brainfuck derivatives I made or would that be vandalism? 23:20:15 Koen_: if they suck, I personally wouldn't mind 23:20:22 however, you don't have the permissions to delete pages 23:20:27 oh 23:20:34 never mind then 23:20:37 put {{delete}} on them, if there's been no significant activity from others on them 23:20:40 I'll delete them for yo 23:21:45 Koen_, how many are we talking 23:22:20 3 23:27:04 -!- Fleur has quit (Remote host closed the connection). 23:27:05 dont do it! 23:31:27 she left. we had a talkative newcomer... 23:36:39 -!- mihow has quit (Quit: mihow). 23:46:38 helloily