00:02:28 -!- augur has quit (Read error: Connection reset by peer). 00:02:44 -!- ais523 has quit. 00:05:20 -!- conehead has quit (Quit: Computer has gone to sleep.). 00:13:10 -!- shikhin has joined. 00:19:04 -!- Sprocklem has quit (Ping timeout: 264 seconds). 00:21:10 -!- Sgeo has joined. 00:28:47 -!- augur has joined. 00:29:54 -!- Sprocklem has joined. 00:38:49 -!- Bike has quit (Quit: Reconnecting). 00:39:04 -!- Bike has joined. 01:01:47 -!- constant has changed nick to function. 01:13:56 -!- shikhin has quit (Ping timeout: 245 seconds). 01:28:03 function's nick is constantly variable 01:28:17 oerjan: yeap 01:29:12 c.c 01:32:03 cÌˆ.cÌˆ 01:32:11 .Ìˆ 01:57:01 -!- Hyphen-ated has left ("Leaving"). 02:16:34 hyphen-ated, the great pharaoh 02:17:21 -!- conehead has joined. 02:20:21 `run bf -[+>+>+[+<]>+]>-. 02:20:29 bash: ]: No such file or directory 02:20:38 `run bf "-[+>+>+[+<]>+]>-." 02:20:39 bash: bf: command not found 02:20:46 it's !bf 02:20:59 !bf "-[+>+>+[+<]>+]>-" 02:21:05 or, wait 02:21:08 `interp bf -[+>+>+[+<]>+]>-. 02:21:10 â€‹‹ 02:21:11 ah 02:21:15 thank you 02:21:22 whe hell is this? 02:21:32 looks a bit like BOM 02:21:35 !bf should work but EgoBot isn't feeling very well 02:21:37 according to brainfuck constants wiki page, it's 139 02:21:55 but I don't understand it 02:22:19 the main loop ends on a cell which only holds multiple of three 02:22:54 oh, so it stops at 3*256 (it is late okay) 02:24:03 okay, but the second cell is supposed to hold 2/3 of the content of the first cell, so that's 2*256 02:24:19 which is just 0 02:24:54 huh? 02:25:03 i'm fairly surprised it even terminates 02:25:26 well, the first cell is incremented by 3 every round 02:25:46 you are going 3 cells to the right every time 02:25:54 no 02:25:54 and neber go back to them 02:25:58 no? 02:26:01 oh! 02:26:03 clever 02:26:17 the inner loop takes you back to the zeroth cell, which holds a zero 02:26:47 the second cell is incremented by 2 every round, so it should always be 2/3 of the first 02:27:19 and the third cell is always 2 less than the second cell 02:27:59 I really don't see how the result could be 139 02:29:08 -!- nisstyre has quit (Ping timeout: 265 seconds). 02:43:32 -!- nisstyre has joined. 02:50:24 ^bf -[+>+>+[+<]>+]>-. 02:50:24 ‹ 02:50:38 ^ord â€¹ 02:50:38 226 128 185 02:50:56 oh hm 02:51:07 `ord â€¹ 02:51:10 8249 02:51:25 Koen_: ok it's probably 8249 then? 02:51:41 > 8249 `mod` 256 02:51:42 57 02:51:57 * Koen_ is not convinced 02:52:26 i'm not sure how those char encodings get messed up. wait function should only be writing one byte, anyhow. 02:52:38 oh hm it's windows something not latin-1 02:52:57 so probably has another unicode code point 02:53:06 ^chr 139 02:53:06 ‹ 02:53:13 there you go, it _is_ 139. 02:54:15 Koen_: ok more seriously, the bf in the other bots is _not_ 8-bit. 02:54:33 `interp bf8 -[+>+>+[+<]>+]>-. 02:54:35 â€‹‹ 02:54:41 oops 02:54:55 Extended Brainfuck Coded Decimal Interchange Code 02:55:16 * pikhq shudders 02:55:17 maybe it IS a BOM 02:55:50 I still don't understand how this works... 02:55:55 but good night 02:55:58 -!- Koen_ has quit (Quit: Koen_). 02:56:08 oh ic why it's looking strange. HackEgo prepends its usual zero-width space, which is then followed by a _non_utf8 character. therefore the whole mess gets interpreted in latin1/cp1252. 02:56:44 `ord Ã¢ 02:56:47 226 02:57:09 so the Ã¢â‚¬â€¹ is the zero-width space while the â€¹ is the real output. 02:57:31 what's that space for? 02:57:45 preventing botloops. 02:57:52 myname: So bots don't interpret its output. 02:58:18 tricky 02:59:00 so, if one is mean he could write a bot that acts on zero-width space 02:59:12 BTW, friends don't let friends use not-UTF-8. 02:59:28 Equivalently, friends don't let friends use Windows. ;) 03:00:27 indeed 03:02:02 ^bf -[+>+>+[+<]>+]>-. 03:02:02 ‹ 03:02:40 ok after the first loop iteration it's 0 3 2 03:04:18 then 0 6 4 2 03:05:02 then 0 9 6 4 03:06:44 it should always be 0 1,5x x x-2 03:07:00 you will break if 1,5x = 256 03:07:42 that's what koen_ thought, i think. 03:08:26 but it would be 169 then 03:08:27 i don't think using 1,5 is a very good idea. 0 3x 2x 2x-2. 03:09:26 myname: no it would be 255. 03:09:32 did you calculate another iteration? 03:09:38 it happens when x=256. 03:09:38 i mean the result 03:09:43 yeah 03:09:55 at which point 2x should be 17ÃŸ 03:09:58 but i think i know where this thinking breaks. 03:09:59 *170 03:10:15 myname: um you aren't using floating point are you. 03:10:25 that's not how wrapping 8-bit bf works. 03:10:34 you need to calculate mod 256. 03:10:36 huh? 03:10:55 it should happen when 3x = 256 03:11:06 but x is an integer, myname 03:11:12 since 3x is the cell that is pointed at at the end of the loop 03:11:14 so? 03:11:20 it should happen when 3x is a multiple of 256. 03:11:31 well, yes 03:11:35 which first happens when x is 256. 03:11:47 however i know which point we are ignoring. 03:12:12 namely the inner [+<] loop. 03:12:17 i don't get wh it shouldn't happen earlier 03:12:32 ah 03:12:34 nvmd 03:12:43 myname: because x=256 is the smallest integer such that 3x is a multiple of 256. 03:12:54 *positive integer 03:12:59 yes 03:13:23 0 6 4 2 becomes 0 9 6 4 etc. 03:13:35 but now let's _not_ ignore the inner loop. 03:13:48 yes, it gets 255 and after that 2 03:13:57 ah 03:14:04 it breaks there earlier? 03:14:10 i suspect so. 03:14:24 ^bf -[+>+>+[+<]>+]>-. 03:14:25 ‹ 03:15:23 at the entrance to the inner loop it goes as 0 7 5 3, 0 10 7 5 etc. 03:15:56 the inner loop will break if any of _those_ hit a multiple of 256. 03:16:54 ok only the first number has a chance of not being odd, so only that can trigger it. 03:17:10 > 256-10 03:17:11 246 03:17:18 lol. 03:17:19 that's a multiple of 3. 03:17:31 > 246 `divMod` 3 03:17:32 (82,0) 03:17:40 wait 03:17:59 > (0, 10+3*82, 7+2*82, 5+2*82) 03:18:00 (0,256,171,169) 03:18:32 so it breaks the inner loop, adds one to 171 03:18:42 and should use a fifth cell 03:19:00 pretty diabolic 03:19:04 i like it 03:19:31 it gets to the major end of loop with 0 0 173 170 03:20:44 0 0 176 172 2 03:21:21 0 0 178 174 4 03:21:31 it starts again with offsets 03:21:46 surely it should increase 3,2,2 again 03:22:26 it will go up to 256 in the first one again 03:23:14 before inner loop it will start 0 0 174 171 1, 0 0 177 173 3 ... 03:23:18 it should be 0 0 0 213 43 by then 03:23:24 ^bf -[+>+>+[+<]>+]>-. 03:23:24 ‹ 03:24:21 again all but the first are odd before the inner loop 03:25:12 174, 176; 177, 179; 180, 182; 03:25:41 > 256-174 03:25:42 82 03:25:58 > 256-176 03:25:59 80 03:26:17 hm _neither_ the inner nor the outer loop will hit 256. 03:26:25 huh? 03:27:15 > 176+3*27 03:27:16 ah 03:27:19 257 03:27:30 so we need to go on to 512, i guess. 03:27:37 > 512-174 03:27:38 338 03:27:41 > 512-176 03:27:42 336 03:27:56 176, which is the outer loop, hits that. 03:28:09 > 336 `divMod` 3 03:28:10 (112,0) 03:28:35 > (176+3*112, 172+2*112, 2+2*112) 03:28:36 (512,396,226) 03:28:47 there it is 03:28:51 > 396 `mod` 256 03:28:52 140 03:29:14 mystery solved. 03:30:01 i also learned that you cannot do basic math in head ;p 03:30:14 who, me? 03:30:18 yes 03:30:25 i mean, 256 - 10, come on 03:31:08 396 - 256 isn't that hard, either 03:31:22 well of course i could do that, but my brain tires fast these days, so it might have meant that i would simply give up at some later point. 03:32:25 and also asking lambdabot means i don't miss my own stupid mistake. 03:32:42 i know a student who always do mod 5 in ghci 03:33:39 i know a student who only does mod 7 with computers instead of in their head. 03:33:43 that student... is me. 03:33:53 mod 7 is fair 03:34:03 mod 5 is trivial to do 03:34:30 > 111 `mod` 2 03:34:31 1 03:35:02 * oerjan used to be good at mental arithmetic. 03:35:02 it's basically if n[-1] > 5 { n[-1] - 5 } else { n[-1] } 03:35:41 now i cannot concentrate worth a damn 03:37:35 i know that feeling 03:45:29 git rebase -i: a tool assisted speedrun for your code 03:45:58 great, now i want to see the git version of the family feud TAS 03:48:57 the Mystery Hunt had a puzzle called "Git Hub" where they gave you a Git repo and you eventually realize the commit graph has the same shape as the Boston subway system 03:49:05 and then you have to do puzzling things with it 03:49:34 jesus 03:49:39 you need to look at the graph, but nice 04:13:40 * oerjan wonders if this year's nobel prize winner martin karplus is related to esolanger maharba... 04:13:46 same last name 04:20:51 You know how you can't select text which is part of a link in browsers in general? 04:21:08 Because the link just gets dragged instead. 04:21:12 yeah it's awkward 04:30:20 "All people with the surname "Karplus" appear to be descendants of Alexander Karplus, who died in June 1797 and was the first to carry the family name "Karplus". The name was created in response to the 1787 requirement of the Austrian Empire that all Jewish families have surnames. No one knows what the name means (if anything)." 04:30:47 so i guess he's definitely _somewhat_ related 04:31:39 hah 04:31:41 wow 04:37:09 doooooba wabba 04:47:15 -!- Sprocklem has quit (Ping timeout: 252 seconds). 04:56:03 -!- Bike has quit (Ping timeout: 252 seconds). 04:59:05 -!- Bike has joined. 05:02:53 -!- conehead has quit (Quit: Computer has gone to sleep.). 05:13:14 -!- asie has joined. 05:21:13 -!- Bike has quit (Ping timeout: 265 seconds). 05:35:49 -!- Bike has joined. 05:39:40 -!- lexande_ has joined. 05:41:59 hexande_ 05:42:36 so it's come to my attention that "unique" and "exists" also mean "?" and "+" 05:43:11 i mean "?" too 05:43:27 are you suggesting that i'm being bad at communicate 05:47:08 -!- lexande has quit (Quit: leaving). 05:47:14 -!- lexande_ has changed nick to lexande. 05:54:27 http://www.nature.com/nbt/journal/v31/n10/fig_tab/nbt.2706_F1.html "hm, this could be a problem" 05:59:26 "cumulative PhDs awarded" "cumulative faculty positions" "cumulative PhDs employed by Google to improve advertising algorithms" 06:00:21 does google hire many entomologists 06:00:33 monsanto hires those, right 06:00:37 to look for bugs? 06:01:46 for pesticide things, i imagine 06:01:50 Schillebeeckx is a p. good name 06:02:01 i didn't know you were allowed to have ckx right next to eack other like that 06:02:14 drukqs 06:02:37 gaszpackqxho 06:04:43 my impression is that science grad students spend 90% of their time writing MATLAB code regardless of the notional field they're in 06:04:49 this may be inaccurate 06:05:05 benefits of working at google: 1) you don't have to use MATLAB 06:05:07 of course it is, some of them use R 06:05:22 arrrrrrr 06:05:24 @yarr 06:05:24 What be a priate's favourite cheese? 06:05:25 Yarrlsburg! 06:07:32 * oerjan swats lambdabot for misspelling -berg -----### 06:08:07 >_> 06:09:18 oerjan: is that where pirates come from 06:11:54 i thought they were from penzance 06:19:46 kmc: me too 06:22:33 -!- ^v has quit (Read error: Connection reset by peer). 06:23:35 "In the remainder of this document the term User refers to: ____ (Individual name) and the term User's Research Group refers to: ____ (University, Institute or Company name), ____ (Specific department, area, organizational unit), ____ (Geographic site where material will be used)" 06:23:47 I don't know how an individual person would fill this form. 06:25:44 -!- asie has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz...). 06:29:31 -!- FreeFull has quit. 06:45:59 -!- carado has joined. 06:47:20 -!- Taneb has joined. 07:06:19 -!- oerjan has quit (Quit: leaving). 07:36:24 -!- falcorr has joined. 07:38:47 -!- Taneb has quit (Quit: Leaving). 07:41:04 http://1.bp.blogspot.com/-ntgLdXV1etk/UJmmHdKIhvI/AAAAAAAAAII/ZtqzsfTIjXI/s1600/2u58bjo.jpg 07:55:11 -!- falcorr has quit. 07:56:21 -!- mnoqy has joined. 07:56:27 -!- falcorr has joined. 07:57:21 -!- KingOfKarlsruhe has joined. 08:09:09 -!- falcorr_n has joined. 08:09:23 -!- falcorr_n has quit (Client Quit). 08:12:57 -!- carado has quit (Ping timeout: 252 seconds). 08:13:23 -!- Taneb has joined. 08:16:53 -!- falcorr has quit. 08:18:26 -!- falcorr has joined. 08:19:34 -!- stuntaneous has joined. 08:19:35 -!- stuntaneous has quit (Excess Flood). 08:20:14 -!- falcorr has quit (Remote host closed the connection). 08:20:26 "However, some applications require very large amounts of memory. For example, building the models for a large vocabulary continuous speech dictation system might require 150MB or more. Clearly, when memory demands become this large, a proper understanding of the impact of system design decisions on memory usage is important." 08:20:31 150MB or more! 08:20:45 (HTK documentation might be slightly old.) 08:20:48 -!- blurb has joined. 08:21:03 -!- blurb has quit (Remote host closed the connection). 08:33:29 -!- Taneb has quit (Remote host closed the connection). 08:33:37 -!- Taneb has joined. 08:33:49 -!- Taneb has quit (Client Quit). 08:37:55 -!- stuntaneous has joined. 08:37:57 -!- stuntaneous has quit (Excess Flood). 08:39:36 -!- stuntaneous has joined. 08:42:22 -!- stuntaneous has quit (Client Quit). 08:46:52 -!- oerjan has joined. 08:56:52 -!- KingOfKarlsruhe has quit (Ping timeout: 264 seconds). 09:48:10 Heh. If I move (with an IMAP client, on an Exchange server) an (arguably) spam email from the spam folder to INBOX, then after a second or two it automatically goes back to the spam folder. 09:48:35 Other manually moved spam has tended to stay in the inbox; I guess this one is just too spammy. 09:48:58 "X-Spam-Status: HIGH ; 83%" -- well, that is a lot. 09:54:21 -!- oerjan has quit (Quit: Sleep is for the weazzzzzzzzzzzzzzzzzzzz). 10:42:13 -!- Koen_ has joined. 10:44:57 -!- Koen_ has quit (Client Quit). 10:45:16 -!- Koen_ has joined. 11:40:26 -!- myname has quit (Ping timeout: 245 seconds). 11:43:45 -!- yorick has joined. 11:47:42 -!- Sgeo has quit (Read error: Connection reset by peer). 11:59:19 -!- myname has joined. 12:31:33 -!- S1 has joined. 12:47:24 -!- S1 has quit (Quit: Page closed). 13:03:56 -!- Koen_ has quit (Quit: Koen_). 13:07:24 -!- boily has joined. 13:07:32 -!- metasepia has joined. 13:21:59 -!- function has changed nick to trout. 13:32:08 -!- Taneb has joined. 13:33:52 Is there a name for the complement of the empty set? 13:34:09 -!- tromp__ has quit. 13:36:52 -!- tromp has joined. 13:38:09 complement relative to what? 13:38:28 Like, in general 13:39:46 well, set complement is always relative to something. 13:40:26 the complement of the empty set will of course be "that thing" so what you want to call it depends on what you're doing 13:40:45 So I could say the co-empty set relative to something 13:40:49 um 13:40:52 ??? 13:42:05 no matter what set thingy or universe or whatever you're working with (let's call it A), A \setminus \emptyset is just A 13:42:26 Right 13:42:42 Makes sense 13:43:08 say if you're talking about a topological space, the complement of the empty set might be called "the whole space" because it's the whole space. 13:43:14 is there an universal empty set from which you could derive other lesser empty sets? 13:43:25 -!- carado has joined. 13:44:08 -!- MindlessDrone has joined. 13:45:40 What made me ask this is I suddenly realised boolean algebra is kind of like set theory 13:48:19 Shortly after asking the question I realised I could just use the singleton set containing only the empty set 13:48:36 to represent truth? yes 13:48:44 and then complements can be relative to that 13:48:46 and it works out 13:49:17 Yay 13:49:47 Well, I'm going now 13:49:53 Thanks! 13:49:59 -!- Taneb has quit (Quit: AndroIRC - Android IRC Client ( http://www.androirc.com )). 13:57:12 -!- NeroReflex has joined. 14:00:21 i can' t understand if my project could be considered an esoteric IDE 14:00:30 who have time to lost? 14:00:35 and a SVN client? 14:09:21 NeroReflex: two questions: were you already `relcommed, and does your project run on linux? 14:11:06 -!- S1 has joined. 14:12:39 -!- metasepia has quit (Ping timeout: 260 seconds). 14:13:05 -!- metasepia has joined. 14:14:57 boily what is "relcommed" and: the project will be released for linux too but the project is in development and i didn' t developed the main method 14:15:21 `relcome NeroReflex 14:15:22 like that? 14:15:29 â€‹NeroReflex: Welcome to the international hub for esoteric programming language design and deployment! For more information, check out our wiki: http://esolangs.org/wiki/Main_Page. (For the other kind of esoterica, try #esoteric on irc.dal.net.) 14:16:08 i already know about esolang.wiki 14:16:18 what' s the point? 14:16:39 people here like to spam welcomes to anyone they notice is new <.<;; 14:16:52 ah, thanks you 14:17:26 svn://5.231.38.118/svnrepos/Prototype 14:17:40 it's not spam >_>'... 14:17:45 i can' t understand if i am creating an esoteric language or not 14:18:37 i think it is, because no one should use it for professional development, but it is not a joke 14:19:05 i am not sure of what i am creating asd 14:21:11 boily ? 14:21:25 just a moment, checking that out... 14:21:32 ok 14:23:52 eeeeeeeh... I'd say it is both esoteric and not esoteric. 14:24:28 -!- conehead has joined. 14:24:38 it is, because you're emulating an exotic theoretic architecture, and it is not because university students tend to suffer through the same kind of task, namely emulating architectures. 14:25:33 ok xD thanks, so when the project will be completed you will se it on the wiki xD 14:26:58 Si dovrebbe tradurre tutti i vostri commenti in inglese :p 14:27:28 boily where are italian comments? 14:27:41 I found one in targetver.h. 14:28:09 targetver.h is generated by Visual Studio, and i don' t use it xD 14:28:28 so i never saw italian comments 14:28:44 boily, have you got some complex brainfuck program to test? (and also some less complex one) 14:29:52 I'm very bad when it comes to brainfuck... you should ask one of the experts on this channel. 14:30:11 btw, who's the Current Bfjoust Champion? 14:31:09 NeroReflex: talk to either ais523, quintopia, Lymia or Gregor, probably. 14:31:26 oh ok, the fact is that i written a brainfuck interpreter in javascript but i think that the speed is not good :/ 14:31:30 Fiora: how would you rate your Mad Brainfuck Skillz? 14:31:45 javascript is stupid :/ 14:31:55 java is also stupid XD 14:32:42 boily did you write an esoteric programming language? 14:32:54 Java being stupid is a nice thing. you don't have to think about annoying syntactic corner cases, everything is predictable (and verbose, but that's another subject). 14:33:12 -!- S1 has quit (Quit: Page closed). 14:33:13 NeroReflex: I wrote some â†’ http://esolangs.org/wiki/User:Boily 14:34:11 nodes, i am not really good with it 14:34:35 anyway "zucchini" is the same as an italian? 14:35:43 probably. the small dark green long vegetable without much of a taste? 14:35:54 yes 14:35:58 XD 14:40:37 boily: ummmm I've never done anything except a bfjoust program 14:41:05 -!- Taneb has joined. 14:41:07 -!- Taneb has quit (Read error: Connection reset by peer). 14:41:20 -!- Taneb has joined. 14:42:52 @ping 14:42:52 pong 14:49:27 https://torrentfreak.com/riaa-wants-web-browsers-to-block-pirate-sites-and-more-130918/ 14:55:17 I am afraid I am too aware of my positive feedback loop wrt RIAA to comment 14:55:42 -!- bicyclidine has joined. 14:57:04 -!- bicyclidine has quit (Client Quit). 14:58:42 boily can you understand regex algorythms? 15:00:28 -!- Taneb has quit (Ping timeout: 240 seconds). 15:00:30 NeroReflex: perhaps. maybe. possibly. 15:00:55 i have no ideas on how they works 15:02:05 are you talking about DFA and suchlike? 15:02:31 DFA? 15:02:58 i am tolking about this: http://en.wikipedia.org/wiki/Regular_expression 15:04:05 oh, if it's only about using regexpes, then yes, I tend to understand them. 15:04:22 (except that time I wrote a recursive regexp in PHP. that hurt my brain.) 15:04:39 lol 15:05:15 what do you think about an esoteric programming that could sobstitute php? 15:05:16 regexes are often implemented with DFAs, is what boilly is referring to 15:05:37 Bike i don' t know what DFA are 15:05:40 there are already some esoteric languages based on string replacement, like Thue and /// 15:05:45 deterministic finite automata 15:06:16 NeroReflex: http://swtch.com/~rsc/regexp/regexp1.html 15:09:09 -!- shikhin_ has joined. 15:10:51 -!- shikhin_ has changed nick to shikhin. 15:13:05 -!- asie has joined. 15:16:38 -!- shikhin has quit (Read error: No route to host). 15:17:11 -!- shikhin has joined. 15:18:28 boily did you see the BareMetal Project? 15:19:38 someone know about the C++11 to_string() in visual studio 2013? I can' t find it 15:21:03 we only program in ultrahaskell around these parts 15:21:25 -!- asie has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz...). 15:21:41 oh 15:21:55 it's like regular haskell, but no values are instantiated, you have to do everything with the type system. 15:22:08 so you aren' t interested on C++ or assembly? 15:22:59 they are impure. i am only interested in programming languages approved by our father who art in heaven, as represented by the vatican. 15:23:25 * boily shushes Bike with artfully applied Duct Tape 15:23:36 (with respect to Japanese Ã¦sthetics, mind you.) 15:23:39 Bike you are strange 15:23:43 Mmmmf mmrgh rmmmghf grhgh. 15:23:54 ...... 15:23:55 NeroReflex: we are interested in just about everything, except brainfuck derivatives. 15:24:01 * boily untapes Bike 15:24:41 NeroReflex: you haven't talked to elliott yet, haven't you? 15:24:50 -!- asie has joined. 15:25:03 * NeroReflex didn' t talk to elliott 15:26:38 -!- Sprocklem has joined. 15:31:03 -!- metasepia has quit (Ping timeout: 260 seconds). 15:33:25 why does my bot keep dying today? that's unnerving. 15:33:35 -!- metasepia has joined. 15:33:45 [17:24] NeroReflex: we are interested in just about everything, except brainfuck derivatives. lol how many derivatives did you saw during your life? 15:34:09 hundreds 15:34:10 no joke 15:34:33 ~metar LIRF 15:34:34 LIRF 101520Z 22010KT 190V250 9999 SCT025 21/16 Q1011 NOSIG 15:34:40 you don' t simply like it or there is a motivation 15:35:24 they're uncreative. since they're all brainfuck but with different names for the operations. 15:35:50 i understand 15:36:03 it's like taking Don Quixote and renaming everybody except Rozinante and calling it a new novel. 15:36:36 oh, that's not the horses' name. wlel whatever 15:37:22 OH NO I AM STUPID! I DIDN' T USE STACK AND NOW EVERYTHING IS SLOW 15:37:32 oh no 15:37:36 I REALLY AM A CRETIN 15:38:45 how much stupid i am -.-" i used a complex algorithm instead of stack 15:51:49 -!- nooodl has joined. 15:53:39 -!- nooodl_ has joined. 15:53:58 -!- nooodl has quit (Disconnected by services). 15:54:02 -!- nooodl_ has changed nick to nooodl. 15:55:17 -!- ^v has joined. 15:55:32 -!- asie has quit (Quit: My MacBook Pro has gone to sleep. ZZZzzz...). 15:56:53 -!- augur has quit (Remote host closed the connection). 15:59:01 -!- Sprocklem has quit (Ping timeout: 248 seconds). 15:59:45 -!- nycs has quit (Quit: Leaving). 16:06:29 -!- Bike has quit (Ping timeout: 248 seconds). 16:08:36 -!- `^_^v has joined. 16:12:45 -!- mnoqy has quit (Quit: hello). 16:23:19 -!- Phantom_Hoover has joined. 16:23:23 -!- Phantom_Hoover has quit (Changing host). 16:23:24 -!- Phantom_Hoover has joined. 16:33:55 -!- FreeFull has joined. 16:45:27 -!- carado has quit (Remote host closed the connection). 16:51:18 -!- carado has joined. 16:53:27 hello, my name is Alexandre, and I am a fentimanholic. 17:26:42 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 17:34:19 -!- ais523 has joined. 17:34:26 random keyboardian question: where can I get a list of all possible available shifts in X? 17:34:42 (stuff like ctrl, shift, meta, ISO level 5, etc...) 17:36:17 I think someone here knows that 17:37:06 -!- Bike has joined. 17:38:25 -!- Phantom_Hoover has joined. 17:39:55 olsner: but the only other someone here left the chÃ¤nnel. you're all someones over there for me! 17:41:36 -!- augur has joined. 17:43:56 -!- tanino has joined. 17:44:08 -!- tanino has quit (Client Quit). 17:44:40 Why's everyone hating on bf derivatives? :-( 17:45:12 because they're boring and killed archduke ferdinand 17:45:59 impomatic lol 17:46:11 there are good BF derivatives 17:46:14 there are just a lot more bad ones 17:46:57 ais523 17:47:02 yes? 17:47:13 have you got some bf programs to test? 17:47:36 and tell me about the time it takes on my interpreter 17:47:51 I'm not particularly prolific as a BF programmer 17:48:01 I do BF Joust more, which is kind-of different in terms of benchmarking it 17:48:06 bf derivatives are esolangs too! 17:48:27 I invented a new Esolang :-) 17:48:27 Topsy Turvey 17:48:27 < increment the data pointer 17:48:27 > decrement the data pointer 17:48:27 - increment the byte at the data pointer 17:48:28 + decrement the byte at the data pointer 17:48:28 , output the byte at the data pointer 17:48:28 :1:15: parse error on input `data' 17:48:29 . accept one byte of input 17:48:29 ] if the data pointer points to zero, jump to the matching [ 17:48:30 [ if the data pointer points to nonzero, jump to the matching ] 17:48:30 ^ change polarity, switch < with > and - with + 17:48:45 impomatic: apart from ^, I think that's already been invented 17:48:55 Oh? :-( 17:49:02 and it isn't massively interesting in any case 17:49:18 It's got ^ though, so it's a new language! 17:49:27 yes, but I'm not sure that makes it an /interesting/ new language 17:49:29 "a new and boring language" 17:49:56 * impomatic goes away to create a FALSE derivative :-) 17:50:20 I did make /ËˆÃ¦mbiËÉ›f/ , along similar lines 17:50:27 but that's more interesting because it's not obvious whether it's TC or not 17:50:42 whereas yours is just BF with an extra instruction, and one that doesn't make it uncomputable 17:50:48 thus there's no big mystery about the computational class 17:51:53 * boily goes away to create an impomatic derivative :D 17:52:47 Has someone already invented bf with a time traveling instruction pointer? 17:53:06 ais523 a brainfuck intresting mod could be a mod where a "new" type of memory is used, for example a stack 17:53:21 impomatic: I don't think so 17:53:35 NeroReflex: like http://esolangs.org/wiki/BF-PDA? 17:54:20 fungot: do you derivate brains? 17:54:20 boily: you think ( probably so) that you'll get much out of courses until after these two. and not an else in there) 17:54:30 IMO the way to make an interesting BF derivative is to screw with the control flow in a way that means the standard techniques don't work 17:54:38