00:02:49 [wiki] [[Joke language list]] http://esolangs.org/w/index.php?diff=40166&oldid=39975 * 41.227.146.80 * (+15) /* General languages */ 00:03:08 :O 00:03:10 wiki! 00:57:15 -!- Sorella has quit (Quit: It is tiem!). 00:58:06 -!- conehead has quit (Quit: Computer has gone to sleep). 00:58:20 -!- Sorella has joined. 01:08:00 [wiki] [[Special:Log/newusers]] create * MikelIcely * New user account 01:08:26 by wikipedia's news, you'd think flying was dangerous or something 01:09:15 wait wtf 01:11:02 @tell fizzie i clearly remember visiting the newly editable wiki earlier tonight, but now the DNS has turned _back_ to the uneditable version. 01:11:03 Consider it noted. 01:17:59 Do you like the Imakuni?'s cards? 01:18:30 Do you know the proper IP address for the editable wiki? You could temporarily override it manually until it is fixed. 01:19:08 yes i found it from another (nvg) server 01:19:27 but i'm too lazy unless it's important 01:28:07 Some tournaments for various games have tie breakers; it is common. However, I prefer to defer any tie breakers until they are needed, allowing the tie to stand when possible. What is your opinion of this? (Clearly, it depends on the tournament format.) 01:29:37 yeah, soccer is like that, tie breaking is only used when there has to be a winner. 01:29:55 -!- TodPunk has quit (Read error: Connection reset by peer). 01:34:39 I know that in Rock-Paper-Scissors tournament, in case of a tie normally the game continues normally, but if it happens too often then the referee is required to interfere. 01:37:07 In Pokemon Card, there is a standard "sudden death" rule, however I do not like it and instead use the following rule: If the game ended with both players meeting win conditions just after one player attacked, before poison is checked, then the attacker loses; otherwise the tie stands. Standing ties are then deferred according to tournament conditions. 01:37:52 -!- aretecode has joined. 01:38:37 Arete Code 01:41:41 What is the rule in poker if you cannot divide the pot? 01:48:36 -!- shikhout has quit (Read error: Connection reset by peer). 01:49:47 I know that in Pandante (Texas Hold'em for Pandas), such a situation is impossible; the amount of the pot is always even and if there is a tie of more than two players, nobody gets paid anything. 01:57:24 -!- TodPunk has joined. 02:09:20 the massacre continues https://en.wikipedia.org/wiki/Wikipedia:Articles_for_deletion/FALSE 02:13:59 Is there a Pokemon Card manga where Professor Oak invents Pokemon Card? 02:46:26 -!- Sprocklem has joined. 02:47:41 -!- Sorella has quit (Quit: It is tiem!). 02:52:43 -!- drdanmaku has joined. 03:05:49 -!- mshock has joined. 03:30:58 -!- Sprocklem has quit (Quit: Holy crap! I'm on fire!). 03:32:22 -!- nooodl has quit (Ping timeout: 245 seconds). 03:41:44 What's the best way to convert .wmv to something playable on Macs easily? 03:41:58 I tried using VLC to convert to mp4, but the sound came out garbaled 03:43:52 If nothing else works, you can try to just record the output of Windows Media Player. 03:49:54 Sgeo: ffmpeg? 03:53:47 -!- oerjan has quit (Quit: Niteoid). 03:54:55 * Sgeo can try 03:55:00 -!- conehead has joined. 03:55:32 some horrid command line invocation but it'll work 03:56:12 Cygwin doesn't have it? 03:56:24 i thought you were on a mac 03:56:48 There are people who need to view this file who are on a mac 03:56:58 oh 03:57:11 Stupidly, I recorded it with GoToMeeting 03:57:11 well there are ffmpeg binaries for windows, on the site, you don't need cygwin, probably 03:57:41 * Sgeo downloads 03:57:57 when i transcoded things on windows i used winamp but that was years ago and also it's bloated as shit nowadays or wahtever. 03:59:57 I thought WinAmp was dead 04:00:36 "Despite AOL's announcement, the Winamp site was not shut down as planned, and on January 14, 2014, it was officially announced that Belgian online radio aggregator Radionomy had bought the Nullsoft brand, which includes Winamp and Shoutcast." 04:01:21 * Sgeo twitches at WinAmp's website 04:01:32 That laptop looks like it's off the screen in my browser 04:03:18 -!- conehead has quit (Quit: Computer has gone to sleep). 04:05:53 If I want to maintain the same bitrates, do I use ffprobe and look at the kb/s of each individual stream? 04:06:45 Oh I think -crf 0 04:11:08 Ok, that takes way too long 04:11:20 Do macs come with ffplay? 04:13:15 probably not 04:22:47 -!- mshock has quit (Ping timeout: 264 seconds). 04:46:18 erflistdate! 04:50:42 And... the file is too big to attach, ugh 05:42:18 -!- ^v has changed nick to ^8. 05:42:47 -!- nys has quit (Quit: quit). 05:49:53 -!- brrr has changed nick to BRRR. 05:50:30 -!- BRRR has changed nick to brrr. 05:54:03 @tell oerjan WELL THAT'S FUNNY I DON'T KNOW WHAT'S UP WITH THAT 05:54:03 Consider it noted. 06:01:11 @tell oerjan More seriously, perhaps your ISP has two (or more) name servers, only some of which had the old esolangs.org cached. 06:01:11 Consider it noted. 06:03:06 `olist 06:03:07 olist: shachaf oerjan Sgeo FireFly boily nortti 06:03:12 (959) 06:03:47 Also AIUI, a CRF of 0 would be an entirely lossless encoding, since it's going to translate to a -qp of 0. 06:05:05 Right, lossless but encoded from a video that was presumably lossily encoded in the first place 06:05:14 Maybe I don't understand video codecs. 06:23:19 -!- MindlessDrone has joined. 07:17:06 -!- edwardk_ has joined. 07:17:08 -!- edwardk has quit (Remote host closed the connection). 07:24:06 -!- shikhin has joined. 07:51:33 -!- Patashu has joined. 07:59:31 -!- brrr has quit (Quit: Cya!). 08:27:57 -!- edwardk_ has quit (Quit: Computer has gone to sleep.). 08:31:48 -!- edwardk has joined. 08:50:40 "Subject: CAN I DEPOSIT 20,000,000.00GBP INTO YOUR ACCOUNT" 08:50:47 A very excited piece of spam. 08:51:31 -!- drdanmaku has quit (Quit: Connection closed for inactivity). 08:57:47 [wiki] [[Language list]] M http://esolangs.org/w/index.php?diff=40167&oldid=40108 * TieSoul * (+13) Befunk added. 09:03:24 befunk looks awesome 09:04:15 wait, befunge is concurrent? 09:08:14 [wiki] [[Befunk]] M http://esolangs.org/w/index.php?diff=40168&oldid=40165 * TieSoul * (+205) Added external resources. 09:09:46 there's a concurrent version of Befunge-98 09:10:24 with an instruction 't' that adds another IP going in reversed direction of the IP that runs it. 09:10:37 awesome 09:10:49 with one shared stack or one stack per IP? 09:11:01 one stack per IP 09:11:08 no, one stack stack per IP 09:11:33 IPs do inherit stack stacks from their parent IPs 09:11:45 At least they should 09:11:55 some implementations don't do that 09:12:18 oh damn 09:12:38 the descriptions for 400, 401 and 402 are cut off D: 09:13:08 i need a befunge to befunk converter 09:15:52 A perfect one cannot be made 09:16:18 because of instructions that are executed both in and not in stringmode 09:16:23 so strings will get messed up 09:17:23 [wiki] [[Befunk]] M http://esolangs.org/w/index.php?diff=40169&oldid=40168 * TieSoul * (+68) Fuxed the descriptions for instructions 400 through 402. 09:19:20 no I didn't fux it 09:19:25 fixed* 09:24:14 There's also vague plans for an asynchronous concurrency fingerprint for Funge-98. 09:24:19 ATHR or something like that. 09:25:07 Since the "native" concurrency (via 't') mandates that each IP executes a single tick in alternating order. 09:25:58 There are also rumours that one of the less-known intermediate versions (Befunge-96 or Befunge-97, I forget which) did shared-stack concurrency. 09:26:43 http://frox25.no-ip.org/~mtve/tmp/bef_maillist_0_520.txt seems to suggest that it was -96. 09:26:52 Hello 09:26:54 I really need to get a desk 09:27:52 Perhaps you could 3d-print one. 09:27:55 It would be very 2014. 09:28:27 Which would be great if I had access to a 3D printer, and my landlady hasn't said that she'll buy me one if I find one 09:28:45 That is, she'll buy me a desk 09:28:48 Not a 3D printer 09:29:13 You could try explaining that a 3D printer equals an unlimited amount of desks. 09:29:28 As long as they fit in a, say, 16x16x16 cm cube, and don't have to be very strong. 09:30:15 I think IKEA may be a better short-term solution 09:34:55 Our desks are of the GALANT series. 09:35:04 Or is it a "system"? 09:35:08 Anyway, they're not bad. 09:40:36 I bought our desks from here http://www.theofficesuppliessupermarket.com 09:41:10 They're nothing exciting to look at, but pretty solid. 09:44:25 * impomatic_ is writing a program to play Neutron http://www.gamerz.net/pbmserv/neutron.html 10:05:04 How do I use newlines in code blocks properly on the wiki? 10:07:32 okay figured it out. 10:07:58 [wiki] [[Replacefuck]] N http://esolangs.org/w/index.php?oldid=40170 * TieSoul * (+1464) Created page. 10:09:13 [wiki] [[Language list]] M http://esolangs.org/w/index.php?diff=40171&oldid=40167 * TieSoul * (+18) Added replacefuck. 10:10:44 I thought up and implemented replacefuck in like 15 minutes :P 10:11:57 15 minutes is a long time in the life of a brainfuck derivative 10:12:47 yeah 10:12:54 `? brick 10:12:55 Brick goes in brain. The statutory punishment for perpetrators of brainfuck derivatives. 10:14:27 what? 10:14:28 :P 10:15:16 -!- boily has joined. 10:16:01 hey boily 10:16:47 "Please wait while boily is fully booted..." 10:17:08 (just got out of bed. not entirely coherent yet. my toasts need nutella.) 10:19:26 [wiki] [[Befunk]] M http://esolangs.org/w/index.php?diff=40172&oldid=40169 * TieSoul * (+0) 10:19:32 http://www.dailytelegraph.com.au/news/nsw/deadpool-arrested-on-sydney-train-police-alerted-to-superhero-armed-with-guns-grenades-and-ninja-swords/story-fni0cx12-1227001404525?nk=11bebdd40bbec2cef7639e9952ed7285 10:22:01 [wiki] [[Befunk]] M http://esolangs.org/w/index.php?diff=40173&oldid=40172 * TieSoul * (+5) Fixed '|' not displaying in the instruction table. 10:22:54 TieSoul: good morning! 10:23:01 Taneb: Tanelle! 10:23:27 `? test 10:23:27 test? ¯\(°​_o)/¯ 10:23:34 oh sweeeet :D 10:27:49 Hi boily 10:28:45 it feels good to be able to update the PDF again ^^ 10:34:58 [wiki] [[Topsy turvy]] N http://esolangs.org/w/index.php?oldid=40174 * 91.125.156.167 * (+1149) Created page with "==Language definition== '''Topsy Turvy''' operates on an array of cells, each initially set to an undefined value. A data pointer initially points to the cell in the centre of..." 10:37:36 It also inverts all stat changes on the foe :P 10:37:52 That's a pokemon reference 10:43:15 -!- nooodl has joined. 10:53:24 -!- TieSoul has quit (Ping timeout: 255 seconds). 11:01:13 -!- TieSoul has joined. 11:02:59 Huh. LaTeX/BibTeX is putting the locatio and the year of a random conference at the top of the bibliography for no discernible reason. 11:04:12 In the source .bib file, there's a @proceedings entry, and two (cited) @inproceedings entries referring to it with a crossref field. 11:05:51 -!- erdic has quit (Ping timeout: 256 seconds). 11:06:25 IDGI. 11:07:48 -!- erdic has joined. 11:07:56 maybe a stray space somewhere is wrecking the numerical/alphabetical/asciibetical order? 11:10:12 But, I mean, it's not a complete entry or anything. 11:10:44 It just says "Chiba, Japan, Sept. 2010" on the top of the bibliography. 11:13:21 weird. 11:13:31 -!- boily has quit (Quit: POSET CHICKEN). 11:13:48 And, uh... in the two entries where it *should* say that, it just says a nonsensical "con (2010)". 11:15:21 Impossible to diagnose, there are too many variables, starting from the bibstyle, which may just be buggy 11:15:35 As in: [...]. In /Proceedings of the 11th Annual Conference of the International Speech Communication Association (Interspeech 2010)/ con (2010), pages [...] 11:15:50 With // denoting italics. 11:17:02 All the other similar stuff works fine. 11:20:12 It vaguely seems to happen if there is more than one entry pointing (with crossref) at the same conference. 11:20:25 But that's just silly, since the whole point was to share those. 11:23:36 For the record, the style is natbib's "abbrvnat". 11:26:54 If I make a second conference with >1 crossref to it, it puts the address and year of that also on top of the list, and then writes "con (1984)" in the entries. 11:27:15 Which makes it sound like it's something intentional. 11:27:23 Maybe I need to look at the natbib documentation. 11:34:04 Welp, I can't seem to find anything about automagically doing something like that. 11:35:49 Doesn't happen if I don't use the crossref, but that's silly. 11:36:50 Oh, it's apparently a bibtex feature. 11:38:23 "bibtex -min-crossrefs=100" made it stop; apparently it will then only make some sort of automagical separate "crossref" entries if there are at least 100 references to the same thing. 11:38:50 I don't have any idea why it decided to "abstract out" only the address and year, and not e.g. the booktitle. 11:59:24 -!- shikhout has joined. 11:59:56 -!- shikhout has changed nick to Guest6283. 12:02:59 -!- shikhin has quit (Ping timeout: 264 seconds). 12:08:20 I wonder why NIPS papers' "official" BibTeX files use @incollection instead of @inproceedings. I mean, it is a conference. 12:09:32 -!- yorick has joined. 12:17:30 -!- Sgeo has quit (Read error: Connection reset by peer). 12:22:23 -!- oerjan has joined. 12:23:14 someone add the two languages used in this year's icfp to the wiki 12:23:20 if you figure out how they work 12:23:27 or maybe 12:23:30 do that only after the contest 12:31:44 @messages-bold 12:31:44 fizzie said 6h 37m 40s ago: WELL THAT'S FUNNY I DON'T KNOW WHAT'S UP WITH THAT 12:31:44 fizzie said 6h 30m 32s ago: More seriously, perhaps your ISP has two (or more) name servers, only some of which had the old esolangs.org cached. 12:33:09 -!- Patashu has quit (Quit: Soundcloud (Famitracker Chiptunes): http://www.soundcloud.com/patashu MSN: Patashu@hotmail.com , AIM: Patashu0 , YIM: patashu2 , Skype: patashu0 .). 12:39:10 "Page(s): I" I certainly doubt that. 12:39:32 Especially since the paper is 4 pages. 12:39:59 (Apparently the "correct" answer is it's pages from "I - 289" to "I - 292".) 12:40:45 oerjan: How about NOW? 12:42:12 this looks decisively un-editable. 12:43:44 I don't know why that should be. 12:44:02 The TTL time should be 86400 seconds, also. 12:44:12 ic 12:44:17 -!- axtens has joined. 12:44:23 Time-to-live time. 12:44:29 PIN numbers and all that. 12:44:54 maybe i should try restarting the router. 12:46:47 how long ago was the DNS changed? my dig shows a TTL of 10000 remaining (for esolangs.org) 12:47:56 nope, nothing changed 12:49:00 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 12:49:18 -!- nys has joined. 13:05:33 -!- Tritonio has joined. 13:08:23 olsner: And what address? 13:08:40 fizzie: 162.248.166.242 13:08:51 Well, that's the new one. 13:08:58 Well, the old one. 13:09:01 I mean, the right one. 13:09:08 It's a matter of definitions, of course. 13:09:35 In any case, I think I changed it around 9AM (EEST) yesterday, which should have been more than a day ago. 13:13:05 -!- Sorella has joined. 13:15:42 -!- copumpkin has joined. 13:24:59 -!- impomatic_ has left. 13:43:03 -!- impomatic_ has joined. 13:44:03 -!- impomatic_ has quit (Client Quit). 13:58:47 b_jonas: they don't seem particularly hard to figure out, fwiw, they're almost fully documented by the icfp description 13:59:23 -!- axtens has quit (Remote host closed the connection). 14:10:13 -!- mhi^ has joined. 14:14:41 -!- myndzi has quit (Quit: .). 14:17:10 -!- conehead has joined. 14:19:33 -!- myndzi has joined. 14:31:09 olsner: yeah, but they're sort of unrealistic, as in, they don't really look like something you'd have in a 1980s microcontroller, and especially the way the interrupts are designed seems to want to deliberately limit the ghost's power 14:31:23 io and computation power 14:45:57 but yeah, certainly not as esoteric as Endo's DNS 14:46:40 that reminds me, Endo's DNS certainly needs a mention on the esowiki 14:47:03 because that's a crazy pattern matcher language 14:47:09 string pattern replacer 14:48:07 endo's dns? 14:52:38 olsner: from a previous ICFP contest 14:52:48 ah 14:53:28 it's a self-modifying string pattern matching language with a much more powerful matcher than just fixed strings 14:54:16 it can copy long strings in quasi-constant time so you need some kind of balanced tree representation to implement it properly (this is basically mentioned in the task spec) 14:54:25 copy and concatenate and slice 15:08:22 this was the year everyone was discussing ropes, right 15:11:45 I wonder if modifying my c++ template lisp compiler is a reasonable way to attack this problem 15:13:07 a what compiler? 15:16:22 -!- hektor has joined. 15:16:56 `quote ghost 15:16:57 417) monqy: last night in my dreams I saw a false photo album of my childhood... looking ghostly \ 461) I MIGHT BECOME GHOST 15:17:10 hmm, wrong ghost 15:20:33 `quote spirit 15:20:34 809) 88) (still, whatever possessed anyone to invent the N-Gage?) [...] Is there supposed to be a joke in 88? Unless "N-Gage" is some pseudoscientific spiritual mumbo-jumbo, I don't get it. Oh, it's a cell phone gaming thing apparently \ 1084) btw, ^v, what are your approximate geographic coördi 15:21:43 b_jonas: anyway, it takes s-expressions coded as c++ types and interprets them to types or compiles them to functions 15:21:44 `` quote spirit | tail -n +2 15:21:45 1084) btw, ^v, what are your approximate geographic coördinates and body weigh? <^v> 300 and USA nice to see that ^v is keeping with the spirit of the channel by providing completely useless answers to the question. 15:26:56 -!- ^8 has changed nick to ^v. 15:27:27 -!- edwardk has quit (Quit: Computer has gone to sleep.). 15:31:37 i think i've solved infinite dimensional 3x3x3x... tic-tac-toe! 15:32:13 solved? 15:33:06 found a strategy to always win as X 15:33:37 -!- Tritonio has quit (Ping timeout: 245 seconds). 15:33:50 logically, the first player is always able not to lose 15:34:14 wanna play a game? moves are infinite sequences of {-1,0,1} 15:34:27 (i feel like testing my strategy) 15:34:55 moves must be computable sequences? 15:35:16 i don't think that matters 15:35:21 nah 15:35:25 at least if it's a finite game 15:35:39 (in steps) 15:37:09 wait... _infinite_ sequences? 15:37:30 yeah. cause the grid is infinite-dimensional 15:37:33 can't you just win in the first 3 dimensions? 15:37:33 he _did_ say infinite dimensional, b_jonas 15:37:39 yeah 15:37:50 -!- edwardk has joined. 15:38:26 but then it's easy, for the first three moves you just make three generic moves (that is, they're linear independent with all previous moves including yours and the opponent), 15:38:35 then you have to open positions to finish 15:38:36 um 15:38:37 ok, not quite 15:38:44 it's a bit more complicated 15:39:08 but basically something like that works 15:39:14 your first move is all zeros, 15:39:28 no 15:39:35 first move is all -1 I mean 15:39:41 i have a hunch that there is some finite dimension which suffices to show the strategy 15:39:52 actually that's obvious if the game is bounded 15:39:55 next move is random sequences of all -1 and 0 15:40:00 oerjan: indeed; it's 3 15:40:14 third move is random sequence of all -1 and 0 but such that where you had 0 in second move you have 0 here too 15:40:20 then fourth move you win 15:41:42 well you need to ensure the opponent didn't win first 15:42:12 https://dl.dropboxusercontent.com/u/15495351/inftic.pdf 15:44:25 `pastaquote 15:44:26 967) I think pastaquote should just quote me 15:44:35 -!- mhi^ has quit (Quit: Lost terminal). 15:44:55 `quote pasta 15:44:55 (does it always produce that quote, or was I incredibly lucky?) 15:44:55 967) I think pastaquote should just quote me 15:45:10 `cat bin/pastaquote 15:45:11 ​#!/bin/sh \ exec quote "pasta|spaghetti|macaroni|maccheroni|ravioli|fusilli|tortellini|noodle|tagliatelle" 15:45:31 `pastaquote 15:45:32 967) I think pastaquote should just quote me 15:45:37 `quote noodle 15:45:38 No output. 15:45:51 `quote steak 15:45:52 No output. 15:45:55 `quote ravioli 15:45:56 No output. 15:45:57 `quote food 15:45:58 52) actually just ate some of the dog food because i didn't have any human food... after a while they start tasting like porridge \ 112) ais523: elf corpses are not considered expensive health food. but the most expensive. \ 350) * perlmonkey is pursuing the line of reasoning that eating raw foods can improve cognitive function 15:45:59 `quote soup 15:46:00 86) if you claim that the universe is more than 3D the burden of proof is on you to produce a klien bottle that doesn't self intersect ^ I learned that trick from atheists \ 305) my most fresh dream is one where I'm at a soup contest and a chicken really wants to participate but he's disqualified so he becomes th 15:46:26 `` echo q* 15:46:27 quines quotes 15:46:37 `` grep 'pasta|spaghetti|macaroni|maccheroni|ravioli|fusilli|tortellini|noodle|tagliatelle' quotes | wc 15:46:37 ​ 0 0 0 15:46:48 `` egrep 'pasta|spaghetti|macaroni|maccheroni|ravioli|fusilli|tortellini|noodle|tagliatelle' quotes | wc 15:46:49 ​ 1 8 47 15:46:53 -!- edwardk has quit (Quit: Computer has gone to sleep.). 15:47:00 no luck involved 15:51:42 -!- edwardk has joined. 15:58:31 -!- Guest6283 has changed nick to shikhin. 15:58:38 -!- shikhin has quit (Changing host). 15:58:38 -!- shikhin has joined. 15:59:17 -!- oerjan has quit (Quit: leaving). 16:11:16 -!- edwardk has quit (Quit: Computer has gone to sleep.). 16:21:38 -!- mshock has joined. 16:25:09 -!- mhi^ has joined. 16:31:25 I wonder if it's possible to program the GCC (ICFP esolang) in a procedural way such that you don't use the call stack except at startup to set up a large enough environment frame for all the registers you need 16:31:49 then you just jump around the code with TSEL and use the environment as registers and work as if it was a register machine 16:32:12 with the ST and LD instructions 16:32:38 I think it is, which proves this is a multi-paradigm esolang 16:41:26 -!- tromp_ has joined. 16:44:03 -!- tromp___ has joined. 16:44:47 -!- tromp has quit (Ping timeout: 245 seconds). 16:45:58 -!- tromp_ has quit (Ping timeout: 250 seconds). 16:49:43 [wiki] [[Special:Log/newusers]] create * DocHerring * New user account 16:52:32 Are you taking a video? http://youtu.be/1ACpoOkNEcQ 16:59:57 -!- nisstyre has quit (Quit: WeeChat 0.4.3). 17:00:20 -!- nisstyre has joined. 17:04:48 -!- vifino has joined. 17:09:08 -!- mshock_ has joined. 17:11:50 -!- mshock has quit (Ping timeout: 260 seconds). 17:21:55 -!- hektor has quit (Quit: Page closed). 17:30:42 -!- mshock_ has quit (Ping timeout: 250 seconds). 17:32:42 -!- mshock has joined. 17:36:36 `? oerjan 17:36:37 Your evil overlord oerjan is a lazy expert in future computation. Also an antediluvian Norwegian who hates Roald Dahl. 17:44:17 -!- edwardk has joined. 17:47:53 -!- vifino has quit (Quit: Ze Cat now leaves...). 17:48:07 -!- aretecode has quit (Remote host closed the connection). 17:51:00 -!- aretecode has joined. 17:57:07 -!- edwardk has quit (Quit: Computer has gone to sleep.). 18:00:00 -!- shikhout has joined. 18:03:16 -!- shikhin has quit (Ping timeout: 255 seconds). 18:12:44 somebody knows a bit about g8 and sbt and wants to tell me what i'm doing wrong on following a readme? 18:14:47 basically, i want to use https://github.com/ajhager/libgdx-sbt-project.g8 and get a bunch of errors on desktop/run 18:25:53 [wiki] [[Special:Log/newusers]] create * ChelseaEthridge * New user account 18:31:14 -!- TieSoul_ has joined. 18:32:51 -!- TieSoul has quit (Ping timeout: 255 seconds). 18:35:26 -!- TieSoul has joined. 18:37:00 -!- mshock has quit (Ping timeout: 260 seconds). 18:37:48 -!- TieSoul_ has quit (Ping timeout: 255 seconds). 18:45:27 -!- hektor has joined. 19:09:47 -!- mshock has joined. 19:14:16 -!- edwardk has joined. 19:15:11 -!- mshock has quit (Read error: No route to host). 19:18:18 -!- TieSoul has quit (Ping timeout: 255 seconds). 19:23:44 TOGA computer looks to be a really simple kind of computer, probably can be done with only a few 74xx series. How easily do you think a similar thing could be put into a Famicom cartridge? 19:25:59 Are there designations for how powerful a particular model of a finite state machine is? Such as how many steps need to be inserted when converting from an arbitrary finite state machine, and how many steps are inserted when converting into an arbitrary finite state machine. 19:27:22 -!- impomatic_ has joined. 19:29:31 * impomatic_ is looking for a quote about paper, scissors, stone (preferable by John von Neumann) 19:32:42 I don't know of any such 19:34:43 -!- Koen_ has joined. 19:43:29 There is no depmod on openwrt. What a pain 19:43:57 So it doesn't realise that to load sd_mod it need to load scsi_mod 19:44:45 Googling hasn't helped so far 20:01:02 -!- mhi^ has quit (Ping timeout: 245 seconds). 20:04:44 -!- ^v has quit (Ping timeout: 240 seconds). 20:10:22 -!- brrr has joined. 20:11:01 -!- ^v has joined. 20:11:41 I have a non-esoteric question. Can you recommend me a good textbook on LR-variant parsers for context-free languages? 20:12:44 I've borrowed the book (John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman, "Introduction to Automata Theory, Languages, and Computation", 2nd ed, Addison-Wesley) 20:12:53 hoping that it would be like that, but no 20:13:13 it turns out that's an introductory textbook to formal languages, and says very little about LR parsing 20:13:30 so please recommend me a good book 20:13:42 I wonder where else to ask, hmm... 20:13:45 maybe in #haskell ? 20:14:05 there's a room called ##parsers as a matter of fact 20:14:56 nys: isn't that for existing parser software? I'm more interested in theory 20:15:03 I think I'll try #haskell or maybe #haskell-blah 20:15:15 oh, and 20:15:31 #algorithms 20:15:54 but I'd prefer if you just gave a recommendation here 20:16:07 b_jonas, as far as i can tell it's filled with people that are interested in parsers and parsing 20:17:03 The Dragon Book has a chapter, I think. 20:17:29 It's a bit more generic-audience book than just parsers, of course. 20:18:31 and I guess I'll ask ais specifically 20:18:40 fizzie: let me look at that 20:19:00 fizzie: which Dragon Book? 20:19:16 -!- Koen_ has left. 20:19:56 b_jonas: "Compilers: Principles, Techniques, and Tools". 20:20:08 ok 20:20:59 is there a detailed TOC of that available somewhere? 20:21:30 http://www.pearson.ch/1471/9780321491695/Compilers_Principles_Techniques_and.aspx has one. 20:21:39 thanks 20:22:30 "4.7 More Powerful LR Parsers" sounds great, thanks! 20:23:12 let me check the library catalogs then 20:24:16 fizzie: what would "OHHEA, OHHEA !!!!" mean? 20:24:23 is it trying to be "onnea"? 20:24:26 I think so. 20:24:51 Perhaps referring to the Cyrillic н? 20:25:17 whoa, i thought that was an H but it wasn't 20:25:42 it's actually "ОННЕА, ОННЕА !!!!" 20:26:12 shachaf: I was just about to say that perhaps it was ОННЕА. 20:26:21 now i'm confused 20:26:27 what does ОННЕА mean 20:26:51 https://translate.google.com/?source=osdd#auto/en/%D0%9E%D0%9D%D0%9D%D0%95%D0%90 20:27:26 i'm not sure that quite answers the question 20:27:34 :( 20:27:40 you’re Not, sure 20:28:19 I’mn’t`ap`tail 20:29:03 My Russian dictionary doesn't know anything about "ОННЕА". 20:29:05 found only one copy of the 2nd edition of "Compilers, principles, techniques and tools", and that one might not be possible to get 20:29:42 fizzie: maybe it's not the dictionary form? 20:29:50 as in, it's a declension 20:30:05 That's very possible; I only did one year of Russian, and forgot all about it. (Still, I would've expected to see at least something similar.) 20:30:06 sour grapes 20:30:13 Sometimes people do write Finnish transliterated to the Cyrillic alphabet "for the lulz". 20:30:23 In which case it would be "onnea", again. 20:30:31 I might try to phone them in any case 20:31:07 the person who wrote this message is a finnish speaker who has learned russian within the past few years 20:31:51 the subject of the email was "HAPPY BIRTHDAY!!!!!" 20:31:51 Do they also have a reason to congratulate you? 20:31:54 Oh. 20:32:01 so it sounds like maybe "onnea" is appropriate 20:32:05 Well, in that case I'd go with my hypothesis. 20:33:37 * impomatic_ goes to check his compiler books 20:33:43 thanks 20:35:19 wot? no phone number? 20:37:45 anyway, I'll ask for this but it might be unborrowable 20:39:30 My compiler textbook is Appel's "Modern compiler implementation in Java", but that's not my fault. 20:39:41 It's what our compilers course used. 20:40:05 There's a total of 13 pages about LR parsers. 20:40:34 It does explain the concepts, anyhow. 20:41:28 btw do you have any tips on writing parser generators? 20:41:47 I have a book "Crafting A Compiler" which describes LR parsers. 20:41:49 With the (I think usual) progression of LR(0) -> SLR -> LR(1) -> LALR(1). 20:41:53 I actually want to parse a language that's not even LR, so I'd prefer variants that aren't strictly less powerful than LR(n) 20:42:08 zzo38: let me check that 20:42:14 Nothing really on my bookshelf. Several books just have a token 20-30 page section on LR parsers. The Red Dragon book has 32 pages. 20:42:17 Lemon is a LALR(1) parser generator. 20:42:34 zzo38: are you sure? I had the impression that Lemon is an LL parser generator 20:42:58 I have used it, as well as made some modifications to it, so now it can also be used to parse some LR(1) grammars that aren't LALR(1) too, if you give it the commands to do so. 20:43:07 b_jonas: Yes, it is LALR(1). 20:43:18 oh, ok 20:46:10 zzo38: Fisher, Charles N, "Crafting a compiler with C", Benjamin/Cummings, copyright 1991. is this it? and is it the latest edition? 20:46:25 No, that isn't it. 20:46:39 Although it is Benjamin/Cummings. 20:46:47 ah wait, here's another one 20:46:54 from the same author 20:46:56 -!- Frooxius has quit (Quit: *bubbles away*). 20:47:12 And it is written by Charles Fisher as well. 20:47:15 Fisher, Charles N, "Crafting a Compiler", Benjamin/Cummings, cop. 1988 20:47:20 hmm 20:47:29 Yes, I think it is that one. 20:47:30 maybe the title changed in the newer edition then? 20:47:48 It doesn't mention C much; most of the code in the book uses Ada. 20:47:55 that older one isn't available 20:47:55 -!- J_Arcane has joined. 20:48:03 zzo38: oh, maybe it's rewritten or something 20:48:09 let me try to search the net for info about this 20:48:48 hmm no 20:49:09 dunno 20:49:11 confusing 20:49:53 -!- Frooxius has joined. 20:50:59 -!- aretecode has quit (Ping timeout: 264 seconds). 20:54:00 -!- aretecode has joined. 20:55:15 http://pages.cs.wisc.edu/~fischer/ says there's a revision of Crafting a Compiler 20:55:19 in 2010 20:56:15 why are all these books about compilers? I just want to parse language, I don't want to write a compiler 20:56:31 The book mentions parsing too, not only compiler 20:56:54 sure 20:58:47 most compiler books spend like half their time on parsing 20:58:50 it's quite mysterious to me. 20:58:54 [wiki] [[Special:Log/newusers]] create * JArcane * New user account 21:00:26 Hey, that's me! 21:00:52 it is 21:00:55 what? isn't the wiki still read-only? 21:01:04 No. 21:01:10 I have no idea, I haven't submitted a page yet. 21:01:10 It's been back for almost two days already. 21:01:16 I see 21:01:26 b_jonas: If you want a real classic, there's always http://www.amazon.com/Theory-Parsing-Translation-Compiling-Volume/dp/0139145567/ 21:01:39 fizzie: thanks, let me check that 21:02:15 It's also a compiler book, but it's a multi-volume set and the first volume at least claims (based on the name) to be about parsing only. 21:03:20 ok, wait, what were the languages I wanted to mention on the wiki? Endo's DNA from a previous ICFP contest, and what was the other one? 21:03:44 Oh, OpenTTD of course 21:03:52 and maybe a stub for this year's ICFPc 21:03:55 two 21:04:06 (It's by some of the same people as the Dragon Books, so maybe it's redundant, who knows.) 21:04:17 fizzie: sure, those people have lots of books 21:04:29 the book I mentioned first are by them too, isn't it? 21:05:17 I guess there's some overlap there too, yes. 21:05:37 wasn't there one more thing I wanted to add? 21:05:38 hmm 21:07:17 HDNA should be on the wiki 21:10:33 what's the best name for that language? "Fuun DNA"? Fuun is the species apparently 21:10:55 should I split it to two pages, "Fuun DNA" and "Fuun RNA"? 21:11:08 https://www.youtube.com/watch?v=QNsToEecC_M 21:11:46 @tell oerjan I don't know why, but it seems that sometimes the actual address record can have a TTL of three (3) days. 21:11:46 Consider it noted. 21:12:51 @tell oerjan ...now I'm not saying I'm certain, but this "$TTL 3D" line might have something to do with it... 21:12:52 Consider it noted. 21:13:34 @tell oerjan Long story short, the DNS propagation can take up to three days in the worst case. BAD LUCK. 21:13:34 Consider it noted. 21:14:05 I think perhaps I should drop that down to a more reasonable one day. 21:14:33 Or perhaps even 12 hours or something. 21:17:31 -!- ^v has changed nick to Shibe42. 21:17:41 -!- Shibe42 has changed nick to ^v. 21:21:45 [wiki] [[User:B jonas]] http://esolangs.org/w/index.php?diff=40175&oldid=39207 * B jonas * (+208) add more todo 21:24:49 great, 21:25:32 fizzie: Alfred V. Aho, Jeffrey D. Ullman, The theory of parsing, translation, and compiling, 1972. this is actually available 21:25:40 if it's a classic, this might be what I should look at 21:26:35 so first volume of that? ok 21:29:42 [wiki] [[VIOLET]] N http://esolangs.org/w/index.php?oldid=40176 * JArcane * (+2936) Created page with " ''VIOLET'' (Verbose Interactive Operating Language for Educational Terminals) is an interpreted programming language alleged to have been the custom onboard language develope..." 21:30:21 [wiki] [[Language list]] http://esolangs.org/w/index.php?diff=40177&oldid=40171 * JArcane * (+13) /* V */ 21:32:48 -!- oerjan has joined. 21:34:23 -!- doesthiswork has joined. 21:36:09 [wiki] [[VIOLET]] http://esolangs.org/w/index.php?diff=40178&oldid=40176 * JArcane * (+2) 21:36:27 b_jonas: It's not so much a classic that I'd have read it. From the looks of it, it's quite a theory-oriented approach. 21:37:15 great 21:39:19 @messages-foul 21:39:19 fizzie said 27m 32s ago: I don't know why, but it seems that sometimes the actual address record can have a TTL of three (3) days. 21:39:19 fizzie said 26m 27s ago: ...now I'm not saying I'm certain, but this "$TTL 3D" line might have something to do with it... 21:39:19 fizzie said 25m 44s ago: Long story short, the DNS propagation can take up to three days in the worst case. BAD LUCK. 21:39:30 I KNEW IT, IT WAS ALL YOUR FAULT 21:43:35 It wioll haven be three days real soon now! 21:46:56 :-) 21:47:21 (Verb tense co-opted from http://sprunge.us/KOdb) 21:48:40 -!- Patashu has joined. 21:54:00 -!- nooodl_ has joined. 21:57:04 -!- nooodl has quit (Ping timeout: 240 seconds). 21:58:46 @quote ap.tail 21:58:46 quicksilver says: zip`ap`tail - the Aztec god of consecutive numbers 21:59:59 thanks everyone for the book recommendations 22:04:52 * oerjan points out http://onnea.ru/ 22:05:01 i.e. it may be a company name. 22:08:13 -!- idris-bot has joined. 22:12:20 -!- doesthiswork has quit (Quit: Leaving.). 22:12:27 ( let x = Just 1 in do [1,2,3] !! !x 22:12:27 Just 2 : Maybe Integer 22:14:05 -!- Koen_ has joined. 22:14:43 -!- Patashu has quit (Remote host closed the connection). 22:15:00 -!- Patashu has joined. 22:15:01 -!- Sgeo has joined. 22:28:07 I wanted to get an early night but I can't sleep 22:29:53 Taneb: work on the icfp contest task then 22:32:43 fNah 22:40:52 ( let x = Just 1; y = Just 2 in do !x + !y + 3 22:40:53 Can't resolve type class Num (Maybe b) 22:40:59 bah 22:41:31 ( let x = Just 1; y = Just 2 in do 3 + !x 22:41:31 Can't resolve type class Num (Maybe b) 22:42:01 ( :t (!) 22:42:01 No such variable ! 22:42:06 ( :t (!!) 22:42:07 BotPrelude.(!!) : List a -> Nat -> Maybe a 22:42:32 ( let x = Just 1 in !x 22:42:33 Can't resolve type class Num (Maybe b) 22:43:19 ( let x = Just () in !x 22:43:20 (input):1:22:When elaborating an application of function Prelude.Monad.>>=: 22:43:20 Can't unify 22:43:20 () 22:43:20 with 22:43:20 Maybe b↵… 22:43:49 ( :t \ x => !x 22:43:50 When elaborating an application of constructor __infer: 22:43:50 Can't disambiguate name: Effects.>>=, BotPrelude.LiftEq.>>=, Prelude.Monad.>>= 22:44:04 sheesh 22:44:31 idris is _so_ anti-play-around 22:54:28 -!- Sprocklem has joined. 22:54:46 -!- Sprocklem has quit (Changing host). 22:54:46 -!- Sprocklem has joined. 22:55:11 -!- hektor has quit (Quit: Page closed). 22:57:36 ( let x = Just 1; y = Just 2 in do return (!x + !y + 3) 22:57:36 Can't resolve type class Num (Fin m) 22:57:42 ? 22:58:26 ( let x = Just 1; y = Just 2 in do return (!x + !y + the Integer 3) 22:58:26 Just 6 : Maybe Integer 23:00:21 -!- ajf has joined. 23:00:26 Rate my esolang: http://esolangs.org/wiki/DevPerc 23:00:33 I’m prouder of this than I ought to be 23:01:48 and my dns to the wiki still hasn't updated. 23:02:09 although the name reminds me of Deviating Percolator 23:02:35 oh it's not a new page 23:02:48 You knew its name? :D 23:02:56 oerjan: Bang bindings have to show up in a context-valued expression (Maybe in this case). “!x + !y + 3 : Maybe A” would imply “3 : Maybe A” and “x, y : Maybe (Maybe A)”. 23:02:59 That makes me happy somehow 23:02:59 it's a nice name :P 23:03:11 oerjan: It’s a terrible name derived from thesaurusitis 23:04:22 I suppose it has a certain charm… 23:04:24 More appropriate name than Real Fast Nora's Hair Salon 3: Shear Disaster Download 23:04:37 Also, the double-indirection of everything makes my head hurt if I try to code in it 23:04:43 Taneb: oh i'm not sure i'd go _that_ far 23:04:43 I remember both that language and you. 23:04:46 but none of the details. 23:05:14 oerjan, I didn't say /better/ 23:05:21 Only more appropriate 23:05:27 ah ok 23:05:39 It’s a language in which there are 26 registers, A-Z, initialized at start with the ASCII chars A-Z. The source code is read as if it is made up of the characters in the named registers. 23:06:02 The most appropriate name for Real Fast Nora's Hair Salon 3: Shear Disaster Download I can think of is "LAMBDA", which is kind of sucky 23:06:06 So if I set A to the ASCII value of B, “FOOBAR” is read as “FOOBBR" 23:06:22 Taneb: how is the current name not the most appropriate? 23:06:45 olsner, because it is not at all indicative of the features of the language 23:06:54 Then again, neither is, say, "C" 23:07:20 -!- conehead has quit (Quit: Computer has gone to sleep). 23:07:43 Hmm 23:07:46 Taneb: If "LAMBDA" is "kind of sucky", then it would be why you have to call it "Real Fast Nora's Hair Salon 3: Shear Disaster Download" instead (which also isn't very good, but it is there) 23:08:11 I wonder if you could write useful programs in DevPerc by setting up a two-way pipe with sh 23:08:12 hey 23:08:23 Real Fast Nora's Hair Salon 3: Shear Disaster Download is a great name 23:08:34 zzo38, it is called Real Fast Nora's Hair Salon 3: Shear Disaster Download because Real Fast Nora's Hair Salon 3: Shear Disaster Download is its name 23:09:13 I know, I should write a Nil interpreter in DevPerc 23:09:30 -!- boily has joined. 23:09:46 -!- nooodl_ has quit (Ping timeout: 260 seconds). 23:09:50 I should try again to sleep 23:10:14 Taneb: that's a wholly insufficient reason, just ask any aged aged man 23:11:28 If I take Lisp and implement it with JSON’s syntax, is it just awkward syntax, or could it be considered esoteric? 23:11:31 Taneb: retanelle. just lay on a mattress and stare at the ceiling through your eyelids. 23:11:46 oerjan: aged aged? 23:11:52 @massages-loud 23:11:52 shachaf asked 8h 32m 58s ago: I got an email saying "typo for antediluvian?" with a broken link to github. Does this have to do with you? 23:11:52 shachaf said 5h 35m 27s ago: Oh, it's a private repository, so it shows up as 404. 23:11:52 boily, I try that but my neck hurts 23:12:04 boily: jfgi hth 23:12:23 shachaf: eh? 23:12:28 @messages-lewd 23:12:28 You don't have any messages 23:13:05 shachaf: yes, it has to do with me, but if you received the email that means you have access to the repo. last time I checked you were among the cocoonspirators hth 23:13:27 Yes. 23:13:34 But I wasn't logged in to github. 23:13:39 In fact I was doubly logged out. 23:13:56 you are a strange person. 23:14:35 oerjan: ifgi. tdh. t. 23:14:45 yw. 23:16:19 i thought we had a non-strange person in the channel but then i learned Vorpal works on cool robots 23:16:58 Surely there are nonstrangers in here. 23:17:14 maybe some of the lurkers. 23:17:45 boily: What's strange about me? 23:18:18 shachaf: you managed to be doubly logged out. that's anormal. 23:18:34 maybe shachaf has taken the red pill. 23:18:49 Oh. Well, I opened the link in an incognito window first. 23:19:04 But then I opened it in a regular window and it was still a 404. 23:19:58 ajf: are you strange? 23:20:02 -!- Patashu_ has joined. 23:20:02 -!- Patashu has quit (Disconnected by services). 23:20:12 boily: I am esoteric 23:20:22 good, gööd. 23:21:59 copumpkin: hey, did you ever read that thing 23:22:28 coöpumpkin 23:22:56 -!- monotone_ has joined. 23:23:08 -!- clog_ has joined. 23:23:41 kurpitsako olet? 23:24:19 -!- quintopi1 has joined. 23:24:26 @tell fizzie I think perhaps I should drop that down to a more reasonable one day. <-- i vaguely sort of thought the idea was to reduce it when hosting is unstable. 23:24:30 -!- FreeFull_ has joined. 23:24:49 @ping 23:25:03 are we going to have a splitfest again 23:25:34 `ping 23:25:35 pong 23:25:41 -!- metasepia has joined. 23:25:42 ~ping 23:25:43 Pong! 23:25:46 oerjan: perhaps. 23:25:59 int-e: LAMBDABOOOOOOOOOOOOOOOOT! 23:26:10 or possibly just ole lambda 23:27:26 int-e seems idle 23:29:20 -!- edwardk_ has joined. 23:29:28 -!- edwardk has quit (*.net *.split). 23:29:28 -!- FreeFull has quit (*.net *.split). 23:29:29 -!- lambdabot has quit (*.net *.split). 23:29:29 -!- quintopia has quit (*.net *.split). 23:29:29 -!- yiyus has quit (*.net *.split). 23:29:29 -!- monotone has quit (*.net *.split). 23:29:29 -!- clog has quit (*.net *.split). 23:29:41 bambdabot 23:30:43 @botsneak 23:30:59 Oh, lambdabot isn't back in this channel yet. 23:31:14 I guess you don't rejoin all the channels at the same time. 23:31:22 yup, the netsplit has netsplat. 23:31:30 (or is it netsplut?) 23:31:32 indeed, lambdabot takes its time 23:31:42 -!- yiyus has joined. 23:33:54 -!- lambdabot has joined. 23:35:26 only yiyus got through unscathed 23:36:14 @botsnack 23:36:14 :) 23:36:20 * boily pats lambdabot 23:52:23 I should try to make more Pokemon Card puzzle, or other people should too, but, nobody (other than myself) has yet solved my most recent one. 23:53:14 -!- boily has quit (Quit: OCULAR CHICKEN). 23:53:16 -!- metasepia has quit (Remote host closed the connection). 23:59:34 -!- shikhin has joined.