00:10:23 -!- heroux has quit (Ping timeout: 264 seconds). 00:14:24 -!- Vorpal_ has joined. 00:14:47 -!- glowcoil_ has joined. 00:15:07 -!- p34k has quit (Ping timeout: 240 seconds). 00:15:08 -!- Vorpal has quit (Ping timeout: 240 seconds). 00:15:08 -!- glowcoil has quit (Ping timeout: 240 seconds). 00:15:50 -!- glowcoil_ has changed nick to glowcoil. 00:17:08 -!- heroux has joined. 00:27:43 damn it's almost like these names aren't meant to be spelled out loud <-- you just need to be czech hth 00:27:59 :) 00:28:20 strcspn is almost the beginning of a well-known czech tongue-twister 00:34:58 `? misle 00:35:01 misle? ¯\(°​_o)/¯ 00:35:32 `learn misle v. intr. "I was misled about morphology." 00:35:36 Learned 'misle': misle v. intr. "I was misled about morphology." 00:35:44 no wait 00:35:51 `learn misle v. tr. "I was misled about morphology." 00:35:54 Learned 'misle': misle v. tr. "I was misled about morphology." 00:36:47 -!- heroux has quit (Ping timeout: 264 seconds). 00:36:58 -!- heroux has joined. 00:40:39 i'm planning to launch a shitload of short-lived processes 00:40:46 how may will take my system down? 00:40:51 42 00:40:53 s/may/many/ 00:40:58 no seriously 00:41:19 sorry, i cannot do that 00:42:53 -!- lynn has joined. 00:43:09 most of these processes will last much less than 1/10s 00:43:46 at least, they last less than 1/10s when run alone 00:44:35 how does spawning 5000 processes in a second sound? 00:44:50 crazy 00:45:47 -!- heroux has quit (Ping timeout: 264 seconds). 00:47:11 @tell boily squee squee squee waves squee squee holes colliding squee squee energy than the light from all the stars in the observable squee! 00:47:11 Consider it noted. 00:47:38 a misle should be a unit of length... to measure bridges perhaps 00:47:55 what's a misle in meters? 00:47:58 no, the unit is the misletoe hth 00:48:13 izabera: it depends on the isles in question 00:48:48 then again we could have mis(si)le silos 00:48:57 that word has lots of possibilities. 00:49:22 ah a variable lenght 00:49:25 like a cubit 00:49:50 a cubit can't be a length, it should clearly be a volume 00:51:39 hmm, three-dimensional information 00:52:07 maybe the mice would understand that concept 00:53:26 Ah of course there's a wiki about this. http://hitchhikers.wikia.com/wiki/Mice 00:54:14 -!- heroux has joined. 01:00:29 * oerjan puts two and two together and realizes there has to be porn wikis 01:00:42 well more like two and 34 01:01:04 mindblowing 01:01:40 * oerjan is _not_ doing a search 01:03:23 there's always https://www.youtube.com/watch?v=zBDCq6Q8k2E 01:05:46 <\oren\> bernie vs hillary debate in 30 min 01:06:56 <\oren\> wait no 60 min 01:07:03 <\oren\> pre-show in 30 01:07:24 I'll read the summaries tomorrow (technically today) 01:20:29 hold on i just found what's the most unspeakable function name 01:20:33 mbsnrtowcs 01:20:52 I'm mentally spelling thatout apart from the "to", which is a single word 01:20:58 that said, I spell out "mbs" and "wcs" anyway 01:21:01 in all those function names 01:23:31 -!- mihow has quit (Quit: mihow). 01:23:58 ah, r = reentrant I suppose. 01:24:00 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:25:57 reentrant is normally _r 01:26:08 r in the middle typically implies "reverse" but that doesn't seem to make sense in this context 01:27:14 I guess it is meant to mean re-entrant here but the man pages are really unclear 01:27:36 -!- lynn has quit (Ping timeout: 256 seconds). 01:27:54 well, the version without r lacks the mbstate_t *ps argument 01:28:09 (well, without r and n) 01:29:54 izabera: for that function name you'll probably have to pass from czech to georgian hth 01:30:54 do you think the ratio #vowels/#consonants is a good metric for this? 01:33:03 (#vowels+1)/#consonants 01:33:21 ok 01:33:23 why? 01:33:50 or wait 01:34:00 -1 01:34:13 er 01:35:03 thing is, a consonant is easier if it has vowels both before and after 01:35:26 <\oren\> ok, so the pre-show is on, a bunch of people are giving stuttery speeches while trying really herd to be neutral 01:35:36 this isn't working 01:35:39 really herd, check 01:35:43 Just do #consonants in aa row? 01:35:52 a row, even 01:35:54 will try that 01:36:30 consonants in a row, except that the outermost clusters count double. 01:36:32 Reminds me of the word 'västkustskt' "west-coastian" 01:36:37 which is pretty annoying to pronounce 01:36:49 (due to the stskt consonant cluster) 01:36:50 well, define a comparison function 01:37:01 right now i'm checking with (vow1-1)/con1 - (vow2-1)/con2 01:37:09 it doesn't seem to be a good metric though 01:37:25 what're you writing this in 01:37:29 awk 01:37:41 ugh, the one time I wish you were using bash, you aren't 01:37:45 well um 01:37:52 can use bash but it's slower 01:38:37 for what oerjan said, I guess one approach would be "split on vowels, map length, multiply edges by two, take maximum" 01:38:45 for both names 01:38:49 Character trigram models are the conventional way of assigning language likelihoods to strings -- I'd guess using them except looking for the lowest possible scores could work somewhat. 01:38:50 ...possibly overkill 01:39:06 of course not all consonants are equal. s is much easier, thus västkustskt 01:39:30 (Under the assumption that languages favor speakable words.) 01:39:31 sssssseemssssss likely 01:42:20 would it be easier to manually assign values to ngrams? 01:43:16 i mean, i think vätkutkt is actually slightly harder to pronounce than västkustskt 01:43:36 *very* slightly 01:44:11 the final t gets me a bit, it's one step more than norwegian does 01:44:58 -!- tromp_ has quit (Remote host closed the connection). 01:46:21 "User-generated spam detected on http://esolangs.org/" 01:46:22 we drop the -t ending when it gets that complicated, swedish doesn't. 01:46:35 Well, that's a fancy warning, but the page's been deleted for days already. 01:46:52 where do you get that from 01:47:37 It was sent to me after I added esolangs.org as a "property" in the Search Console. 01:47:40 -!- mad has joined. 01:47:50 damn freenode ## thing 01:48:05 `welcome mad 01:48:11 mad: 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 EFnet or DALnet.) 01:48:23 -!- tromp_ has joined. 01:48:24 so laggy it doesn't even look like a bot 01:48:32 heh 01:49:13 can a cpu be efficient if it can only write a single register per cycle 01:49:22 define efficient 01:50:36 *sigh* IE's tab handling has got _worse_ again lately 01:51:12 2-4+ instructions per cycle, enough to saturate the data cache's 1-load-per-cycle limit 01:51:33 it's putting the tabs in random places in the group. and sometimes failing to keep neighboring groups distinct colors 01:52:04 oerjan: sounds self inflicted 01:52:18 * oerjan inflicts a swat on izabera -----### 01:53:07 is ie still developed? 01:53:13 i dunno. 01:53:13 the cpu can do somewhat complex instuctions 01:53:25 i thought all their efforts shifted to the new fancy edge 01:53:32 which cures cancer i heard 01:53:57 stuff like add r0, r1 shr 15 add r2 shr 4 and r28 store r12 01:53:58 oh no, how shall I use all those websites that require "IE 6 or later" then? 01:54:06 (single opcode) 01:54:46 izabera: i tried edge and immediately hated it. then i tried again, and lasted a few hours. 01:54:48 [actual requirement from an internal website we use for entering students' grades *sigh*] 01:57:15 [wiki] [[HaPyLi]] M https://esolangs.org/w/index.php?diff=46395&oldid=40951 * LegionMammal978 * (+13) /* External resources */ 01:58:42 `? anagram 01:58:47 anagram? ¯\(°​_o)/¯ 02:00:13 `le/rn anagram Interestingly, "Robert Galbraith" is *not* an anagram of "J. K. Rowling". 02:00:16 No output. 02:00:48 doesn't _anybody_ remember syntax any more 02:00:56 true. 02:01:00 what syntax? 02:01:07 for `le/rn 02:01:11 `le/rn anagram/Interestingly, "Robert Galbraith" is *not* an anagram of "J. K. Rowling". 02:01:11 ah 02:01:14 Learned «anagram» 02:01:26 but I think it refuses to learn if there's no slash at all 02:01:32 that's not that interesting after all 02:01:35 `` echo wisdom/anagram* 02:01:36 wisdom/anagram 02:01:56 izabera: wisom is always factually accurate, except when it isn't. 02:02:14 `? wisdom 02:02:15 wisdom is always factually accurate, except for this entry, and uh that other one? it started with like, an ø? 02:02:49 uh is that a liar paradox? 02:02:52 And I hate to say that I do actually find that fact interesting. 02:03:13 s/do actually/actually do/ 02:03:48 Maybe because I just learned about the former name. 02:03:52 is wisdom more about truth, or about results in the face of an unscrutable world? 02:04:00 or is wisdom more about attitude? 02:05:23 `tomfoolery wisdom 02:05:24 wisdom is tomfoolery 02:05:35 that doesn't really answer 02:06:11 -!- heroux has quit (Ping timeout: 264 seconds). 02:06:54 `? `? 02:06:55 ​`? ¯\(°​_o)/¯ 02:07:12 `? tomfoolery 02:07:13 mad: re: registers... I thought modern CPUs keep most of the register values in flight, keeping track of them by elaborate renaming and shadowing schemes. so I can imagine that retiring just one of those value to a "cold storage" register file might indeed be enough to saturate the L1 memory bandwidth. 02:07:13 tomfoolery is always factually inaccurate. always. 02:07:25 so i just gave up on doing that in awk 02:08:15 `tomfoolery tomfoolery 02:08:16 tomfoolery is wisdom 02:08:45 and punctuation is dead 02:08:55 * zgrep guiltily holds the knife 02:08:59 dead. 02:09:44 i'm doing it in brainfuck, won't be much harder than awk 02:09:48 stupid awk 02:10:53 mad: Obviously there's a "per cycle" missing in that sentence. 02:11:01 -!- heroux has joined. 02:19:01 int-e : the goal of having a single rename per cycle is to make that register renaming reasier 02:20:04 I guess the speed penalty depends on the kind of code 02:20:08 stuff that goes 02:20:38 val1 += val2; val3 += val4; val5 += val6; val7 += val8; 02:20:45 will obviously suffer a speed penalty 02:21:00 versus a 2-issue RISC 02:22:57 -!- XorSwap has joined. 02:23:21 if the average number of chained alu ops is 2 then this is same speed as 2-issue risc 02:25:19 if the average number of chained alu ops is 8, then you can build a cpu that can take advantage of this but I don't think irl code has chains that long so there's no point (plus you'd probably need a dual port dcache to run anywhere near that speed) 02:27:51 with 2 renames per cycle or more you could probably go for a nice amount of IPC but that's probably a way too large design to do as a small project in a fpga 02:30:50 I guess all of this depends on the type of code your run anyways 02:34:57 -!- jaboja64 has quit (Ping timeout: 240 seconds). 02:45:01 -!- jaboja has joined. 03:04:32 As an exercise for those attempting to design an instruction set, one of the projects is to demonstrate how you construct macros from a subset of instruction 03:05:08 To do this, you must construct a fully-fledged ISA using macros based on IMOV (the left-heavy version), SUBI, and SKIZ (skip-if-zero) 03:08:40 for some reason, I'm designing a video game console named RAX 03:16:09 ooh 03:16:16 2d? 3d? 03:21:40 -!- lleu has quit (Quit: That's what she said). 03:23:11 mad: ? 03:23:18 mad: Ah, not sure yet 03:23:24 It'll probably evolve over time 03:39:48 -!- MDude has changed nick to MDream. 04:00:55 I'm interested in how to design the gfx hw 04:01:16 there are many approaches and I've always wondered if there was some better way 04:01:22 mad: Perhaps there is 04:03:23 there are, roughly speaking, two approaches 04:05:18 frame-buffer based, and rendering line per line (nes/genesis/snes/etc) 04:05:32 * hppavilion[1] nods 04:06:32 mad: What kinds of opcodes do you think would go into an esoteric ALU? 04:06:39 hmmmmmmmm 04:06:43 For research purposes 04:06:50 hmmmmmmmmmmmmmmmm 04:06:53 And practice 04:06:57 that's a hard question 04:07:16 mad: Problem is, there are too many esoteric opcodes already, I guess xD 04:07:34 how about "store to ram except if the value is 0" 04:07:40 ok that's not really ALU 04:07:53 "reverse byte order" 04:07:57 Perhaps that 04:08:46 "r3 = (r2 >> 16) + (r1 << 16)" 04:08:50 mad: I think an esoteric processor would either use a deque model w/ 4 or 8 auxiliary registers (no absolute addressing, you have to roll the deque to get to where you want) or a graph model (as seen in graph VM) 04:08:53 "r3 = (r2 >> 24) + (r1 << 8)" 04:08:55 mad: Basically, yes 04:09:00 Though I think you mean |, not + 04:09:17 Unless you do mean + 0_o 04:09:32 they have the same result 04:09:33 `? somethingthatdoesnotexist 04:09:41 somethingthatdoesnotexist? ¯\(°​_o)/¯ 04:09:47 °​_o 04:09:54 in hw it would be | 04:10:01 What's hw? 04:10:05 homework? 04:10:08 xD 04:11:02 mad: So which do you think makes for a more eso CPU? Graph or deque? 04:11:07 My money's on graph. 04:11:11 hmm 04:11:23 depend on how esoteric you want to be 04:11:29 But deque is more practical, but then again, that isn't the goal 04:11:31 and what goal you're after 04:11:48 mad: The graph has a call stack associated with the pointer... so I guess I could replace that with the deque model 04:12:20 But that makes the call stack (now-deque) too powerful, almost TC on its own... 04:12:25 how about: 04:12:33 -!- XorSwap has quit (Quit: Leaving). 04:13:09 a cpu where the only addressing mode is [address register + small immediate * 4] 04:13:23 with small immediate range being 0..15 or 0..7 04:13:33 mad: Perhaps, but I'm going for something completely foreign 04:13:34 but then you can have opcode 04:13:46 add r0, [a0 + 12] 04:14:19 OK... 04:14:33 except it doesn't actually read from ram since it fills registers with values [a0 + 0] [a0 + 4] [a0 + 8]... [a0 + 60] when setting a0 04:15:27 mad: That's more of a jumbly processor than a truly esoteric processor, IMHO 04:15:44 Just something a bit confusing and irrational to work with, not so much new and unconventional 04:16:06 yeah I guess that's more a speed experiment 04:16:15 More of a Malbolge than a Befunge 04:16:32 "are memory loads so important that caching everything possible could speed up things" 04:16:45 well 04:16:58 to get a truly esoteric cpu you'd need to go without DRAM 04:17:07 if you have DRAM you'll end up with a mips 04:17:38 or if you're really twisted, an itanium or a mills 04:17:41 mad: I think I'll go with the graph xD 04:17:55 It's a digraph with a pointer and a stack 04:18:34 -!- jaboja has quit (Ping timeout: 250 seconds). 04:19:43 mhm 04:31:11 -!- ais523 has quit (Ping timeout: 245 seconds). 04:48:46 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 04:54:00 <\oren\> well, hillary got rekt 04:54:25 <\oren\> at least, according to internet polls 05:00:02 -!- perrier__ has quit (Remote host closed the connection). 05:01:19 -!- perrier_ has joined. 05:10:34 -!- shikhin has quit (Ping timeout: 250 seconds). 05:10:55 -!- Xe has quit (Ping timeout: 240 seconds). 05:12:27 -!- Xe has joined. 05:15:38 -!- shikhin has joined. 05:16:36 -!- vodkode has quit (Remote host closed the connection). 05:30:07 -!- lynn has joined. 06:00:51 <\oren\> wow henry kissinger is an asshole who I had barely heard of until now 06:01:36 oh yeah kissinger is a classic asshole 06:02:34 <\oren\> i bet millions of people my age are reading the wiki article on him 06:03:29 what happened? 06:04:25 <\oren\> Hillary said she took advice from him, and bernie repudiated her pointing out his responsibility for deaths of 100's of thousands in cambodia 06:05:00 <\oren\> "if they put Jews into gas chambers in the Soviet Union, it is not an American concern. Maybe a humanitarian concern." -- Henry Kissinger. WHAT THE FUCK 06:05:09 <\oren\> yeah maybe. 06:05:34 during the vacation (national holiday, oh great) I've crafted the first iteration of GSUB support 06:05:37 in my font 06:05:53 it was freakin hard to design 06:06:21 probably I have to iterate handful times to get things right 06:06:33 <\oren\> nice 06:06:41 yeah I think normally when people talk about kissinger they tread the line of not praise not outright condemnation 06:06:42 I'm yet to check GPOS out though 06:07:00 I do have some infrastructure for automatic mark combination, but it is not yet reflected in the font 06:07:07 <\oren\> I have been procrastinating on my font lately 06:07:10 kindof like chinese talking about mao 06:07:13 \oren\: me too :p 06:07:35 now I have to tackle the Uniscribe rendering problem, again 06:07:40 kissinger was an asshole but he was a powerful asshole 06:08:27 ""Kissinger pressed Nixon to overthrow the democratically elected Allende government because his "'model' effect can be insidious," documents show"" 06:09:11 http://www.thenation.com/article/kissinger-and-pinochet/ 06:27:00 -!- tromp_ has quit (Remote host closed the connection). 06:27:22 -!- singingb1yo has quit (Ping timeout: 256 seconds). 06:38:34 -!- J_Arcane has quit (Ping timeout: 276 seconds). 06:43:34 -!- vodkode has joined. 06:53:31 <\oren\> http://gawker.com/moderator-accidentally-whispers-oh-god-into-mic-when-1758651605 06:58:39 -!- hppavilion[1] has joined. 07:12:52 WTF. you know how linux and gcc and like five other software has had a version number format shift (where the components of the version number now means one place higher than it used to). these disgust me. now it seems that OpenCV has followed suit starting from 3.0. 07:25:23 -!- heroux has quit (Ping timeout: 264 seconds). 07:25:57 -!- heroux has joined. 07:27:36 -!- tromp_ has joined. 07:32:35 -!- tromp_ has quit (Ping timeout: 264 seconds). 07:49:40 Wikipedia lists paper as a form of non-volatile computer memory 07:57:22 -!- AnotherTest has joined. 08:02:41 IMHO, we should flesh out the concept of NOP 08:02:45 For example, NOPIZ 08:02:52 b_jonas: ksh versions are the worst 08:03:03 (Do Nothing n times if register at r is zero) 08:03:04 the current beta is ksh93v- 08:03:12 NOPIZ r n 08:03:48 where 93 means 1993 and v is a version letter and - could be + or a handful other symbols to mean which parts are enabled 08:03:52 hppavilion[1]: so what happens if r is non-zero? nothing? 08:04:06 lifthrasiir: Yes. 08:04:14 lifthrasiir: But that nothing takes less time. 08:04:22 still called after 1993 even if it was released in 2014 08:04:38 So if r is non-zero, then it takes less processor ticks than if r is zero 08:04:44 hppavilion[1]: I believe NOPWNE a b (Do Nothing While a And b Are Not Equal) may be much more useful 08:04:55 aka CHLTNE 08:04:58 lifthrasiir: So WAIT? 08:05:03 possibly. 08:05:35 lifthrasiir: Do you agree that #esoteric should team up to make the ultimate ISA? 08:05:56 I HAVE ONE. DO NOT CONTEST THAT. 08:06:31 (well, I do have a VM ISA design for personal use) 08:06:49 lifthrasiir: Would you like to look over my ELK VM? 08:06:55 Tell me what I did horribly wrong? 08:06:57 what is that? 08:07:06 lifthrasiir: It's just a VM inspired by .NET 08:07:09 Vaguely 08:07:10 I think I did the equally horrible thing in my VM 08:07:30 ("If you give me that apple I'll let you paint this fence") 08:08:25 hppavilion[1]: https://gist.github.com/lifthrasiir/1994b24877b41c8b169e#file-opcodes-txt 08:08:27 lifthrasiir: What's that? 08:08:33 Reading now 08:08:51 that was my design some years ago 08:09:11 I intended to make a bootstrapped language out of them, but my interest dropped 08:10:26 my goal was a usable VM in the small number of LoC (my goal was ~5K) while being reasonably fast 08:10:35 hence the "vectorized" instructions 08:11:05 (I didn't really test if it is useful, but the intent was to leverage compiler's autovectorization) 08:15:32 -!- MoALTz has quit (Ping timeout: 248 seconds). 08:21:20 lifthrasiir: For the console I'm making, I have 3 modes for addresses: integer literal, address reference, indirection. 08:21:38 Since it's determined by a crumb, I have one space left. What should go in it? 08:21:53 I don't like double indirection; it almost seems... tacky 08:22:18 hppavilion[1]: does your ISA have a concept of register? 08:22:26 lifthrasiir: Yes 08:22:36 then should that be a register reference? 08:22:38 That's what it is; register indirection 08:22:42 ah 08:22:56 lifthrasiir: "address reference" means "register reference" 08:23:00 I think it is more commonly called just a register? 08:23:03 uh, wait 08:23:06 -!- mad has quit (Quit: Pics or it didn't happen). 08:23:07 It's a "[register] address" 08:23:33 lifthrasiir: Perhaps that mode should be for accessing from memory? 08:23:35 hppavilion[1]: so... there are three kinds of operands: int, reg[int] and mem[int], right? 08:23:52 lifthrasiir: int, reg[int], and reg[reg[int]] 08:23:56 what. 08:23:57 mem[int] sounds good. 08:24:08 okay, that's where I was confused 08:24:08 lifthrasiir: reg[reg[int]] is for indirection 08:24:18 because reg[int] is just normal 08:24:22 SET is reg[int] = int 08:24:28 MOV is reg[int] = reg[int] 08:24:42 if you don't pursue RISC strictly, mem[int] *can* be useful 08:25:05 So IMOVL is reg[reg[int]] = reg[int], IMOVR is reg[int] = reg[reg[int]], and IMOVB is reg[reg[int]] = reg[reg[int]] 08:25:09 At least, in theory 08:25:14 hppavilion[1]: ah, wait, did you mean mem[reg[int]] when you said reg[reg[int]]? 08:25:31 lifthrasiir: No. 08:25:38 what? 08:25:40 lifthrasiir: I meant reg[reg[int]] 08:25:50 lifthrasiir: That's how you do indirection, AFAICT 08:26:02 uh, normally "indirection" does not mean such thing 08:26:10 Oh, them I'm an idiot 08:26:17 The point is that it's a pointer 08:26:21 mem[reg[int]] is commonly called an indirection and mem[mem[reg[int]]] is called a double indirection AFAIK 08:26:45 so IMOVL x y is the same as y = *x in C 08:26:50 lifthrasiir: Oh 08:27:13 lifthrasiir: So should I get rid of it? It seems like it'd be useful 08:28:37 hppavilion[1]: do you have a concrete example where it is useful? I cannot easily think of them, unless you have tons of registers (some order of 1000s) 08:29:16 lifthrasiir: See, I'm clueless. Until now, I didn't completely realize you didn't have 2**64 registers 08:29:30 lifthrasiir: So that's what I've been designing my VMs to do 08:29:34 (Using a map, of course) 08:30:06 lifthrasiir: But it's useful if you want to store a register address in another register 08:30:39 looool 08:30:55 2**64 registers would result in HUGE cpus 08:31:05 and most of them would be horribly slow 08:31:10 myname: Yes, I realize that now 08:31:34 amd64 has like 15 multi-purpose registers 08:31:36 myname: Of course, in my mind, we didn't REALLY have 2**64; we just had a max of 2**64 08:31:39 Ah 08:31:42 which is plenty for most tasks 08:31:45 See, that makes more sense 08:32:02 there are r8 to r15 08:32:10 myname: I think I've been confusing "register" with "memory address" this whole time 08:32:18 and some special shit that is basically extended from 8 bit onwards 08:32:28 like rax, rbx, rcx, rdx 08:32:52 it's rax, rcx, rdx, rbx. they're not in alphabetical order. 08:33:09 myname: So I take it I should replace regs[regs[int]] with mem[regs[int]]? 08:33:26 yeah 08:33:32 myname: And what should I fill the last slot with? 08:33:33 and not all four of those have been extended from the 8 bit days, some of those are from the 16 bit days 08:33:34 b_jonas: weöö, yeah 08:33:47 at least a has 08:33:54 Perhaps mem[int] would work? 08:33:55 still called after 1993 even if it was released in 2014 <-- https://en.wikipedia.org/wiki/Eternal_September 08:34:11 waaa 08:34:13 it does 08:34:45 the 8 bit days only had the equivalent of al (A), cx and dx (CD and EF in some order), bx (LH), si and di (IX and IY), and sp (SP). it definitely didn't have all four of ax, cx, dx, bx 08:35:13 and even those are only rough equivalence, there's no binary compatibility of any sort 08:35:21 huh, why was a always adressable to 8 bits and c and d aren't? 08:36:13 argh, typo 08:36:25 the 8 bit days only had the equivalent of al (A), cx and dx (BC and DE in some order), bx (LH), si and di (IX and IY), and sp (SP). 08:36:47 assambly <3 08:37:02 myname: Should I make the last addressing mode double indirection then? 08:37:04 myname: basically, the z80 had seven general purpose registers, plus a virtual one: B, C, D, E, L, H, A, [LH] (memory access through LH), not in this order 08:37:26 myname: but it also had some 16 bit instructions on the pairs BC, DE, LH 08:37:53 plus (in the more feature-complete variants of the cpu) two extra 16-bit registers IX and IY which could replace LH in many instructions using a prefix 08:38:21 well, you still have the rax/rcx pair for division for example 08:38:22 also a stack pointer and an 8-bit flags register that is the predecessor of the low half of the x86 flags register 08:38:58 nasm was compiling div 2^n into shr rax, n 08:39:01 lifthrasiir: Should I use double indirection (the real meaning) for the last slot? 08:39:01 myname: division? in the 8-bit era? no way. and rax/rcx was never a pair, only rdx/rax was (rdx being the high one) 08:39:07 which resulted in funny behavior 08:39:22 2^64 / 4 = 0 08:39:30 2^64 mod 4 = 1 08:39:41 yeah 08:39:43 rdx it os 08:40:00 myname: At least it didn't put it in /reg/null 08:40:26 * hppavilion[1] just made a joke that is so bad it doesn't even make any brainfucking sense 08:43:25 the correspondence doesn't really work anyway. the z80 has the full set of arithmetic instructions only on A as the destination, and a very small random selection of 16-bit arithmetic that doesn't use A at all. whereas, the x86_16 has the full set of arithmetic on each of the 8-bit registers AL, AH, CL, CH, DL, DH, BL, BH but some abbreviated ones on AL, and the full-set of 16-bit arithmetic on all eight general registers, but a few short ones on AX 08:43:48 \ whereas, the x86_16 has the full set of arithmetic on each of the 8-bit registers AL, AH, CL, CH, DL, DH, BL, BH but some abbreviated ones on AL, and the full-set of 16-bit arithmetic on all eight general registers, but a few short ones on AX 08:44:25 So it's not really like the x86_16 bx corresponds to the z80 HL completely, but it's still the closest match you can make 08:44:46 hppavilion[1]: it may or may not be useful, probably depending on your intended use cases 08:44:58 -!- oerjan has quit (Quit: Nite). 08:45:08 hppavilion[1]: you may want to poke https://en.wikipedia.org/wiki/Addressing_mode around 08:45:19 lifthrasiir: The choice is between mem[int] and mem[mem[reg[int]]] 08:45:50 mem[int] requires you to have a separate word for the memory address (since memory is typically much larger than register) 08:46:09 if your coding allows such thing easily, it may be a good choice 08:46:12 lifthrasiir: Ah 08:47:45 for example, in x86 you may have reg[int], mem[int] or mem[int * reg[int] + int] 08:48:21 "int"s here can be coded in multiple ways 08:48:31 lifthrasiir: that's a different generation again, that's x86_32 and x86_64 08:48:38 it's not x86_16 08:48:56 x86_16 has a very different set of memory addressing modes 08:49:16 b_jonas: you are right. and I think that it is actually mem[reg[int] + int * reg[int] + int] with different constraints for each ints. I'm a bit simplifying the matter though 08:49:40 oh and x86_64 has rip-relative addressing too 08:50:29 basically [{0, disp8, disp16} + {BX, SI, DI, BP, BX+SI, BX+DI, BP+SI, BP+DI}] except that there's not [0+BP] but instead there's [disp16] and that the modes involving BP have an implicit but overridable SS segment base (the rest are DS-based) 08:51:03 plus stack 16-bit PUSH operations which pre-decrement or post-increment SP 08:51:19 (and are based on SS) 08:51:35 -!- J_Arcane has joined. 08:52:26 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 08:53:11 -!- evalj has joined. 08:55:43 -!- evalj has quit (Remote host closed the connection). 09:07:09 -!- Treio has joined. 09:28:18 -!- tromp_ has joined. 09:32:26 -!- tromp_ has quit (Ping timeout: 240 seconds). 10:13:42 Aw, you can't put a segment override on push/pop. :/ 10:14:05 ("The following default segment selections cannot be overridden: -- Push and pop operations must always reference the SS segment.") 10:25:59 -!- heroux has quit (Ping timeout: 264 seconds). 10:26:32 -!- heroux has joined. 10:29:01 -!- tromp_ has joined. 10:33:24 -!- tromp_ has quit (Ping timeout: 250 seconds). 11:08:52 -!- heroux has quit (Ping timeout: 248 seconds). 11:17:27 -!- heroux has joined. 11:26:28 -!- \oren\ has quit (Ping timeout: 248 seconds). 11:27:17 -!- \oren\ has joined. 11:33:41 -!- J_Arcane has quit (Ping timeout: 276 seconds). 11:36:43 -!- boily has joined. 11:36:51 @massages-loud 11:36:51 oerjan said 10h 49m 40s ago: squee squee squee waves squee squee holes colliding squee squee energy than the light from all the stars in the observable squee! 11:37:09 @tell oerjan LET'S DO THE GRAVITATIONAL WAVE! WOOOOOOOOOOO! 11:37:10 Consider it noted. 11:49:24 -!- heroux has quit (Ping timeout: 248 seconds). 12:02:47 -!- heroux has joined. 12:09:45 @metar CYUL 12:09:46 CYUL 121200Z 25006KT 30SM FEW008 FEW035 FEW080 SCT210 M19/M23 A3012 RMK CF1SC1AC1CI1 CF TR FROIN SLP203 12:19:29 FROIN? 12:19:44 -!- boily has quit (Quit: CLEAR CHICKEN). 12:26:08 I think COMPLEX is sufficiently powerful to simulate any Minsky Machine, and hence is Turing complete 12:26:12 But it's a narrow thing 12:30:15 -!- hppavilion[1] has joined. 12:44:35 -!- heroux has quit (Ping timeout: 240 seconds). 12:47:18 -!- heroux has joined. 13:30:20 -!- tromp_ has joined. 13:34:46 -!- tromp_ has quit (Ping timeout: 252 seconds). 13:41:33 -!- jaboja has joined. 13:51:06 how do you prove that saying whether a brainfuck program never tries to access the left side of the tape is undecidable? 13:52:06 something like program = P< if P never moves the pointer and it halts, that program accesses the left side, if it doesn't halt that program doesn't access it? 13:53:15 izabera: how deep do you want to go down the rabbit hole? you could just simulate a turing machine and start walking to the left indefinitely when it halts, thereby reducing it from the halting problem... 13:53:56 ah so it's P[-]+[<[-]+] 13:53:57 izabera, you can construct a brainfuck program that reads a turing machine off the tape, and goes of the left if and only if the turing machine halts 13:54:56 * izabera was close 14:21:31 -!- j-bot has joined. 14:28:44 -!- jaboja has quit (Ping timeout: 272 seconds). 14:31:45 -!- tromp_ has joined. 14:36:11 -!- tromp_ has quit (Ping timeout: 264 seconds). 14:40:05 -!- jaboja has joined. 14:53:53 -!- heroux has quit (Ping timeout: 276 seconds). 14:57:33 -!- lleu has joined. 14:57:33 -!- lleu has quit (Changing host). 14:57:33 -!- lleu has joined. 15:06:06 -!- heroux has joined. 15:26:37 -!- jdoan105 has joined. 15:26:48 -!- jdoan105 has left. 15:27:06 -!- jaboja has quit (Ping timeout: 240 seconds). 16:08:09 -!- Sprocklem has joined. 16:10:26 -!- Sprocklem_ has quit (Ping timeout: 240 seconds). 16:17:14 -!- spiette has joined. 16:23:41 `genbf 16:23:42 ​>-.>.[-.-]<--,..<[-.,--,<[[.].[+,+<<-,>>,->]]]-,+- 16:23:56 `genbf 70 16:23:58 ​[]<[>+<+<.>,.>>>->>,><<.,[[]].<<.>[<[..++]-].]-+-[[-]-++,,->>].>[<,>]> 16:24:10 -!- heroux has quit (Ping timeout: 252 seconds). 16:24:29 -!- heroux has joined. 16:24:42 and the crowd goes mild 16:33:59 -!- lleu has quit (Read error: Connection reset by peer). 16:34:29 that's not even real bf code 16:34:39 come on, it starts with []< 16:34:49 valid 16:34:54 sorta 16:34:57 well 16:35:14 it falls off the tape at the third step 16:35:28 valid if the tape is unbounded both ways :p 16:35:30 [] is a nop because the current cell is 0 16:37:18 Or wrapping. 16:40:39 i have an idea 16:40:47 generate 1000 valid bf programs 16:40:51 without , 16:41:12 valid just means balanced [ ] 16:41:30 ok then you run these programs 16:41:40 with a timeout of say 1 second 16:42:31 then we take their outputs, and compare them against ABCDEFGH...Z 16:43:06 discard the 500 programs that produced the farthest output from that 16:43:39 then take the rest and make children 16:44:26 ... that's very unusual foreplay 16:44:32 haha 16:44:55 make children by taking two programs and for each character you randomly choose parent1 or parent2 or a random character 16:45:24 with a 90% chance of coming from one of the parents 16:45:48 discard invalid programs, repeat until you have a pool of 1000 programs 16:46:08 then run the new ones, same rules 16:46:25 repeat until one produces that exact string 16:46:51 I know vaguely what genetic programming is. But it was funnier to read it that other way, 16:47:47 bf_textgen works like that, except it breeds a very limited subset of bf programs. 16:47:57 OH COME ON 16:48:01 stop this 16:48:10 every single idea i have is taken 16:48:13 fuck this world 16:48:24 -!- tromp_ has joined. 16:48:24 Well, I mean. It's a very very limited subset. 16:49:05 `` type bf_textgen 16:49:07 bash: line 0: type: bf_textgen: not found 16:49:09 izabera: sorry, that's just how it is. for every original idea there's at least a a thousand that other people have had before. 16:49:21 I forget how to invoke it, it used to be in EgoBot. 16:49:28 found old logs 16:49:32 http://codu.org/logs/_esoteric/2012-08-29.txt 16:49:37 !bf_textgen Hi. 16:49:51 `prefixes 16:49:52 Bot prefixes: fungot ^, HackEgo `, EgoBot !, lambdabot @ or ?, thutubot +, metasepia ~, idris-bot ( , jconn ) , blsqbot ! 16:50:02 https://github.com/graue/esofiles/blob/master/brainfuck/util/textgen.java has the sources, anyway. 16:51:20 @bf ++++[>+<++++]>+[+.] 16:51:20 ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ 16:52:46 -!- tromp_ has quit (Ping timeout: 252 seconds). 16:52:59 -!- heroux has quit (Ping timeout: 264 seconds). 16:53:09 -!- idris-bot has joined. 16:54:08 Very printable. 16:54:18 ^bf ++++[>+<++++]>+[+.] 16:54:18 ABCDEFGHIJKLMNOPQRSTUVWXYZ[\]^_`abcdefghijklmnopqrstuvwxyz{|}~ 16:54:22 Somewhat less so. 16:54:23 -!- MoALTz has joined. 16:54:28 yes, lambdabot filters its output 16:56:05 in any case, how's the genetic programming approach supposed to leap from that local optimum to a program that truncates the output after 26 characters? 16:57:28 ^bf +++++[>+++++<-]++++[>>+<<++++]>+[>++.-<-] 16:57:28 ABCDEFGHIJKLMNOPQRSTUVWXYZ 16:58:49 is that as small as possible? 16:59:01 I wouldn't bet on it 16:59:16 well let me write this thing 16:59:51 for example there is this crazy code for producing 26: >++[[+<]>+>++]<- 17:00:33 (from https://esolangs.org/wiki/Brainfuck_constants) 17:01:31 -!- heroux has joined. 17:01:45 ^bf >++[[+<]>+>++]++++[>+<++++]<-[>>++.-<<-] 17:01:45 ABCDEFGHIJKLMNOPQRSTUVWXYZ 17:05:06 -!- p34k has joined. 17:06:07 -!- zzo38 has joined. 17:07:38 so that bf_textgen thing produces this ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>. 17:07:46 ^bf ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>. 17:07:46 Hello World!. 17:08:01 @bf ++++++++++[>+++++++>++++++++++>+++>+<<<<-]>++.>+.+++++++..+++.>++.<<+++++++++++++++.>.+++.------.--------.>+.>. 17:08:01 Hello World! 17:08:16 then loops forever 17:08:49 ^bf ++++++++[>++++++++>>><<<<-]>+.+.+.+. 17:08:49 ABCD 17:09:09 could be improved though....... 17:09:51 wtf >>><<< like... yes 17:13:58 ^bf +++++++++++++[>++++++++>+++++++++>+++++++++>++++<<<<-]>.>>-..----.>++++++.-----------..<----------.<--.>.-.>-.<<----.+++.>++.>+.<<<-----.--.>-----.+++.<.++++++++.>>.<--.+++++.>>.<<<.+++.+++.>+++.>--.+.<---.>>.+++.--.+.+++++. 17:13:59 http://fsfe.org/campaigns/ilovefs/2016 17:14:34 -!- heroux has quit (Ping timeout: 240 seconds). 17:15:39 ^bf -[+[>+<<]>+]+++++[<+++++>-]<+[>>++.-<-] 17:15:39 B 17:16:05 ^bf -[+[>+<<]>+]<[-]>+++++[<+++++>-]<+[>>++.-<-] 17:16:05 B 17:16:13 ah, stupid. 17:16:17 ^bf -[+[>+<<]>+]+++++[<+++++>-]<+[>>++.-<<-] 17:16:17 BCDEFGHIJKLMNOPQRSTUVWXYZ[ 17:16:29 ^bf -[+[>+<<]>+]+++++[<+++++>-]<+[>>+.<<-] 17:16:29 ABCDEFGHIJKLMNOPQRSTUVWXYZ 17:18:07 * izabera is a noob and loops that move the pointer are too hard 17:18:24 ^bf -[+[>+<<]>+]<+++++[>+++++<-]>+[>+.<-] 17:18:24 ABCDEFGHIJKLMNOPQRSTUVWXYZ 17:18:42 are you writing these yourself or...? 17:18:44 izabera: I copied that imbalanced part from the brainfuck constants page as well 17:19:01 well i'm disappointed >.> 17:19:05 "64: -[+[>+<<]>+]> (13, 4) wrapping" 17:19:43 how do you compute the distance in this case? 17:20:05 like ABCD and ABCE are much closer than ABCD and ABCZ 17:22:00 Anyway, that's 37 characters; I still wouldn't want to bet that there isn't something shorter, but I think I collected the low-hanging fruits. 17:22:15 :) 17:22:22 -!- jaboja has joined. 17:27:42 -!- heroux has joined. 17:28:00 "Just use the hashtag #ilovefs on GnuSocial, Twitter, or other platforms." 17:28:08 OTHER PLATFORMS 17:28:24 the platform-that-shall-not-be-named 17:28:54 myspace? 17:29:05 ah yes that one 17:29:42 I mean is there anything else now that Google+ is pretty much dead :P 17:31:23 (much to my disappointment, one of the webcomics I read is currently not publishing on its wordpress blog but only on that-unnnamable-platform... so I'm missing out now) 17:32:02 -!- Reece` has joined. 17:32:08 what do you need other platforms for? we've got gnu social 17:32:56 fwiw this is actually the first time I heard about GnuSocial, well as far as I remember. 17:33:12 (so I may have heard of it and forgotten... it happens) 17:33:24 you're getting old 17:33:39 that too 17:38:55 -!- Reece` has quit (Quit: Leaving). 17:39:21 -!- Reece` has joined. 17:41:10 -!- heroux has quit (Ping timeout: 252 seconds). 17:41:22 -!- heroux has joined. 17:42:38 http://www.cupidsundierun.com/ and then there's this 17:42:50 which sounds more fun than the fsf event 17:47:22 -!- lynn has quit (Ping timeout: 256 seconds). 17:48:21 `olist 1023 17:48:26 olist 1023: shachaf oerjan Sgeo FireFly boily nortti b_jonas 17:50:38 -!- Reece` has quit (Quit: Leaving). 17:51:15 -!- Reece` has joined. 17:56:35 -!- heroux has quit (Ping timeout: 264 seconds). 18:09:12 -!- heroux has joined. 18:19:06 -!- hppavilion[1] has quit (Ping timeout: 256 seconds). 18:21:11 -!- heroux has quit (Ping timeout: 264 seconds). 18:33:36 -!- heroux has joined. 18:35:07 shachaf: thanks 18:36:25 How do I make a program in Linux to be allow to bind to the specified port number for listening? 18:38:28 zzo38: um, what exactly do you mean? can't you just call bind on the socket? or do you want to bind to a low port number as non-root? 18:38:48 zzo38: if the latter, I suggest an inetd program 18:38:55 that might help anyway, even for non-low ports 18:39:18 I want to do it temporarily though rather than as a daemon program 18:39:36 -!- bb010g has joined. 18:39:43 zzo38: inetd helps there, because it's one process running, and you can make it run your program only when necessary 18:40:06 there are multiple inetd programs with different feature sets, but I think any should work for this 18:40:20 -!- Reece` has quit (Quit: Leaving). 18:40:49 -!- Reece` has joined. 18:41:13 -!- Reece` has quit (Remote host closed the connection). 18:41:15 In my case I am trying to run an existing program that binds to port 25 and do not want to rewrite it. 18:41:22 -!- MDream has changed nick to MDude. 18:41:29 -!- Reece` has joined. 18:42:10 zzo38: um, do you mean you want to change it so it binds to a different port instead? 18:42:13 -!- Reece` has quit (Client Quit). 18:42:19 I don't understand. 18:42:20 No 18:42:29 -!- Reece` has joined. 18:42:35 I want it to listen to port 25 18:42:42 Maybe I can change the router setting temporarily 18:42:51 But what does the program do right now? 18:42:58 Before you change anything, that is? 18:43:40 Listen to port 25 and accepts a single email message and stores it in a file. 18:44:12 If it already listens to port 25, then what's the problem? 18:44:51 It can't; it just displays an error message and quit because it can't listen to port 25 18:45:21 zzo38: so the problem is that you want to bind to a low port as non-root? 18:45:32 I could change the port number and then change the router setting to forward connections to port 25 to a different internal number I suppose though 18:45:34 b_jonas: Yes 18:46:46 Actually I should set up a proper SMTP server, but am not sure how to configure it to do what I wanted it to do 18:47:12 And can you modify the program in some way, eg. (a) instead of binding, make it take an inherited file descriptor that's already bound and listen on it, or (b) instead of binding and listening and accepting, take a file descriptor that's already an accepted socket? 18:47:16 -!- Phantom_Hoover has joined. 18:47:41 What I can do is change the port number 18:47:42 Or possibly the simplest, (c) to bind to a high port instead (and then you forward). 18:48:00 Change the port number then, and forward from a service that you start from inetd maybe? 18:48:13 I could forward from the router I said 18:48:21 The forwarding service needn't run as root since inetd does. 18:48:27 You can do that too, sure. 18:50:18 -!- Reece` has quit (Quit: Leaving). 18:52:23 `` echo 'a[b][c[d[e]f]g[h]i]j' | sed ':a;/]\[/!b;s//][|/;tb;:b;s/|\([^]]*\)\[[^]]*]/|\1/;tb;s/.|[^]]*]//;ta' 18:52:25 a[b]j 18:52:38 removes loops after loops 18:53:26 Do you know though how to set up a proper SMTP server on Linux? I need to use different email addresses externally as internally though 18:54:24 zzo38: I don't know anything about setting up smtp servers, and don't want to either, sorry 18:54:31 you'll have to ask someone else 18:54:43 a system administrator presumably 18:55:15 I am the system administrator 18:55:35 another system administrator then 18:59:28 -!- hppavilion[1] has joined. 19:04:00 -!- Reece` has joined. 19:13:12 -!- gniourf has quit (Read error: Connection reset by peer). 19:13:49 -!- gniourf has joined. 19:15:11 -!- Frooxius has quit (Ping timeout: 264 seconds). 19:16:23 -!- heroux has quit (Ping timeout: 264 seconds). 19:25:13 -!- heroux has joined. 19:26:56 -!- hppavilion[1] has quit (Ping timeout: 240 seconds). 19:28:27 -!- hppavilion[1] has joined. 19:31:43 -!- evalj has joined. 19:43:00 -!- heroux has quit (Ping timeout: 248 seconds). 19:43:52 If I send a message that is not a reply of another message I want it to make up a random number and use that as the reply address, but if it is reply to another message, to use the recipient address of the message being replied to instead 19:44:56 -!- heroux has joined. 19:53:35 -!- heroux has quit (Ping timeout: 264 seconds). 19:53:50 @uptime 19:53:50 uptime: 1m 8d 15m 16s, longest uptime: 1m 10d 23h 44m 29s 20:00:05 -!- Reece_ has joined. 20:01:14 -!- Reece` has quit (Ping timeout: 272 seconds). 20:04:09 -!- heroux has joined. 20:05:18 -!- Reece_ has quit (Quit: Leaving). 20:20:53 -!- prooftechnique has quit (Quit: ZNC http://znc.in). 20:25:25 -!- heroux has quit (Ping timeout: 260 seconds). 20:27:29 -!- heroux has joined. 20:39:19 http://pubs.opengroup.org/onlinepubs/9699919799/utilities/sed.html 20:39:22 "Implementors are encouraged to provide warning messages about labels that are never used" 20:39:35 am i reading it wrong or is that impossible? 20:42:08 impossible via static analysis i mean 20:43:56 i guess sed can print a warning at the end of its execution 20:44:00 izabera: um, I think that's about labels that aren't even mentioned in any g or t command 20:44:05 if by "impossible" you mean "undecidable", sure... 20:44:11 int-e: yes, that 20:44:28 but there are sound approximations that one can reasonably implement, like the one b_jonas described 20:45:29 should this be a warning? blabel1; blabel2; :label2; :label1 20:45:39 or perhaps one should distinguish between labels that are mentioned (one possible interpretation of "use") and ones that can be actually reached (another interpretation). 20:48:11 For any given year N, what is the smallest counting number to not have been specified exactly in a widely availiable public record by the end of that year? 20:48:21 oh right, the goto command is b, not g 20:48:23 sorry 20:49:55 -!- tromp_ has joined. 20:51:29 -!- evalj has quit (Remote host closed the connection). 20:52:37 -!- Elronnd has quit (Quit: Let's jump!). 20:53:44 -!- Elronnd has joined. 20:54:28 -!- tromp_ has quit (Ping timeout: 248 seconds). 20:57:35 -!- lynn_ has joined. 20:57:37 What I want to do is the following: If a message is received for anyone @zzo38computer.org then look up the part before the at sign in a acceptance list, if it is in there then deliver the message to otherwise reject the message. 20:59:11 -!- hppavilion[1] has quit (Ping timeout: 276 seconds). 20:59:54 -!- mihow has joined. 21:00:26 -!- jaboja has quit (Ping timeout: 250 seconds). 21:01:09 This is a bit similar to Q9805 but is more complicated 21:01:36 -!- Frooxius has joined. 21:08:22 -!- heroux has quit (Ping timeout: 272 seconds). 21:08:36 -!- heroux has joined. 21:09:21 -!- LexiciScriptor has joined. 21:20:12 -!- hppavilion[1] has joined. 21:29:09 -!- jaboja has joined. 21:30:32 -!- heroux has quit (Ping timeout: 272 seconds). 21:33:14 -!- heroux has joined. 21:34:55 -!- hppavilion[1] has quit (Ping timeout: 276 seconds). 21:38:24 -!- hppavilion[1] has joined. 21:40:59 -!- spiette has quit (Ping timeout: 264 seconds). 21:49:16 -!- lynn_ has quit (Read error: Connection reset by peer). 21:49:48 -!- lynn_ has joined. 21:53:08 -!- spiette has joined. 22:05:35 -!- hppavilion[1] has quit (Ping timeout: 264 seconds). 22:10:15 -!- Sprocklem has quit (Ping timeout: 240 seconds). 22:12:08 -!- Sprocklem has joined. 22:20:07 -!- lynn_ has changed nick to lynn. 22:29:45 -!- oerjan has joined. 22:30:20 @messages- 22:30:20 boily said 10h 53m 10s ago: LET'S DO THE GRAVITATIONAL WAVE! WOOOOOOOOOOO! 22:30:32 @tell boily WOOOOSQUEE!!! 22:30:33 Consider it noted. 22:30:33 -!- AnotherTest has quit (Ping timeout: 240 seconds). 22:35:46 -!- spiette has quit (Ping timeout: 272 seconds). 22:36:21 -!- tromp_ has joined. 22:38:50 -!- hppavilion[1] has joined. 22:40:35 -!- heroux has quit (Ping timeout: 276 seconds). 22:40:35 -!- tromp_ has quit (Ping timeout: 240 seconds). 22:41:17 -!- heroux has joined. 22:45:08 -!- lynn_ has joined. 22:47:42 -!- lynn has quit (Ping timeout: 256 seconds). 22:50:20 -!- hppavilion[1] has quit (Ping timeout: 272 seconds). 22:52:16 -!- lynn_ has quit (Quit: Leaving). 22:59:14 -!- hppavilion[1] has joined. 23:03:30 -!- lynn has joined. 23:04:37 -!- hppavilion[1] has quit (Ping timeout: 276 seconds). 23:17:17 -!- boily has joined. 23:17:43 hellørjan! 23:18:04 @massages-loud 23:18:04 oerjan said 47m 31s ago: WOOOOSQUEE!!! 23:19:52 @metar CYUL 23:19:52 CYUL 122317Z 16011KT 1 1/2SM -SN OVC011 M07/M09 A2980 RMK SN2SF6 SLP094 23:21:34 bood evenily 23:22:31 -!- Sprocklem_ has joined. 23:25:59 -!- Sprocklem has quit (Ping timeout: 264 seconds). 23:27:28 I think I have now figured it out properly 23:31:25 This is what I did: data = ${if eq{$domain}{zzo38computer.org} {${lookup{$local_part}lsearch{/etc/aliases}{$value}{:fail: No alias}}}{}} in the "system_aliases" block (I commented out the other "data =" line) 23:31:32 I don't know if it is the proper way to do it though 23:35:34 finally thawed. walked home because busses melt away when there's snow. 23:35:45 * boily rants and grumbles 23:36:04 -!- Sprocklem_ has quit (Ping timeout: 248 seconds). 23:37:51 `! bf_txtgen hi izabera 23:38:29 with my luck it's either missing or timing out 23:38:35 99 +++++++++++++++[>+++++++>++++++++>+++++++>++<<<<-]>-.>>.>++.<.<++.>--------.+.<<---.>--------.>-.>. [308] 23:38:38 yay! 23:39:19 -!- p34k has quit. 23:39:40 what are the 99 and 308? 23:40:05 i think 99 is the length 23:40:34 -!- hppavilion[1] has joined. 23:40:36 -!- ais523 has joined. 23:40:39 308 is either running time or generation time, not sure 23:40:48 -!- Sprocklem has joined. 23:41:07 `! bf_txtgen hi izabera 23:41:21 let's reproduce the experiment and check if anything changes... 23:41:26 91 +++++++++++++++[>++++++++>+++++++>++><<<<-]>>-.+.>++.<.<++.>--------.+.+++.<--------.>----. [903] 23:41:30 wat 23:41:34 wut? 23:41:49 there's something wrong there... 23:41:55 `! bf_txtgen hi izabera 23:42:07 boily: you mean the > bf_txtgen just uses a fixed template 23:42:20 his523. ??? 23:42:36 No output. 23:42:48 what the fungot is going on. 23:42:49 boily: madam president, in this parliament. we will be talking about this being an opportunity to express its views soon enough to be able to discuss it in council and there are certain european aspects. take the failed wto negotiations in seattle, because there is relatively little medical research into poverty-related diseases. the solutions are only to be competitive, regulated in such a way as to avoid any cuts in relation 23:43:21 izabera: are you a shapeshifter? is your aura eldritch, and emanating distortions in the brainfuck-space-time-continuum? 23:43:22 boily: a timeout? 23:43:28 boily: it's not deterministic 23:43:41 FirelloFly. that disturbs me. 23:43:53 It uses genetic programming to try to improve the program 23:44:03 damn! Ō_Ō 23:44:28 I forget where its source code is 23:44:43 `ls interps/bf_txtgen 23:44:44 so izabera is a normal human. that's good to know. 23:44:44 CompareIndividuals.class \ Individual.class \ textgen.class \ textgen.java \ textgen.tar.gz 23:44:47 ah 23:45:15 might be, at least 23:45:21 boily: let's not conclude too early 23:45:31 she's in #esoteric, after all. 23:46:20 we're all mad here 23:46:44 I'm sane. 23:46:48 prove it 23:47:04 `? boily 23:47:06 boily is monetizing a broterhood scheme with the Guardian of Lachine, apparently involving cookie dealing. He's also a NaniDispenser, a Trigotillectomic Man Eating Chicken and a METARologist. He is seriously lacking in the f-word department. 23:47:13 ↑ see, I'm sane ^^ 23:47:42 boily: someone's got to be the odd one out 23:48:49 @metar ESSB 23:48:49 ESSB 122320Z AUTO 21006KT 9999 SCT009/// BKN038/// OVC059/// M02/M03 Q0996 23:49:30 `? mad 23:49:31 mad? ¯\(°​_o)/¯ 23:49:39 as a hatter 23:49:47 `le/rn mad/This wisdom entry was censored for being too accurate. 23:49:52 Learned «mad» 23:49:59 that's in fact true hth 23:50:14 `? wisdom 23:50:15 [citation needed] 23:50:15 wisdom is always factually accurate, except for this entry, and uh that other one? it started with like, an ø? 23:50:27 `? ø 23:50:29 ​ø is not going anywhere. 23:50:42 -!- J_Arcane has joined. 23:50:44 `? rjan 23:50:44 rjan? ¯\(°​_o)/¯ 23:50:47 (meanwhile, a guy next door just cried "no... nooo... NOOOOOOOOO!") 23:50:56 boily: mad. I tell you 23:50:59 >FireFly?: we're all mad here <-- especially mad hth 23:51:05 * 23:51:10 FireFly: "I deleted `? mad for being too accurate." -- oerjan 23:51:22 `? mad 23:51:24 This wisdom entry was censored for being too accurate. 23:51:35 oerjan: Put it in `tomfoolery then 23:51:36 oerjan: well then, can't argue with that 23:51:41 oerjan: If you remember what it was 23:52:00 (Unless it was too accurate for wisdom, but not enough for tomfoolery) 23:52:13 `? tomfoolery 23:52:14 tomfoolery is always factually inaccurate. always. 23:52:38 `` grep factually wisdom/* 23:52:44 grep: wisdom/le: Is a directory \ grep: wisdom/¯\(°_o): Is a directory \ grep: wisdom/¯\(°​_o): Is a directory \ Binary file wisdom/reflection matches \ wisdom/tomfoolery:tomfoolery is always factually inaccurate. always. \ wisdom/wisdom:wisdom is always factually accurate, except for this entry, and uh that other one? it started with like, a 23:52:48 FireFly: It's what we created so people can actually figure out what's going on 23:52:52 `tmflry tomfoolery 23:52:53 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: tmflry: cannot execute: Is a directory 23:52:59 `tomfoolery hth 23:53:00 hth means "hope that helps" 23:53:09 FireFly: That right there was the motivation 23:53:12 `tomfoolery tomfoolery 23:53:13 tomfoolery is wisdom 23:53:17 `tomfoolery tdnh 23:53:18 I must confess, I know not of what you are speaking. 23:53:23 FireFly: Not added yet 23:53:33 tdnh 23:53:50 `misle/rn tdnh/"That did not help", used when your hth raises an exception 23:53:53 Was lied to about «tdnh» 23:54:15 oerjan: `? tdnh 23:54:20 Er. 23:54:24 `? tdnh 23:54:25 tdnh does not help 23:54:32 the dogs need hugs 23:54:35 always true 23:54:41 FireFly: As long as it actually explains to the user what it is in an accurate and readable fashion, you can put whatever you want in `tomfoolery 23:54:59 So basically, it's wtf(1) 23:55:12 er wtf(6) 23:55:19 I can put whatever I want in `tomfoolery no matter what. 23:55:36 HackEgo is anarchy, yo 23:55:40 It was created largely because newbies have no clue wtf 90% of what we say means 23:57:03 `mislearn brainfuck is an esoteric programming language created for extreme minimalism- which it accomplishes, with a total of eight (8) zero-argument procedural instructions. It is what introduces many people to esolangs, spawning a vast number of derivatives that we pretty much all despise. http://esolangs.org/wiki/Brainfuck 23:57:06 Was lied to about 'brainfuck': brainfuck is an esoteric programming language created for extreme minimalism- which it accomplishes, with a total of eight (8) zero-argument procedural instructions. It is what introduces many people to esolangs, spawning a vast number of derivatives that we pretty much all despise. http://esolangs.org/wiki/Brainfuck 23:57:11 -!- heroux has quit (Ping timeout: 264 seconds). 23:57:13 `tomfoolery brainfuck 23:57:14 brainfuck is an esoteric programming language created for extreme minimalism- which it accomplishes, with a total of eight (8) zero-argument procedural instructions. It is what introduces many people to esolangs, spawning a vast number of derivatives that we pretty much all despise. http://esolangs.org/wiki/Brainfuck 23:57:26 `wtf 23:57:26 why is like wtf 23:57:42 `wtf is a walrus 23:57:43 why is a walrus is like wtf 23:57:47 -!- heroux has joined. 23:57:56 `wtf(6) 23:57:57 ​/home/hackbot/hackbot.hg/multibot_cmds/lib/limits: line 5: exec: wtf(6): not found 23:58:05 hppavilion[1]: your brainfuck tomfoolery is not entirely true hth 23:58:12 oerjan: How so? 23:58:21 hm 23:58:32 `which wtf 23:58:33 ​/hackenv/bin/wtf 23:58:41 `` ls /usr/bin/wtf 23:58:42 ls: cannot access /usr/bin/wtf: No such file or directory 23:58:44 it slightly misrepresents its reason for creation. 23:58:45 oh, okay 23:58:52 oerjan: Ah, I'll fix it 23:59:10 hppavilion[1]: your package manager might have it 23:59:39 http://netbsd.gw.com/cgi-bin/man-cgi/man?wtf+6+NetBSD-current 23:59:49 `mislearn brainfuck is an esoteric programming language created to make the smallest possible compiler for a Turing-complete language. To do this, it was designed to be extremely minimalistic- which it accomplishes, with a total of eight (8) zero-argument procedural instructions. It is what introduces many people to esolangs, spawning a vast number of derivatives that we pretty much all despise. http://esolangs.org/wiki/Brainfuck 23:59:51 Was lied to about 'brainfuck': brainfuck is an esoteric programming language created to make the smallest possible compiler for a Turing-complete language. To do this, it was designed to be extremely minimalistic- which it accomplishes, with a total of eight (8) zero-argument procedural instructions. It is what introduces many people to esolangs, s