00:00:31 > [[1..l]>>[1]|l<-[1..]] 00:00:35 [[1],[1,1],[1,1,1],[1,1,1,1],[1,1,1,1,1],[1,1,1,1,1,1],[1,1,1,1,1,1,1],[1,1,... 00:02:21 i guess that isn't actually shorter than map(`replicate`1)[1..] :( 00:02:40 but it's cute and monad-y 00:03:36 > iterate(1:)[1] 00:03:38 [[1],[1,1],[1,1,1],[1,1,1,1],[1,1,1,1,1],[1,1,1,1,1,1],[1,1,1,1,1,1,1],[1,1,... 00:03:42 hth 00:04:30 mmm 00:04:44 nice 00:05:22 > fix$([1]:).(map(1:)) 00:05:23 [[1],[1,1],[1,1,1],[1,1,1,1],[1,1,1,1,1],[1,1,1,1,1,1],[1,1,1,1,1,1,1],[1,1,... 00:05:41 what does fix do 00:06:04 fix f = f (f (f (f (f ...)))) 00:06:26 = f (fix f) 00:06:35 except that with the right amount of laziness, it's constant space 00:06:59 because the inner fix f is the same thunk as the whole 00:07:14 @src fix 00:07:14 fix f = let x = f x in x 00:07:56 @src iterate 00:07:56 iterate f x = x : iterate f (f x) 00:08:52 = fix ((x:) . map f) 00:09:13 wow that will line up for me but like, nobody else, rip 00:09:15 i remember someone asking (SO or reddit) why it wasn't the latter 00:09:41 oh, are there subtle, _|_-related differences 00:09:57 no, it's probably entirely equivalent semantically 00:10:27 what i'm wondering now is why it isn't iterate f x = go x where go x = x : go (f x) 00:10:41 that's like the standard thing 00:10:47 let me check actual ghc source 00:11:07 why should it? 00:12:13 hm nope ghc is the same but it has a build rule 00:13:14 it bothers me that it would be at all better, for whatever reason, to define it that way :( 00:13:28 myname: the go prevents the f from being passed as a parameter again 00:13:36 -!- Wallacoloo has quit (Ping timeout: 264 seconds). 00:13:46 i'm not sure if it _actually_ matters nowadays, but it's traditional 00:14:07 presumably it makes the recursion slightly more efficient 00:15:10 anyway, the build rule for list fusion is more important 00:15:27 -!- bb010g has joined. 00:15:37 means the list might not be allocated at all if consumed efficiently 00:15:38 How can I make virtual spaces enabled in vi only when the ^V command is used? (I didn't even know about that command before yesterday when I pushed it by accident, but it seem like that command would be useful to have a virtual space mode) 00:16:24 #include "stdio.h" 00:16:24 void rep(char *s){while(*s)fputs(s+1,stdout),--*s;putchar(10);} 00:16:24 void rrp(char *s){while(*s)s[1]=*s,rep(s+1),--*s;} 00:16:46 int main(){rrp("\003 *");} 00:17:15 O, there is a "virtualedit" option 00:17:34 zzo38: what do they do? 00:18:31 ^V is rectangular block selection 00:19:06 except that in windows it's ^Q instead, because ^V is paste 00:20:42 and yes, virtualedit is nice, not just for ^V commands but also for some tabular stuff 00:21:12 but i usually only enable it when i want it 00:21:39 since it makes it harder to go to the _actual_ end of line 00:22:30 You can write :set ve=block for only in block selection mode 00:22:40 Which is what I put in 00:24:17 -!- variable has changed nick to constant. 00:30:20 @metar CYQB 00:30:20 CYQB 260000Z 08007KT 20SM FEW055 FEW140 BKN280 20/14 A2995 RMK SC2AC1CI4 AC TR SLP141 DENSITY ALT 800FT 00:50:29 -!- GeekDude has quit (Quit: {{{}}{{{}}{{}}}{{}}} (www.adiirc.com)). 00:56:17 -!- h0rsep0wer has quit (Quit: Leaving). 00:57:34 -!- h0rsep0wer has joined. 00:59:54 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 01:05:04 -!- h0rsep0wer has quit (Quit: Leaving). 01:05:39 -!- h0rsep0wer has joined. 01:16:31 -!- Wallacoloo has joined. 01:16:42 -!- h0rsep0wer has quit (Quit: Leaving). 01:24:22 -!- tromp__ has joined. 01:43:07 this seriously bothers me about ruby: https://bpaste.net/show/76f16b0a9fe8 01:43:38 you seriously have to write a loop, or use a really ugly ".inject{}" syntax, to sum some values 01:44:21 which wouldn't be so bad except, http://ruby-doc.org/core-2.2.2/Array.html#M000413 llllook at all of this nonsense it DOES ship with 01:46:20 oh all that on top of http://ruby-doc.org/core-2.2.2/Enumerable.html of course 01:47:31 oh, it seems you can write [3, 4, 5].reduce(0, :+) now which is a bit better 02:10:14 ruby is not a very well designed language 02:11:43 python is better. perl is worse designed but is more mature and has a better collection of libraries 02:13:06 mauris: What's wrong with inject? 02:13:28 "Doesn't have a built-in sum method" is pretty silly, of all the complaints you could make about Ruby. 02:13:37 nothing. there's nothing wrong with a for loop either! 02:13:51 [3, 4, 5].inject(0, &:+) 02:14:09 Probably slightly nicer than .inject(0, :+) 02:14:19 (1..10).select &:even? 02:14:27 sexu 02:14:29 just saying, if #repeated_permutation exists, you would really expect #sum to exist as well! 02:15:39 rubyists both (a) clearly like "big" interfaces that provide everything you need including the #kitchen_sink, and (b) take sums of things often, because everyone does that 02:16:04 heck, rails even monkey patches it into Enumerable or something bafflingly Ruby-ish like that?? 02:17:38 -!- boily has quit (Quit: SHIFTED CHICKEN). 02:28:18 -!- copumpkin has joined. 02:38:59 -!- rdococ has joined. 02:42:07 Wat the hell do u mean I can't use unary plus on a pointer?!?! 02:43:34 oh, I get it. I forgot one of the plusses in my *++s 02:45:03 wait, you can't use unary plus on a pointer? 02:45:21 congrats on making a no-op that sometimes doesn't work, C standard designers ;-) 02:45:23 apparently not. 02:46:01 unary plus should really mean abs() 02:46:13 then unary minus should be -abs() 02:46:51 no that's unary -+ 02:47:50 or maybe +- jsut to confuse people 02:48:21 i mean - -x already menas different from --x 02:51:07 -!- edwardk has quit. 02:51:18 -!- edwardk has joined. 02:51:41 -~+~-x == x 02:54:34 you can write j++ as ~-(j=-~j) 02:58:31 You can also write NULL as 0xff&0xff00. 03:01:55 I've seen -~ and ~- suggested as "+1" and "-1" operators 03:02:06 (by Raymond Chen, who was uncharacteristically for him trolling) 03:02:16 not sure which way round they are offhand 03:05:04 I think it is OK if you cannot make unary plus on a pointer, in case a null pointer isn't zero on your computer 03:05:43 ais523: I didn't think of that but yes it can work, it look like 03:06:20 It might help in some code-golfs if the precedence is wrong to otherwise write +1 and -1 03:08:20 `! c printf("%d", 1+~+1); 03:08:25 -1 03:09:12 `! c printf("%d", 1-~-1); 03:09:14 1 03:12:29 -!- oerjan has quit (Quit: gudnajt). 03:24:15 huh, "créée" is a word in French? or is that a typo? 03:24:22 that's a lot of vowels to have in a row 03:28:52 not a typo 03:29:05 it means "created" 03:29:14 if it helps, the last e is silent 03:29:25 actually wait 03:29:26 hmm 03:29:30 no I think the last e shouldn't be htere 03:29:32 *there 03:30:00 créée would be feminine 03:30:26 maybe it's just been too long since I'm written French 03:30:45 hmm 03:30:55 apparently you *can* use créée for a feminine object, although it's uncommon 03:32:57 -!- mauris has quit (Ping timeout: 255 seconds). 03:39:54 -!- shikhin has quit (Ping timeout: 272 seconds). 03:40:54 -!- shikhin has joined. 03:56:07 I translated it as "created" from context and because I recognised the route 03:56:12 didn't realise it was a gendered version, though 03:56:14 *the root 03:56:27 and no wonder the final e is dying out 03:58:13 Maybe I'm misreading, but to *me* it looks like "cr??e". 03:58:22 the question marks are e-acutes 03:58:24 both of them 03:58:42 maybe my client sent them in Latin-1 (they're in that charset) rather than UTF-8? 03:58:58 it is set to UTF-8 mode, though 03:59:15 It's gotta be weirder than that, because my client on invalid UTF-8 tries Latin-1. 03:59:33 is this coppro's use of the word or mine that you're checking? 03:59:57 Both are showing as the string "cr??e". 04:00:01 huh 04:00:06 sounds like a misconfiguration to me 04:00:10 Yes, no kidding. 04:00:16 but I can't think of any obvious ones that'd cause that result 04:00:20 especially seeing two ? rather than four 04:00:40 And I've been using this irssi config for ages. 04:00:50 are you in screen? 04:00:50 And accented characters have shown just fine before. 04:00:52 Yes. 04:00:55 usually that's my problem 04:01:00 screen gets misconfigured 04:01:03 Oh, fuck screen. 04:01:04 because it fucking sucks 04:01:34 try ^A:utf8 on 04:01:43 screen gives two potentially broken connections, one from the inside program to screen, one from screen to the outside program 04:01:53 IME the inside one breaks more often 04:02:13 yeah, and it's annoying because ^A:utf8 on doesn't always fix it 04:02:19 The inside one *appears* to currently be UTF-8. 04:02:47 *Aaaaagh*, yep, it's definitely just doing that on all UTF-8. 04:02:51 Fuck you screen, fuck you. 04:03:21 from the description of the problem 04:03:30 I'm guessing it's actually the outside connection that's broken here 04:03:33 and the inside one is working fine 04:03:37 Seems like. 04:03:53 this also means that us sending Latin-1 wouldn't help at all 04:04:10 easy enough to test: cr��e 04:04:15 For extra fun, though, I'm *literally* using "screen -U" to attach to the session. 04:04:22 (that's Latin-1) 04:04:53 ... what the ever loving fuck 04:05:00 HOW DID THAT GET SET IN MY ENVIRONMENT 04:05:04 LANG=C 04:05:05 -!- Wallacoloo has left. 04:05:12 That'd do it. 04:05:17 But what the fuck? 04:05:21 what should it be? C.UTF-8? en_US.UTF-8? 04:05:31 en_US.UTF-8 04:05:41 pikhq: -U is ignored when attaching 04:05:45 * ski . o O ( `^A:utf8 on on' ) 04:05:47 I have a French locale installed for debugging locale-related problems 04:06:04 pikhq: it got set because screen fucking sucks 04:06:30 Nonono. *Outside of screen* LANG=C. 04:06:34 screen is a constant source of aggravation to me in NH4 04:06:36 (ipbt is worse, though) 04:06:41 hi pikhq 04:06:44 the problem with ipbt is that it can decode codes that it can't render 04:06:44 How's Mountain View? 04:06:48 thus it fails to fall back gracefully 04:06:52 shachaf: Mostly good. 04:06:58 Or are you in Milpitas? 04:07:00 is there a good view of the mountain? 04:07:06 I'm in north San Jose ATM. 04:07:06 or is it misleadingly named? 04:07:12 Adjacent to Milpitas. 04:07:26 ais523: There is a decent view of adjoining mountains. 04:09:31 pikhq: ohhh 04:10:07 * pikhq flips off Debian 04:10:08 -!- Wright has quit (Read error: Connection reset by peer). 04:10:14 This is mysterious. 04:10:25 -!- Wright has joined. 04:10:36 pikhq: where is your locale set? 04:10:43 normally it'd be in .bashrc or the like 04:10:48 maybe it isn't being set anywhere and is defaulting to C 04:11:01 I have no idea where it's getting set, it previously was getting set to en_US.UTF-8. 04:11:16 Also, it's not *defaulting to C*. In that case LANG would be unset. 04:11:23 hmm 04:11:25 It is *being explicitly set to C*. 04:11:42 it could be set in some process a long way up the tree (probably not init, but…), and never being unset 04:11:56 I would laugh so much if it were systemd 04:12:05 -!- Herbalist has joined. 04:12:26 -!- Herbalist has left. 04:12:30 first thought upon seeing the username: "herbs in ADOM would be Turing-complete, if it had infinitely large levels, and were designed specifically to do that" 04:12:50 Obvious easy solution is a big hammer: add LANG=en_US.UTF-8 to .profile 04:13:04 another possibility: was in the wrong #esoteric and noticed upon seeing the join method 04:13:12 pikhq: that's not only easy, it's also arguably correct 04:14:19 Yep. 04:14:49 In general, locale is a per-user configuration setting, after all. 04:16:17 That at least answers most of my questions. 04:21:46 -!- copumpkin has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz…). 04:24:14 -!- Wallacoloo has joined. 04:25:39 I have utf-8 characters in my screen statuslien 04:25:50 it never seems to mess up 04:26:23 ASUS Broken 時 Jul 26 Sun 00:26 窓 0 bash 1 bash 2* bash 04:26:36 -!- Wallacoloo has quit (Remote host closed the connection). 04:27:01 -!- Wallacoloo has joined. 04:27:07 -!- Wallacoloo has quit (Remote host closed the connection). 04:27:12 orenwatson.be 時 Jul 26 Sun 04:27 窓 0* bash 04:27:44 that's the inner screen on orenwatson.be 04:27:45 -!- Wallacoloo has joined. 04:27:47 -!- Wallacoloo has quit (Remote host closed the connection). 04:49:04 -!- MDude has changed nick to MDream. 05:10:24 -!- tromp__ has quit (Remote host closed the connection). 05:33:02 -!- Wallacoloo has joined. 05:37:30 -!- Wallacoloo has quit (Remote host closed the connection). 05:37:54 -!- Wallacoloo has joined. 05:41:22 -!- Wallacoloo has quit (Client Quit). 05:43:26 -!- Wallacoloo has joined. 05:43:48 -!- Wallacoloo has quit (Remote host closed the connection). 05:44:10 -!- Wallacoloo has joined. 05:51:25 -!- Wallacoloo has quit (Quit: Leaving.). 05:53:14 -!- Wallacoloo has joined. 05:53:29 -!- Wallacoloo has quit (Remote host closed the connection). 05:53:53 -!- Wallacoloo has joined. 05:56:29 -!- mbrcknl has quit (Ping timeout: 256 seconds). 06:00:09 -!- mbrcknl has joined. 06:00:42 -!- Wallacoloo has quit (Remote host closed the connection). 06:01:13 -!- Wallacoloo has joined. 06:07:55 -!- Wallacoloo has quit (Remote host closed the connection). 06:08:35 -!- Wallacoloo has joined. 06:08:58 Wallacoloo: your connection problems are spamming the channel 06:10:03 Oh shoot. Sorry ais523. I'm troubleshooting driver issues with steam on Linux & my IRC client is configured to autoconnect whenever my desktop starts. 06:10:15 I'll disable that for now xD 06:10:18 I thought you probably didn't know, which is why I let you know 06:10:23 no problem 06:10:56 -!- tromp__ has joined. 06:11:55 -!- Wallacoloo has left. 06:15:10 -!- tromp__ has quit (Ping timeout: 240 seconds). 06:24:21 -!- Walpurgisnacht has joined. 06:25:31 -!- cryptography has joined. 06:25:54 -!- cryptography has quit (Client Quit). 06:26:26 -!- hppavilion[1] has joined. 06:28:11 Are esoteric algorithms allowed on Esolangs? 06:28:48 Do you have the example? 06:29:13 Like dropsort 06:29:30 Basically, go through the list, and drop any item that comes after something it should come before 06:29:46 It ALWAYS produces a correctly-sorted list, though it's a lossy algorithm 06:29:56 It works in O(n-1) I believe 06:30:02 can do better: return the first element 06:30:06 O(1) 06:30:25 Or maybe it's O(n+1) 06:30:34 Or something 06:30:43 Depends what you are trying to do clearly, if it is better or not 06:30:47 That's just an index extraction 06:30:54 Doesn't count if it's constant length 06:30:57 I can do even better 06:30:59 Return 0 06:31:00 hppavilion[1]: it's O(n) in both cases 06:31:01 O(n) = O(n-1) = O(n+1) 06:31:02 Or [0] 06:31:08 Really? 06:31:10 Weird 06:31:10 because you're confused about how big-O notation works 06:31:15 it's asymptotic 06:31:16 I am 06:31:19 as n gets larger, it dwarfs the 1 06:31:25 I've never understood it 06:31:36 how is it weird 06:31:49 2*n > n+1 for every n 06:31:55 hppavilion[1]: basically you omit all details that become irrelevant as n gets larger 06:32:01 Ah. 06:32:03 Weird 06:32:07 so there clearly is a constant to make n an upper bound of n+1 06:32:14 But one could argue that returning [0] is even MORE efficient 06:32:22 i.e. the proportion of the whole thing they are tends to zero 06:32:22 Than returning the first element that is 06:32:34 hppavilion[1]: depending on your architecture 06:32:39 It does 06:32:42 But as a rule 06:32:44 also, you ignore any effects that would simply multiply by a constant, or anything bounded by a constant 06:32:48 Literals are more efficient 06:33:06 But back to the original question 06:33:13 so O(2*n**2 + n) = O(2*n**2) (n is dwarfed) = O(n**2) (ignore multiplication by a constant) 06:33:19 Are Esoteric Algorithms allowed on Esolangs? 06:33:21 the fastest you can get is O(1) 06:33:23 Or is it language-only 06:33:25 I don't think dropsort would be 06:33:31 basically because it isn't very interesting 06:33:40 maybe something along those lines could be 06:33:41 Well yeah 06:33:45 ais523: well, the fastest is o(1) :p 06:33:46 especially if you made it into an esolang somehow 06:33:55 I'm talking about esoteric algorithms in general 06:33:59 Oh yes 06:34:01 myname: does that even make sense? :-P 06:34:13 It would be well-encouraged to make an Esoalg in an Esolang 06:34:27 ais523: 1/n is in o(1), i don't know an algorithm with that runtime, though 06:34:29 I think I have seen the esoteric list of sorting algorithm 06:34:33 But do you think I'd get in trouble if I created a page for an Esoteric Algorithm? 06:34:43 ais523: Parts of algorithms can be faster than O(1) time. 06:34:44 myname: that implies it gets faster the more work it has to do 06:34:55 yes 06:34:58 E.g. O(1/n) for part of an amortized thing. 06:35:08 But of course you end up with O(1+1/n) overall, which is just O(1). 06:35:21 yeah 06:35:29 But what triggered this: 06:35:31 normal approach on randomized algorithms 06:35:32 Esoteric 06:35:37 Cryptological 06:35:38 Systems 06:35:50 I created the #esocrypt IRC on here 06:35:55 Anyone who wants to join can 06:35:57 They aren't actually useful for sorting but some may have other uses in the proper program, whether it is Drop Sort or Intelligent Design Sort or whatever 06:36:03 (n log n)/n^2 is in o(1) and exists in amortized problems 06:36:21 zzo38: Intelligent Design Sort is where you return the list itself, and require someone else to have laready ordered it 06:36:29 ./join #esocrypt 06:36:37 ais523: Yes, you assume it is already in the optimial order, I know 06:37:02 we had a "efficient c programming" course here 06:37:02 oh, that was meant to be a question 06:37:08 but I forgot the question mark 06:37:23 i always thought we should make "unefficient assembly programming" as a contest 06:37:35 It might be used in cases where it is too difficult/complicated to figure out the proper algorithm to make the optimal order for whatever it is, such as if an ordinary sort doesn't work for some reason 06:37:53 myname: that still looks reasonable? 06:38:07 solve a problem as slow as possible so that you cannot drop any part of the code to make it faster and still solve the problem 06:38:10 or that can be arbitrarily stupid? 06:38:42 I mean, something like stoogesort or bogosort can't be meaningfully simplified and yet is very slow compared to other algorithms 06:38:47 (stoogesort is hilarious) 06:39:00 like bogosort cannot be made faster by dropping stuff, but quicksort where you multiply your input and divide it again can 06:39:13 hppavilion[1]: What idea you have of esoteric cryptological systems? 06:39:19 None yet 06:39:23 OK 06:39:24 That's what I made the IRC for :P 06:39:42 e.g. we have to make a brainfuck interpreter in assembly 06:40:00 and i had students that wrote binary search for the command to execute 06:40:28 that way they always have 4 comparisons and jumps for every command instead of a maximum of 8 06:40:45 Just post on here when you have some, or a section in your userpage; this channel is logged too 06:40:58 myname: how does that compare performance-wise to a jump table? 06:41:05 I'm never sure whether jump tables are really fast or really slow in asm 06:41:16 did any of your students do RLE? 06:41:18 they may be the fastest 06:41:38 the thing is, binary search is pretty useless on real brainfuck code 06:42:04 i would check in the order of how common they are in larger code 06:42:27 like + and > are way more often used than , in a typical.bf programm 06:42:50 Jump table probably does work more fast. But, in what computer is this assembly language of? 06:43:18 we wrote 64 bit nasm 06:43:35 other than that, nothing specifically 06:44:14 zzo38: jump tables can ruin branch prediction 06:44:46 [wiki] [[Esolang:Community portal]] http://esolangs.org/w/index.php?diff=43589&oldid=43202 * Hppavilion1 * (+430) Added a link to my #esocrypt IRC channel. Please don't hurt me, I just want people to know it exists, and it's more-or-less relevant. 06:44:55 Yes, if you are using a computer with hardware branch prediction 06:44:55 Please don't hurt me 06:45:10 I suppose x86 probably does 06:45:15 baby don't hurt me 06:45:16 But I program in 6502 assembly language myself 06:46:41 Which is a more sensible system; I don't like hardware branch prediction it should be made in software. 06:47:31 I need help with IRC :/ 06:47:42 What help you need? 06:47:45 zzo38: well branch hinting is done by arranging code so that the branch being taken is the likely path, and the branch not being taken is the unlikely path 06:47:53 How do I set up my channel such that other people can't gain control over it by using my username? 06:48:09 hppavilion[1]: Use the CS command; see CS HELP for details 06:48:15 You also need NS 06:48:20 hppavilion[1]: first you need to register with NickServ 06:48:32 do "/msg nickserv help" for info, which many clients can abbreviate "/ns help" 06:48:33 Try the "NS HELP" command for details about how to register 06:48:51 then you register the channel with ChanServ "/msg chanserv help" or "/cs help" for info 06:49:07 the NS and CS shortcuts were possibly designed for zzo38 ;-) 06:49:34 ais523: how about featuring funciton? :p 06:49:41 myname: needs a blurb 06:49:45 to put on the main page 06:49:58 having to write those is the main reason we rarely get new featured languages 06:52:45 OK 06:52:51 So I registered with nickserv 06:53:13 hppavilion[1]; Now you would need chanserv also, then. 06:53:16 OK 06:53:34 And I would do /msg chanserv register 06:53:36 for that/ 06:53:41 *that? 06:53:57 Look at the help files first 06:54:42 In 6502 codes to make a jump table I generally will make two tables, one with the high byte of one less than the address to jump to, and one with the low byte of one less than the address to jump to; I use macro to do this. Many people though seem not doing it like this 06:55:40 OK 06:55:45 I registered with Chanserv 06:55:56 Is that all I need do to keep secure? 06:55:59 I'm going to guess no 06:56:18 you need to remember your password 06:56:39 Well I remember that 06:56:41 and no, at this point (so long as you use the channel often enough that it doesn't get dropped), you have control of the channel and can stop unauthorized uses 06:56:55 although they won't stop automatically 06:56:58 It's my kind-of-secure but not-too-secure password 06:57:00 you actually have to turn up to stop them 06:57:41 -!- Patashu has quit (Ping timeout: 256 seconds). 06:57:43 OK 06:58:58 Now I just need someone to join :P 07:00:36 Maybe we should establish a new Mailing list 07:00:49 I've never been involved in a mailing list that I was actually interested in.. 07:00:50 . 07:02:39 advice of a friend of mine: do not subscribe to lkml unless you know you either delete regularly or have a client that can handle deleting of huge amount of mails 07:04:06 Is malbolge turing complete? 07:04:39 I think that's unknown 07:04:45 s/unknown/classified 07:05:16 just write a bf interpreter in it :p 07:05:22 Yeah 07:05:26 THAT'S possible 07:06:33 Ill just ask the creator 07:07:24 Yeah 07:07:30 THAT'S possible 07:08:42 Walpurgisnacht: Malbolge itself isn't TC 07:08:45 because of finite memory 07:08:55 there's a variant Malbolge-T that might be, but hasn't been proven to do so 07:09:20 Malbolge seems to be able to handle arbitrary control flow and arbitrary action at an arbitrary point, so it's just the data storage that's the problem 07:10:03 Can I make a variant of malbolge that has a large finite memory 07:10:11 is it plausible? 07:10:22 you could just increase the number of trits beyond 10 07:10:27 You know what? 07:10:40 I'm starting my own Esoteric Programming Shit mailing list 07:10:54 It'll probably be completely uninteresting :P 07:11:01 But why not start it? 07:11:49 Yes I could do that too 07:12:15 -!- atslash has joined. 07:12:46 Anyone who wants to join email esolangsmailinglist@gmail.com and tell me 07:14:07 how welcome is it to extend somebody elses language? should i make a fork or a section in the article with my idea? 07:14:54 Well 07:15:05 I'm not sure you're supposed to edit the article itself 07:15:12 I would make my own article 07:18:31 It might depend, what languages are you intend to extend? Malbolge, or others, or what? 07:18:44 rail 07:18:47 I would say no matter what, make your own article 07:19:06 So does anybody want to join the mailing list? 07:20:28 Does anyone know what the limes are all about? 07:20:59 they are tasty 07:21:25 No really 07:21:31 Thats the logo 07:21:43 Lime is a language I think 07:21:57 Limes make 99 bottles of beer taste better 07:22:53 replacing it with anything else makes beer taste better :p 07:23:53 Replace the entire beer with lime 07:25:30 (such as in case you do not want to get drunk from too much beer) 07:25:43 (and 99 is probably too much beer) 07:27:10 So no one wants to join the mailing list either? 07:28:07 Well, I suppose nobody does at this time anyways 07:28:14 OK :/ 07:29:30 Its ok hppavillion[1] 07:29:43 But anyone who does later can write the message to you isn't it? 07:29:52 I know 07:29:54 It's fine 07:31:35 -!- hppavilion[1] has quit (Quit: Page closed). 07:32:01 -!- hppavilion[1] has joined. 07:38:15 I'm-a-back 07:42:47 -!- Walpurgisnacht has quit (Quit: Fuck me). 07:42:51 awesome. i have a back 07:45:27 Do you know what SQLite extensions Mozilla defines (if any)? 07:51:00 -!- zzo38 has quit (Quit: zzo38). 07:53:20 -!- AnotherTest has joined. 08:00:34 -!- tromp__ has joined. 08:01:14 -!- ais523 has quit. 08:05:02 -!- tromp__ has quit (Ping timeout: 250 seconds). 08:11:23 -!- tromp__ has joined. 08:15:43 -!- tromp__ has quit (Ping timeout: 244 seconds). 08:30:45 -!- hppavilion[1] has quit (Ping timeout: 246 seconds). 09:27:55 [wiki] [[Brainfuck constants]] http://esolangs.org/w/index.php?diff=43590&oldid=40285 * Rdebath * (+402) Checked all 0-255 for wrapping, LH cells, value in current cells and general formatting. 09:40:48 -!- Frooxius has joined. 10:00:40 -!- lleu has quit (Ping timeout: 244 seconds). 10:07:54 -!- rdococ has quit (Read error: Connection reset by peer). 10:09:37 -!- Phantom_Hoover has joined. 10:10:52 -!- Patashu has joined. 10:11:17 -!- rdococ has joined. 10:20:54