00:06:17 -!- yiyus has joined. 00:09:18 -!- hppavilion[1] has set topic: The fnord never fnords fnord in the fnord fnord | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/ | http://esolangs.org/. 00:09:32 That may be the stupidest thing I've ever done 00:10:38 -!- mihow has quit (Quit: mihow). 00:12:30 The never in the what? 00:14:08 oerjan: you can't spell "whenever" without fnord "never" 00:18:03 very ominously put there 00:21:50 fungot: tell oerjan what's up 00:21:50 shachaf: memo from yome: tell minion yow! 00:22:06 @yow 00:22:06 Talking Pinhead Blues: 00:22:06 Oh, I LOST my ``HELLO KITTY'' DOLL and I get BAD reception on channel 00:22:06 TWENTY-SIX!! 00:22:06 00:22:06 Th'HOSTESS FACTORY is closin' down and I just heard ZASU PITTS has been 00:22:08 [7 @more lines] 00:22:17 @more 00:22:17 DEAD for YEARS.. (sniff) 00:22:17 00:22:17 My PLATFORM SHOE collection was CHEWED up by th' dog, ALEXANDER HAIG 00:22:17 won't let me take a SHOWER 'til Easter ... (snurf) 00:22:18 00:22:20 So I went to the kitchen, but WALNUT PANELING whup me upside mah HAID!! 00:22:22 (on no, no, no.. Heh, heh) 00:22:29 tdnh 00:23:58 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 00:25:40 I wonder what lambdabot's voice sounds like 00:25:48 @@ 00:25:59 @a 00:25:59 Maybe you meant: activity activity-full admin all-dicts arr ask auto-reply auto-reply? v @ ? . 00:26:17 @. 00:26:17 Not enough arguments to @. 00:26:22 @help . 00:26:23 . [args]. 00:26:23 . [or compose] is the composition of two plugins 00:26:23 The following semantics are used: . f g xs == g xs >>= f 00:27:27 How does one obtain lambdabot on one's channel? 00:27:39 Perhaps by... /BLACK MAGIC!/ 00:27:46 * hppavilion[1] starts an inquisition 00:27:52 Did you try using the INVITE command? 00:27:58 No 00:28:02 I just have no clue how it works 00:28:08 Then read the help file 00:28:08 I'm /still/ an IRC n00b 00:28:27 The server has a help file to explain its working. 00:28:42 eAh 00:28:43 *Ah 00:32:43 OK 00:32:57 I tried /invite lambdabot 00:33:05 I don't know where to find the help file xD 00:33:57 @install 00:33:58 Not enough privileges 00:34:00 @help 00:34:01 help . Ask for help for . Try 'list' for all commands 00:34:06 @help installing 00:34:06 help . Ask for help for . Try 'list' for all commands 00:34:17 The help file is the HELP command on the server 00:34:48 The command you need to send is the "HELP INVITE" I don't know what IRC client you are using, see how you access server help file using it 00:35:23 i don't recall lambdabot responding to invite, i think you need to be an admin to make it join channels. 00:35:46 Oh 00:35:53 or you could be shachaf unless someone's closed the loophole 00:36:52 @join 00:36:52 Not enough privileges 00:37:10 i think that's the one 00:47:46 -!- jameseb has quit (Ping timeout: 246 seconds). 00:47:51 Im bac! helO hppavilion[1] 00:48:00 Hallu 00:48:06 Hallued grounds 00:48:21 halewd 00:48:48 -!- skarn has quit (Ping timeout: 246 seconds). 00:48:49 -!- fractal has quit (Ping timeout: 246 seconds). 00:49:21 http://www.orenwatson.be/speliG.htm <- wut dU yU TiGk uv Dis? 00:49:23 I'm making a skypebot! 00:49:36 Like HackBot, but in skype! 00:49:45 And without hackboty features! 00:49:53 Because I'm not smart enough to do that safely! 00:50:14 oren_: Ooooh pretty 00:50:33 -!- pikhq_ has quit (Ping timeout: 246 seconds). 00:50:38 is is u speliG reform pRpOsL 00:50:57 Interesting 00:52:42 Oh weL. 00:52:50 Du IdEu is Dat it is ferlE clOs tU cRNt speliG and CatspEk 00:54:09 -!- jameseb has joined. 00:54:12 ol lowRcAs letRs are Du sAm, onlE upRcAs letRs hav nU sWnds 00:54:49 s/are/ar 00:56:06 -!- skarn has joined. 00:57:37 sO mOst pEpL can figR it Wt frum context espeSLE bEcuz letRs lIk x,c,q,y retAn Der orijNL mEniG 00:58:32 -!- pikhq has joined. 01:00:56 Dus it strIks u balNs betwEn tradiSNL speliG and fNetic speliG 01:03:51 -!- fractal has joined. 01:04:13 So, I've been thinking about natural numbers and other things. 01:04:29 Given a set S, the following two concepts are equivalent. 01:04:37 Wait, no they're not. 01:04:47 um wut 01:04:58 In any case, consider the following concept: "a set S, an element of S, and a function S -> S". 01:05:23 Given "one of those", and a natural number, there's an obvious way of getting an element of S. 01:05:38 Just start with the element there and apply the function the appropriate number of times. 01:06:02 Ok 01:06:26 Indeed, it may or may not make sense to *define* a natural number as something that takes any "one of those" and returns an element of S. 01:07:03 Given this, I'm wondering what the most appropriate term for "one of those" would be. 01:07:08 I'm thinking "natural number algebra". 01:08:49 duz evrE elMNt uv S haf tU bE rECabL bI itRAtiG Du funcSN on Du elMNt? 01:09:21 does every element of S have to be reachable by iterating the function on the element? 01:09:30 No. 01:10:05 Den tU dU nat 01:10:45 menE 'wuns uv DOs' wil bE eqivLNt 01:11:15 I lIk yOr speliG prOpOzL. 01:12:20 tswett: in system F, naturals are defined as the type forall a. (a -> a) -> (a -> a) hth 01:12:34 why does idea become IdEu? 01:12:37 which is equivalent to what you said 01:12:49 u represents the u sound in but 01:13:20 I as in kite, E as in beet, u as in but 01:13:23 i suppose that's also the church encoding 01:13:44 @google natural numbers object 01:13:45 http://ncatlab.org/nlab/show/natural+numbers+object 01:13:46 Title: natural numbers object in nLab 01:13:46 it's hard for non native english speakers 01:14:26 izabera: i'm pretty sure oren_'s system conflates several english sounds 01:14:40 the u in but is not the same as the a in idea 01:14:40 All English speakers conflate several English sounds. 01:14:50 well maybe in oren_'s dialect 01:15:59 tswett: Your definition is like the least fixed point of Maybe. 01:16:01 * oerjan realizes "conflate" is probably not easy for non native speakers either 01:16:01 lME trI (lemme try?) 01:16:06 How many syllables is "idea" supposed to have? 01:16:13 Mu Maybe = forall r. (Maybe r -> r) -> r 01:16:30 3 sLubLs 01:16:46 I dE u 01:17:31 shachaf: well, natural numbers are like the least fixed point of Maybe. 01:17:47 Yes. 01:18:20 anyway conaturals > naturals 01:19:28 why element -> elMNt instead of LMNt? 01:19:35 oerjan: Dis sistM duzNt distiGwiS ol sWnds in mI dIulect EDR 01:19:37 -!- variable has joined. 01:20:35 izabera: the difference between "el" and "L" is like the difference between the "el" in "repel" and the "le" in "ripple". 01:21:21 ok i give up <.< 01:23:06 oerjan: for ixampL, W wiT and wiTWt canAdEin rAsiG. 01:25:18 (Du sWnds in 'loud' and 'lout' wud boT bE W) 01:28:05 O kA 01:30:54 hWevR, yU can stil figR it Wt frum Du folOwiG t or d 01:39:44 -!- athenabot has joined. 01:48:33 -!- idris-bot has joined. 01:48:33 -!- idris-bot has quit (Client Quit). 01:52:20 -!- idris-bot has joined. 01:53:32 What would my variant True Seeing spell be worth in terms of slot level and so on? 01:53:48 I don't know your variant. 01:55:03 It is a much simpler effect: The target can see things as if all magic were absent. You cannot selectively treat magics as absent; it must be all or none. 01:55:39 What if I summon a creature with magic? Will I be able to see it? 01:56:31 Yes, but you will not be able to see past any illusion that has subsequently been cast upon it. 01:57:02 If you choose to see past the illusion, you won't see the summoned creature either. 01:57:14 (Although you can still hear them) 01:57:44 What if I summon a creature and that creature attacks someone? Will I be able to see their wounds? 01:57:56 Yes. 01:58:11 shachaf: let me guess, the last oots episode is chock full of references to the book... 01:58:24 oerjan: ? 01:58:36 episode? 01:58:47 strip, whatever 01:58:54 You mean 1003? 01:59:12 I don't remember what's in the book. 01:59:15 I read it years ago. 01:59:19 CAN'T A MAN USE A SYNONYM WITHOUT EVERYONE GETTING CONFUSED 01:59:21 Maybe you can read it and remind me. 01:59:48 oerjan: burlew recently confused me about the terminology hth 01:59:54 Apparently a strip can contain multiple pages. 01:59:55 i only remember that that maneuver happened during the pyramid illusion 02:00:12 Which maneuver? 02:00:27 Oh, that maneuver. 02:00:34 His grandfather taught it to him after he died. 02:00:47 ooh 02:00:56 And he's used it before, I think. 02:00:57 http://www.giantitp.com/comics/oots0928.html 02:00:58 An error occurred while processing the link. 02:01:17 athenabot: the error was that you spoke 02:02:02 shachaf: that was after the pyramid 02:03:21 Yes. Maybe I misunderstood the word "only". 02:04:02 * oerjan swats shachaf -----### 02:04:49 Oh, now I see what you meant. 02:04:59 I meant "actually used it before", as opposed to "imagining that he used it". 02:07:57 Another kind of idea would be, spell that increase your AC and you receive only half damage with spells but you also get penalty to attacks and can only cause half damage with spells. 02:09:50 oerjan: http://www.giantitp.com/comics/oots0600.html hth 02:09:51 An error occurred while processing the link. 02:15:45 -!- ChanServ has set channel mode: +o oerjan. 02:15:50 -!- oerjan has kicked athenabot athenabot. 02:15:54 -!- oerjan has set channel mode: -o oerjan. 02:16:16 we've got enough annoying bots already 02:16:29 I believe you. 02:18:46 But... what if *I'm* a bot? D: 02:20:00 * oerjan watches zgrep suspiciously 02:20:17 * zgrep makes suspicious noises 02:20:18 Beep. 02:20:19 Boop. 02:23:02 `ølist 02:28:46 -!- mauris has joined. 02:54:56 oerjan: prediction: mr. scruffy will turn the tides hth 02:58:50 mr. scruffy didn't go down to the moot with them afair 03:00:10 mr. scruffy can follow belkar wherever he goes, i'm sure 03:00:13 so that's a moot point 03:02:46 I wonder. 03:02:49 `echo tswett 03:02:52 tswett 03:02:56 `loudly tswett 03:02:57 ​tswett 03:03:11 My client doesn't seem to recognize the latter as my nick. 03:12:55 shachaf: i'm wondering more about bloodfeast the former dinosaur 03:13:48 surely that polymorph spell will be removed some day 03:13:55 hmm, http://www.d20srd.org/srd/spells/balefulPolymorph.htm 03:15:02 complicated 03:29:03 `loudly N_T, DoS, LoW, DoW 03:29:04 ​N_T, DoS, LoW, DoW 03:31:33 -!- pikhq has quit (Ping timeout: 246 seconds). 03:32:24 -!- pikhq has joined. 03:32:49 -!- sammwch has joined. 03:33:24 -!- heddwch has quit (Read error: Connection reset by peer). 03:33:42 -!- sammwch has changed nick to heddwch. 03:37:52 * pikhq curses. 03:38:13 Finding out you can't get your passport before international travel: FUCK. 03:40:07 whoa whoa whoa 03:40:13 switzerland? 03:43:10 Why can't you get your passport, pikhq? May I ask? 03:49:19 I fucked up the application. 03:49:54 Helps handing them the *correct* expired passport. 03:50:00 oops 03:50:03 pikhq: is there an expedited application you can do to get it in time? 03:50:25 The soonest I can *get in* to apply for an expedited passport is after I need to be there. 03:50:56 welp 03:51:00 let me join you then 03:51:01 FUCK 03:51:05 Sucks to be me then. 03:51:10 shachaf: Yep. 03:53:14 ... sounds like I'm VCing at like midnight then? 03:55:14 [wiki] [[Bubblegum]] http://esolangs.org/w/index.php?diff=44111&oldid=44054 * Dennis * (+2) 03:55:39 pikhq: glhf 03:55:59 * pikhq sayeth FMLFMLFML 03:57:08 -!- doesthiswork has joined. 03:58:18 I should be asleep 03:58:25 I need to be at training for the new job tomorrow morning 03:58:28 soon to be today morning 03:58:29 yes 03:58:36 doesthiswork: good to know 03:58:43 what job is it? 04:00:10 software developer at a local firm 04:01:46 exciting 04:02:18 just tell them you were on irc all night 04:02:24 the'll probably understand 04:09:37 -!- oerjan has quit (Quit: feels like lampshading). 04:20:36 It'd work at Google HTH. 04:27:52 yeah it would, wouldn't it 04:27:58 well, it wouldn't on your first day 04:29:50 -!- Wright has quit (Ping timeout: 240 seconds). 04:31:05 hmm. what, actually, is the easiest TC esolang to implement 04:31:18 like, brainfuck has brace matching! so hard 04:31:21 brainfuk 04:31:44 not really but you can just use someone else's implementation 04:32:52 http://esolangs.org/wiki/2014 04:33:21 -!- sc00fy has joined. 04:33:34 an interpreter is trivial to write for it 04:34:06 You should improve the list of complexity classes so that actually is some information being listed. 04:34:22 Implement in what? 04:34:41 shachaf: hmm, let's say C 04:35:03 You can compile bf to C pretty easily if you have a C compiler. 04:35:11 But I guess strictly speaking that's not what you mean by C. 04:36:55 yeah, i mean like an actual C program that reads code and runs it; not a conversion to C 04:37:25 i suppose "TC" is inaccurate but (barfs), do we have a word for "TC but not really but ykwim man" 04:44:17 actually there is a concept for this 04:44:26 I don't know of a succinct name 04:44:38 but there does exist a notion of a turing-complete program class 04:44:49 https://esolangs.org/wiki/Bounded-storage_machine ? 04:44:50 I'd have to look up my notes for them though and I'm going to sleep now 04:45:06 mauris: sort of 04:45:29 https://en.wikipedia.org/wiki/Circuit_complexity 04:45:32 there, read that 04:46:47 maybe bf where [ and ] are instead jumps that double/halve the pc 04:47:48 -!- variable has quit (Quit: 1 found in /dev/zero). 05:14:33 -!- variable has joined. 05:14:52 Ya'll should use boolfuck 05:16:08 It's so easy to implement a Turing-complete esolang in C, people do it by accident 05:16:39 Did you know: Jafet is Turing-complete 05:17:12 #include \ int main(void) { char buf[100]; fgets(buf, 1000, stdin); return 0; } 05:21:13 I hear some people are Turing-hard. 05:22:19 that doesn't look like a very good interpreter 05:23:18 mauris: You can use it to call a better one 05:23:20 do you just pray "buf" is right before the memory you're executing, which gets buffer overflown and then instead of "return 0" you're running machine code? 05:25:08 In correct code, you don't buffer overflow, you dynamically size your buffer appropriately. 05:25:44 For instance: int main(void) { char *buf = 0; getline(&buf, (size_t[]){0}, stdin); return 0; } 05:27:29 pikhq: (size_t[]){0} looks like C++ 05:27:39 It's C99. 05:28:13 Essentially all that does is produce an unnamed size_t[1]. 05:28:23 (on the stack, of course) 05:28:41 As a natural consequence of C99 adding array and struct literals. 05:29:37 -!- ineiros_ has quit (Ping timeout: 252 seconds). 05:30:25 -!- ineiros has joined. 05:31:03 * izabera can hear people in ##c complaining because "getline not standard!!!1!" 05:32:54 It's POSIX. 05:33:19 And frankly that's plenty good enough. You're kidding yourself if you think not-POSIX land gives a shit about C at all these days. 05:36:15 If we're restricting ourselves to languages on the wiki, it's also much easier to interpret thue than brainfuck 05:36:57 Some stuff on esolang wiki would be difficult or perhaps even impossible to implement, but some is much easier than being impossible. 05:39:35 i never feel like i have enough time to implement stuff if it's more complicated than like...7 instructions :P 05:42:22 You could exploit the TBFS formalism to implement many languages. 05:43:17 I'll try to implement codesine the next time I work on it. 05:44:19 Or part of it anyway. 05:44:45 -!- variable has quit (Ping timeout: 244 seconds). 05:44:49 -!- doesthiswork has quit (Quit: Leaving.). 05:45:37 [19:16] < Jafet> It's so easy to implement a Turing-complete esolang in C, people do it by accident 05:45:44 nah, too common to be considered esolang :) 06:02:11 I don't get Jafet's joke :( 06:05:47 Virgolang is never on :( 06:06:05 @tell Virgolang Can I get a basic time table as to when you are and are not online?? 06:06:05 Consider it noted. 06:15:43 It's so easy to implement a Turing-complete esolang in C, people do it by accident <-- that is how scrip7 started 06:17:43 I was initially trying to make a simple configuration file format, which ended up needing loops to assign the same value to a bunch of bytes, and if statements to make things depend on values placed in memory by the host, and... whoops 06:18:35 -!- JesseH has quit (Quit: Leaving). 06:20:54 http://okmij.org/ftp/Computation/#sendmail-Turing 06:55:02 pikhq: don't you need a free(buf) there? 06:55:11 well. "need" 06:55:52 -!- bender| has quit (Quit: Ping Pong Fuckout). 07:05:00 https://github.com/catseye/Thue/blob/master/src/thue.c this looks a bit more involved than "match braces and run through a while loop" but some of it is fluff and most of it is the fact that handling strings in C is annoying 07:05:53 can we talk about that indentation style? 07:07:08 however, my opinion is that this is in almost no way simpler than brainfuck. its tokens are "big" so you can't just loop over the chars, there are lots of weird edge cases for I/O, it's nondeterministic, it involves string replacement 07:07:08 yeah wtf. correct indents is one tab per indent. 07:07:19 ps yes this indent style, help 07:09:10 wel its mor Du lak uv cNsistNcE than anything 07:09:40 ^ lk uv consistency ubuv deliberate 07:11:33 olsO Du yus uv tU lIn ifs Dat cud fit on wun lIn 07:15:40 -!- AnotherTest has joined. 07:16:34 fuk yU mIcrOsoft wI cant I hav u '?' or '()' in mI fIlnAm?! 07:17:40 what happens if you import data from a different filesystem? 07:17:58 i mean if you import files with characters that ntfs wouldn't allow 07:18:27 it just wont 'cp' Du fIl 07:18:28 are they ignored? converted? 07:18:58 sO I haf tU rEnAm Dem manUulE 07:19:59 cp: cannot create regular file ‘music/Charly Lownoise & Mental Theo - Hardcore Feelings (?).mp3’: Invalid argument 07:27:21 Du wRst part is I dNno wiC cerictRs ar invalid. stUpid erR mesaj! 07:29:02 -!- x10A94 has joined. 07:30:29 mauris: well, you don't need the clunky I/O for Turing-completeness. The string replacement is very easy to implement (strstr, realloc and memmove) 07:31:26 wut!!!! cp: cannot create regular file ‘music/Milk Inc - Whisper.mp3’: File exists 07:33:40 Du dRectRE wuz emptE! hW can Du nAms bE Du sAm on ntfs but difrNt on ext3? 07:34:03 ^style sms 07:34:03 Selected style: sms (National University of Singapore SMS corpus, 2011-08-20) 07:34:20 oren_: can you stop 07:34:34 stop wut? 07:36:25 cMplAniG ubWt ntfs or spelling things in a new way? 07:37:32 it's actually pretty hard to read 07:38:34 i am impressed how it is even possible, though 07:39:03 Never mind hard, it's unpleasant. 07:40:04 What if we agree that oren_ uses this spelling and oren (or, better yet, orin) uses traditional spelling? 07:40:26 fungot can serve as an interpreter. 07:40:26 Jafet: oh.. posb? nvr hear before leh.but i dun mind. you already there? rep. *brrr ur fb friends win cool coke can :) 07:40:58 So how is it even possible to have two files with the same name in the same directory? 07:42:07 I'VE BEEN LAUGHING FOR 10 MINUTES http://imgur.com/gallery/02BjRvJ 07:42:08 Oh. NTFS is case insensitive. FUK! 07:42:15 Use ntfs-3g to mount the filesystem on linux in case-sensitive mode 07:43:04 On Windows, there's also SUA 07:46:57 hmm the two files are actually identical. 07:47:06 I'm keeping the one from 2006 though 07:53:34 -!- Sgeo has joined. 07:54:26 oren_: also look at http://zompist.com/spell.html ("Spelling reform by regularization" section is relevant) 07:54:45 -!- Sgeo__ has quit (Ping timeout: 246 seconds). 07:58:30 lifthrasiir: I see. he uses diacritics, but they aren't on my murikan keyboard, therefore capitcal letters are better. 08:02:51 also this guy thinks cot has a different vowel than caught. 08:03:26 "Another kind of idea would be, spell that increase your AC and you receive only half damage with spells but you also get penalty to attacks and can only cause half damage with spells." -- a steelform spell? sure, why not. it can't hurt to have more variations of those. 08:04:38 zzo38: ^ 08:04:44 oren_: "his" version of American English, so that is expected IMO. 08:05:18 anyway, that page is a pretty good introduction to the automatic pronunciation reconstruction from spelling 08:07:02 -!- mauris has quit (Remote host closed the connection). 08:07:14 but you can't do the opposite, which is kind of a problem if you want to look it up in a dictionary 08:08:17 yeah, the spelling "reform" is what he got after removing any remaining special cases from his original reconsturction algorithm 08:08:23 -!- hppavilion[1] has quit (Ping timeout: 244 seconds). 08:08:35 that's pretty heuristic, and ultimately a bit ambiguous 08:08:41 but hey, we have an algorithm there :p 08:08:42 consider if i wanted to look up the word sot. i have to try sought, sot, saught, sawt 08:09:09 afaik three of those are valid 08:10:03 Some dictionary software supports lookup by voice. 08:10:06 i recommend banning the longer pellings 08:11:46 actually ban any sequence of gh 08:13:24 I actually kind of agree to that 08:13:44 but the real complication is a large number of vowel digraphs (or, sometimes, trigraphs) 08:14:02 we would have lots of them even after banning gh 08:25:25 so we need more letters and lVk, Ders a SHIFT key on my keyboard that makes different letter when it's pressed, why don't we use that?!? 08:29:02 i mean noone uses capital letters anymore on the internet unless they're shouting 08:34:27 -!- Patashu has joined. 09:00:28 -!- FireFly has quit (Read error: Connection reset by peer). 09:00:32 -!- heddwch has quit (Read error: Connection reset by peer). 09:00:58 -!- heddwch has joined. 09:04:50 -!- FireFly has joined. 09:31:10 -!- paul2520 has left ("WeeChat 1.2"). 09:31:16 -!- paul2520 has joined. 10:14:53 -!- newsham has quit (Ping timeout: 252 seconds). 10:15:16 -!- newsham has joined. 10:15:19 -!- Alcest has quit (Ping timeout: 260 seconds). 10:27:18 -!- J_Arcane has joined. 10:37:37 [wiki] [[J-why]] http://esolangs.org/w/index.php?diff=44112&oldid=44107 * Jabutosama * (+1494) /* Programming with J-why */ 10:38:42 [wiki] [[J-why]] http://esolangs.org/w/index.php?diff=44113&oldid=44112 * Jabutosama * (+10) /* Programming with J-why */ 11:09:13 -!- AnotherTest has quit (Ping timeout: 244 seconds). 11:25:57 -!- AnotherTest has joined. 11:26:16 -!- x1365C has joined. 11:26:30 -!- x10A94 has quit (Ping timeout: 265 seconds). 11:28:19 -!- x1365C has changed nick to x10A94. 11:40:38 -!- Phantom_Hoover has joined. 11:56:14 -!- TieSoul has joined. 11:58:48 -!- x10A94 has quit (Ping timeout: 244 seconds). 12:01:14 -!- TieSoul has quit (Ping timeout: 260 seconds). 12:01:57 -!- x10A94 has joined. 12:05:02 -!- TieSoul has joined. 12:31:14 [wiki] [[Brainloller]] http://esolangs.org/w/index.php?diff=44114&oldid=42181 * 94.62.69.164 * (+16) 12:43:06 -!- Patashu has quit (Ping timeout: 240 seconds). 12:44:21 do you guys know hex? 12:44:25 hex the game i mean 12:45:14 I've read about it 12:46:49 wanna plaaaaay? 12:54:35 I'm trying to work 13:03:19 izabera, I don't know it, what is it? 13:03:29 it's a board game 13:03:47 What kind of board game? 13:04:21 there's this kite shaped board with two opposite red sides and two opposite blue sides 13:04:29 with hexagonal tiles 13:05:11 each player must create a bridge between his two sides 13:05:25 Oh, that game! 13:05:31 yes exactly! 13:05:39 I am not very good at it :(* 13:34:30 -!- `^_^ has joined. 13:43:16 -!- Wright has joined. 13:49:03 -!- `^_^ has changed nick to `^_^v. 13:53:10 I think I've got a sieve of Atkin in Haskell 13:53:42 Does anyone have a checksum of all the primes less than 6 million, in ascending order, one per line? 13:55:57 -!- MDude has quit (Ping timeout: 246 seconds). 14:03:51 -!- Wright has quit (Ping timeout: 256 seconds). 14:04:29 1192390967254 14:04:36 is the sum 14:06:18 I can confirm that's the sum 14:06:39 i get 5b5abad etc for the sha256 14:07:06 Got the right sha256 14:07:15 yay 14:07:58 1192390967254 14:08:02 `thanks cloud.sagemath.org 14:08:03 Thanks, cloud.sagemath.org. Thoud.sagemath.org. 14:08:05 That looks right 14:08:13 `thanks ashl 14:08:13 Thanks, ashl. Thashl. 14:09:23 http://lpaste.net/140543 14:09:25 wolfram alpha refused to help me 14:10:03 (depends on vector and pqueue) 14:11:48 (also kind of ugly code) 14:12:33 o_o 14:13:03 Sieve of Atkin is not the cleanest algorithm 14:13:08 Nor am I the best programmer 14:14:36 The actual Sieve of Erastothenes is pretty good 14:15:44 actual? 14:16:34 ashl, there's a thing that used to (maybe still is) bandied about that claims to be the sieve of Erastothenes in Haskell but isn't 14:16:35 As opposed to the fake version that is actually trial division in disguise 14:16:42 FreeFull, iirc it's worse than trial division 14:16:57 https://www.cs.hmc.edu/~oneill/papers/Sieve-JFP.pdf is the relevant paper 14:17:29 Oh no, it is trial division 14:19:12 Just bad trial division 14:20:27 -!- oerjan has joined. 14:21:25 oh ,that 14:21:44 I used that paper for implementation hints 14:22:56 Although I got in a muddle and ended up just using the hint to use a priority queue 14:23:58 One thing I ought to work out how to do is generating the candidates lazily 14:24:35 So I can have an infinite list 14:25:35 yes 14:26:24 Rather than just the first 6 million 14:26:31 (or any other natural multiple of 60) 14:48:39 `url bin/! 14:48:40 http://codu.org/projects/hackbot/fshg/index.cgi/file/tip/bin/%21 14:49:33 `` ls -l bin/! 14:49:35 lrwxrwxrwx 1 5000 0 6 Jun 21 02:47 bin/! -> interp 14:49:42 oh it's still a link 15:03:54 @tell ais523 it was intended so that we could add esolangs to it ourselves instead of having to bother Gregor <-- the problem is that HackEgo never got all of EgoBot's features and what _was_ belatedly transfered of EgoBot's structure is hard to discover and modify and doesn't fit at all with the "linux system" basis. 15:03:54 Consider it noted. 15:06:31 @tell ais523 and the "linux system" part keeps getting new layers added as newbies don't know about the old ones. 15:06:31 Consider it noted. 15:09:26 -!- AnotherTest has quit (Ping timeout: 240 seconds). 15:44:43 -!- FreeFull has quit (Quit: BBS). 15:56:13 -!- FreeFull has joined. 16:13:55 -!- mihow has joined. 16:47:09 -!- hppavilion[1] has joined. 16:47:29 -!- ais523 has joined. 16:50:53 -!- oerjan has quit (Quit: Boo!). 17:00:15 -!- hppavilion[1] has quit (Ping timeout: 255 seconds). 17:02:09 -!- hppavilion[1] has joined. 17:12:42 -!- MDude has joined. 17:19:09 -!- hppavilion[1] has quit (Ping timeout: 255 seconds). 17:52:46 -!- JesseH has joined. 17:59:13 -!- atrapado has joined. 18:16:03 -!- nycs has joined. 18:18:27 -!- `^_^v has quit (Ping timeout: 246 seconds). 18:26:12 -!- Lithiumate has joined. 18:26:20 i have a bot 18:26:22 I have made the game which resemble the puzzle mode of the Panel de Pon game, although additionally there are blocks that cannot be matched, as well as in addition to switches you can also use erasers and rotators. 18:26:32 i am writing modules for it 18:26:41 it has only bf interpreter. 18:26:56 and now, writing it an befunge interpreter. 18:27:11 Lithiumate: What bot is that, what is module being written with, is there the information of it? OK you can please write some more! 18:27:25 python! 18:28:29 and i will connect them to my bot for use of people 18:28:31 -!- bb010g has joined. 18:29:12 OK 18:32:44 -!- hppavilion[1] has joined. 18:32:57 Tsumeshogi! I play the game! 18:34:41 [wiki] [[User talk:Sinatra]] N http://esolangs.org/w/index.php?oldid=44115 * Hppavilion1 * (+113) /* To IRC! */ new section 18:38:27 i will write virgo interpreter soon 18:38:52 -!- AnotherTest has joined. 18:40:58 what's all the fuzz about this virgo thing? 18:41:02 -!- yorick has quit (Remote host closed the connection). 18:41:23 it is an esolang 18:41:35 i can't login to my esolangs account! 18:41:44 I think there is information in wiki, you can look 18:42:15 -!- fractal has quit (Ping timeout: 246 seconds). 18:43:49 -!- yorick_ has joined. 18:45:37 -!- hppavilion[1]_ has joined. 18:47:51 -!- hppavilion[1] has quit (Ping timeout: 252 seconds). 18:50:28 -!- fractal has joined. 18:53:17 -!- FreeFull has quit (Quit: BBS). 19:04:43 -!- hppavilion[1]_ has quit (Ping timeout: 252 seconds). 19:05:28 -!- FreeFull has joined. 19:10:38 -!- hppavilion[1]_ has joined. 19:15:50 What was this about login problems? 19:33:52 i forgot the pass and i don't linked email 19:38:15 -!- Lithiumate has quit (Ping timeout: 246 seconds). 19:43:18 -!- sc00fy has quit (Ping timeout: 244 seconds). 19:54:26 -!- J_Arcane has quit (Read error: Connection reset by peer). 19:56:09 -!- J_Arcane has joined. 20:01:26 -!- zzo38 has quit (Remote host closed the connection). 20:02:28 -!- Virgolang has joined. 20:03:11 -!- ais523 has quit (Quit: buying food). 20:10:32 [wiki] [[Piet-Q]] http://esolangs.org/w/index.php?diff=44116&oldid=32427 * SuperJedi224 * (-14) /* Commands */ 20:11:19 -!- shikhin has changed nick to humans. 20:12:12 -!- humans has changed nick to shikhin. 20:13:22 -!- JesseH has quit (Remote host closed the connection). 20:15:04 -!- JesseH has joined. 20:24:42 -!- heddwch has changed nick to readit_yay_for_a. 20:24:49 -!- readit_yay_for_a has changed nick to heddwch. 20:30:17 -!- TieSoul has quit (Remote host closed the connection). 20:33:14 -!- bb010g has quit (Quit: Connection closed for inactivity). 20:33:49 -!- hppavilion[1]_ has quit (Ping timeout: 252 seconds). 20:41:40 -!- heddwch has changed nick to Muck_Peerburg. 20:42:13 -!- Muck_Peerburg has changed nick to heddwch. 20:42:43 -!- shikhin has changed nick to wch. 20:43:56 -!- wch has changed nick to shikhin. 21:00:39 -!- x10A94 has quit (Read error: Connection reset by peer). 21:05:37 -!- nycs has quit (Quit: This computer has gone to sleep). 21:06:24 -!- Patashu has joined. 21:06:58 -!- myndzi has joined. 21:13:59 -!- ais523 has joined. 21:20:11 [wiki] [[Brainfuck]] http://esolangs.org/w/index.php?diff=44117&oldid=43910 * Rdebath * (+1977) It seemed a bit fragmented, try this. 21:23:51 For Turing completeness either the number of cells must be unbounded or (at least) three unbounded cells are required, the former is usually assumed. 21:23:54 -!- J_Arcane has quit (Ping timeout: 265 seconds). 21:24:12 can you prove that less than 3 is not enough? 21:38:04 -!- hppavilion[1] has joined. 21:38:33 Hellu 21:42:39 -!- Patashu has quit (Ping timeout: 244 seconds). 21:46:51 Can you prove that you can prove that you can prove that you can prove that? 21:48:56 are we allowed to mix unbounded and bounded cells? 21:57:23 why not 21:57:52 because then two unbounded cells are enough 21:58:15 a finite tape and two unbounded cells 21:58:20 yes 21:58:38 (two counters can simulate three counters) 21:58:39 well show it 21:58:58 i'm not really familiar with this kind of proof at all 22:01:09 with two counters and a scratch counter, you can simulate two stacks, hence a tape. You can encode counters a, b, c as 2^a*3^b*5^c, and use the scratch counter and a finite number of states to check whether one of a, b or c is 0, or increment a counter, or decrement a non-zeor counter. 22:04:44 -!- mauris has joined. 22:04:54 -!- mauris has quit (Changing host). 22:04:54 -!- mauris has joined. 22:05:57 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 22:06:23 -!- hppavilion[1]_ has joined. 22:06:55 -!- hppavilion[1]_ has set topic: The fnord never fnords fnord in the fnord fnord | https://dl.dropboxusercontent.com/u/2023808/wisdom.pdf http://codu.org/logs/_esoteric/ http://tunes.org/~nef/logs/esoteric/ | http://esolangs.org/. 22:07:00 Whoops 22:07:04 I just changed nothing 22:07:10 fungot: 22:07:10 hppavilion[1]_: k d i vil mistake me only cha.dnt talk? 22:07:25 Um 22:07:29 OK then 22:07:42 fungot: oh a mystery 22:07:42 int-e: aiyo cos she will not get an allowance for the first month 22:07:48 ^style 22:07:48 Available: agora alice c64 ct darwin discworld enron europarl ff7 fisher fungot homestuck ic irc iwcs jargon lovecraft nethack oots pa qwantz sms* speeches ss wp youtube 22:07:53 ah. 22:08:11 -!- AnotherTest has quit (Quit: ZNC - http://znc.in). 22:08:23 that's probably the worst of all those styles 22:08:45 at least if you try to figure out what is actually being said :P 22:08:49 ^style youtube 22:08:49 Selected style: youtube (Some YouTube comments) 22:09:19 fungot 22:09:20 izabera: great job. not some overrated movie with will ferrell called land of the scenes. i can't wait for the pilot if he dressed like that 22:09:30 Virgolang: Hi 22:09:32 -!- oerjan has joined. 22:11:36 -!- hppavilion[1]_ has changed nick to hppavilion[1]. 22:11:58 land of the scenes would be a good movie 22:14:20 -!- ais523 has quit. 22:16:26 -!- Wright has joined. 22:22:49 -!- atrapado has quit (Quit: Leaving). 22:23:48 -!- Virgolang has quit (Ping timeout: 246 seconds). 22:25:14 -!- Sgeo has quit (Read error: Connection reset by peer). 22:25:37 Dammit, virgo 22:28:13 virgone 22:37:08 -!- hppavilion[1] has quit (Ping timeout: 250 seconds). 22:49:37 GOD SAVE THE QUEEN 22:49:55 he's doing a pretty good job so far, i hear 22:52:07 oerjan: what, sonja? 22:52:24 shachaf: no, elizabeth. well i guess sonja too. 22:53:21 It's the future and Queen Elizabeth III and Queen Elizabeth IV are going to a party held by Queen Elizabeth V. 22:54:35 the future sounds dutch 22:55:52 The first couple of times I watched I didn't realize the age thing. 22:55:59 I guess I'm not used to queens. 22:56:38 "the age of Queen Elizabeth" is presumably an antitone function from naturals to naturals. 22:57:25 except for Queen Elizabeth VII the Time Traveler 22:57:58 -!- Thisbe has joined. 22:58:23 someone should make a sitcom out of this 22:58:47 and sdrawkcaB ehT I- htebazilE neeuQ 22:59:33 also known as Queen Elizaaleph? 23:00:37 not necessarily, although suspiciously no one _has_ seen them at the same time... 23:06:33 can you prove that less than 3 is not enough? <-- istr this keeps coming up. i vaguely think i thought the argument held last time... 23:07:01 if you have only 2 cells, then whenever you exit a loop, one of them must be 0. 23:07:25 [wiki] [[Special:Log/move]] move_redir * Timwi * moved [[CA (programming language)]] to [[CA-1]] over redirect 23:08:10 this means that if you start out with arbitrary values, then relatively soon _one_ of them can only have finitely many options 23:08:37 -!- hppavilion[1] has joined. 23:08:42 this means you can refactor the brainfuck program as a 1-counter state machine 23:08:50 which is known not to be TC. 23:09:32 (relatively soon = as soon as you have exited a loop) 23:10:35 -!- mihow has quit (Quit: mihow). 23:10:36 hm except there are some loops like [>-<+] that do copying, so the finite number of options doesn't hold at _every_ later moment 23:11:10 * [>+<-] seems more likely 23:11:23 but it should hold outside of innermost loops 23:11:52 something like that yeah 23:14:50 oh hm there's some issues like you can do multiplication by constants, and division _if_ the remainder is 0 23:15:10 (if not for the remainder 0 restriction that would be a TC machine) 23:16:03 hm there are too many possible loopholes for me to feel safe about this argument 23:16:14 I'm thinking about the differences in how waves propagate depending on their frequency. 23:17:23 I think the major thing is probably multipath interference. 23:18:08 If the size of the obstacles is much smaller than the wavelength, the amount of multipath interference is going to be small, so low-frequency waves will effectively "wrap around" those obstacles pretty well. 23:18:58 If the obstacles are much larger than the wavelength, now you probably will see a lot of multipath interference. 23:19:59 are you making a wave esolang 23:27:38 ...I should. 23:27:46 Oh, that would be so awesome. 23:29:03 A program just consists of, oh, a set of rectangles where you specify the characteristics of the medium there. 23:30:46 I'm not sure exactly how you'd specify those characteristics. 23:31:04 Guess you could start by saying that you can specify the impedance. 23:32:51 https://en.wikipedia.org/wiki/Hearing_the_shape_of_a_drum 23:41:10 int-e: i wonder how that castle compares to castle heterodyne... 23:43:32 i guess "not as lethal" is a safe bet. 23:43:47 safe... hehe. 23:44:33 well at least unless the master _wants_ you dead 23:47:21 also known as Queen Elizaaleph? <-- this is a good joke 23:47:58 oops 23:56:50 gVd EvniG! 23:57:34 go kveill