00:07:48 -!- Pthing has quit (Remote closed the connection). 00:14:14 -!- FireFly has quit ("Later"). 00:16:13 Flot;;; 00:21:04 -!- Batmanifestdesti has joined. 00:21:45 * Batmanifestdesti made a program in Piet that prints "Hi!" :D 00:24:28 -!- BeholdMyGlory has quit (Remote closed the connection). 00:33:32 -!- oklokok has quit (Read error: 110 (Connection timed out)). 00:35:45 Man, this place is hppin' tonight 00:35:51 hoppin'* 00:36:09 totally 00:36:27 oh yeah, I got the go-ahead to make Piet forums! 00:36:28 :D 00:36:33 piet.forumotion.com 00:36:43 Piet forums. 00:36:49 yup 00:36:52 You really are a LOLCoder at heart. 00:36:56 That's the dumbest idea I've heard today. 00:36:58 And I hear a lot of dumb ideas. 00:37:01 how's that? 00:37:15 it's a lot like photobucket, only the pictures are programs! :D 00:37:40 (a) forums suck, (b) the potential userbase is about 3 people, (c) "general discussion"? fuckin' serious? why does everything have a useless forum? (d) that analogy is as bad as xkcd's tvtropes/rickrolling one. 00:37:45 Get off my lawn. Damn kids. 00:38:04 Oops, I just broke your rule #1. 00:38:08 how do forums suck, and chats not? 00:38:11 (Either once or twice depending on how you define swearing...) 00:38:42 Batmanifestdesti: they rarely conduct information and are mostly vents for useless crap. ok, so is IRC, but it's realtime, where such crap is expected 00:39:23 11. No demeaning other ideas/beliefs/religions: If you're a televangelist that wants everyone to be saved, then that's jolly for you, but don't go around telling people that they're going to burn in the fiery pits just because that are a Muslim, or Australian, or something else. This rule is related to flaming. Please don't confuse this with "don't post about anything related to your religion or lack thereof," because sometimes these conversations can be 00:39:25 fun and enlightening, all that this means is that if John or Jane Doe mentions that they're Mormon, don't send angry posts demanding to know why they joined that "devil church." 00:39:29 i can totally see people evangelizing on forums about Piet. 00:39:30 totally 00:39:45 it happens everywherew 00:39:46 [if I'm offending you, take comfort in the fact that I'm the grumpiest person in here.] 00:40:13 on a forum about DOOM modding, a guy demanded to know why mormons, muslims, and buddhists existed 00:40:39 ... 00:40:54 Because God made them in his image! 00:40:59 -!- upyr[emacs] has quit (Remote closed the connection). 00:41:03 God has some serious cognitive dissonance goin' on. 00:41:10 which just goes to show you that religious or ideological discrimination happens everywhere 00:41:35 What about me? I wantonly bash every religious ideology that exists. 00:41:39 Is it okay if I'm fair and balanced? 00:41:41 no, not that 00:41:49 I was referencing the doom thing 00:41:50 I feel rejected. 00:41:56 I know. 00:42:00 I wasn't replying. 00:42:04 oh 01:12:13 did you know that there's a channel for sudoku? XD 01:12:20 it's empty right now 01:12:54 Good. 01:12:57 It deserves to be. 01:13:05 lol 02:34:44 -!- dbc has quit (Client Quit). 02:37:38 -!- dbc has joined. 02:37:46 hi! 03:00:31 -!- upyr[emacs] has joined. 03:00:36 hi! 03:08:38 hi 03:09:31 -!- sgeo has changed nick to Sgeo. 03:19:02 -!- upyr[emacs] has quit (Remote closed the connection). 04:11:07 -!- augur has quit (Read error: 104 (Connection reset by peer)). 04:35:58 -!- augur has joined. 04:47:40 hi augur 04:47:49 hello Batmanifestdesti 05:06:23 -!- pikhq has joined. 05:08:13 -!- pikhq has quit (Client Quit). 05:08:51 -!- pikhq has joined. 05:19:27 hi again 05:28:02 * Batmanifestdesti is talking to a french person 05:29:07 Is it me? 05:29:44 depends on if you're on omegle 05:30:00 No. 05:30:07 oh, ok 05:32:53 * Sgeo tried Omegle once 05:32:58 Wish there was a way to get back in touch 05:33:04 it's being overrun by bots right now 05:33:06 I don't like losing touch with people, ever 05:33:09 Batmanifestdesti, o.O 05:33:31 almost every time I get on, I get bombarded by porn ads 06:25:05 aww 06:32:26 i once tried copy and pasting one omegle conversation to another, as some sort of omegle eavesdropping thing 06:32:39 took them about 3 minutes to start cybering 06:49:40 AnMaster: Yes, y=0 is indeed unreasonable; I think it should work (at least) for any x >= 0, y >= 1. Though you get overflowy problems if that (x+y-1) happens to be over your max-value, which won't happen for the divide-modulo-if thing. 06:55:24 -!- coppro has quit ("The only thing I know is that I know nothing"). 06:55:29 -!- CESSMASTER has quit ("Computer has gone to sleep"). 06:56:04 -!- CESSMASTER has joined. 07:00:10 -!- Sgeo has quit (Remote closed the connection). 07:04:53 -!- coppro has joined. 07:04:59 hi! 07:24:04 Hi 07:24:04 -!- augur has quit (Read error: 104 (Connection reset by peer)). 07:34:59 -!- augur has joined. 07:40:10 fizziew, overflow may be a real issue here. 07:40:23 so I'm sticking to the variant I decided on. 07:43:03 Hmm, Omegle. 07:43:40 Omegle is full of lulz 07:44:34 bbl 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:05:26 -!- Batmanifestdesti has left (?). 08:29:06 -!- MigoMipo has joined. 08:51:59 -!- augur has quit (Remote closed the connection). 09:03:52 -!- FireFly has joined. 09:05:10 Well, that was fun. 09:06:06 Went on Omegle. The first guy I met was a Jewish guy in Israel; he told me about his experiences in the army and stuff like that. 09:06:16 It appears that we talked for over an hour. 09:06:46 We totaled about 400 lines. 09:10:52 -!- coppro has quit ("The only thing I know is that I know nothing"). 09:26:40 -!- atrapado has joined. 09:28:17 -!- GreaseMonkey has joined. 09:37:49 Incidentally, even the "a = x/y; b = x%y; return b ? a+1 : a;" you can write as "a = x/y; b = x-a*y; return b ? a+1 : a;" which has one division (well, modulo) switched to multiplication. Though of course optimizations; GCC 4.3 at least seems to be clever enough to get both the x/y and x%y from the same idiv opcode when optimizing. (It even does something extra-clever there.) 09:39:52 -!- upyr[emacs] has joined. 09:40:18 -!- BeholdMyGlory has joined. 09:43:08 why do some (all?) TFT monitors "buzz" with a high pitch when the brightness setting isn't at 100? 09:44:20 fizzie, except as I said I was using C syntax just for clarity. It is a lot simpler than trying to ask it in befunge syntax :P 09:45:52 even if you know befunge, not everyone do in the channel. Asking in a more "mainstream" language syntax when the question isn't directly related to the esolang in question seems to work best IME. 09:46:32 Oh. Though in that case the time spent in the additional "-" operation and moving the IP around and instruction-fetching might eat any speed gains you could concievably get by changing a / into a *. 09:47:01 fizzie, the fact that it is befunge is bound to slow it down (unless you start working on jitfunge again! ;P) 09:48:12 Ngh. Not before the things-with-deadlines are over, at least. 09:48:19 of course 09:48:41 fizzie, so around the age of 65 then? ;P 09:49:57 Maybe after I've gotten that master's thesis done. (So... Sep/Oct hopefully.) 09:50:28 fizzie, what do you plan to do after that otherwise? Continue studying or getting a job? 09:50:35 -!- coppro has joined. 09:53:08 No clue, really. I think I'll at least apply for one of those graduate-school funding opportunities; I've sort of been promised employment here at the university if I get one of those places. Maybe otherwise too, but it's a bit unclear. The project from whose budget my salary is paid ends this year. 09:53:33 hm ok 09:53:49 Of course a real job would pay real money, instead of the pittance we get here. 09:53:59 But then I'd have to do real work too. :p 09:59:49 -!- augur has joined. 10:14:37 holy crap I got digested 10:16:20 The buzz is caused by audio-frequcy-range chopped electrical signals being converted somehow to sounds. 10:17:23 Those signals also supply power so they are rather powerful. 10:22:05 Not the worst device design screwup I have heard about... 10:27:38 The mechanism that dimming is usually implemented is that power electronics are used to chop the power supply and then the signal is lowpass-filtered somewhere. Unfortunately, the signal-to-sound conversion can happen before lowpass filtering or the lowpass filtering might be less than perfect. 10:27:38 -!- augur has quit (Read error: 104 (Connection reset by peer)). 10:32:22 -!- augur has joined. 10:36:01 -!- KingOfKarlsruhe has joined. 10:40:13 -!- augur has quit ("Leaving..."). 10:48:38 !befunge98 ffff***:*.a,@ 10:48:41 -1732076671 10:49:04 err 10:49:05 what? 10:49:22 oh 2^31-1 not 2^32... 10:49:28 Yes, it's signed. 10:49:37 why is it 32-bit btw hm 10:50:00 !befunge98 1y,a.@ 10:50:00 10 10:50:05 !befunge98 1y.a,@ 10:50:06 1 10:50:16 !befunge98 3y.a,@ 10:50:16 1128682830 10:50:46 cfunge indeed 10:50:58 !befunge98 2y.a,@ 10:50:58 4 10:51:12 !befunge98 4y.a,@ 10:51:13 41 10:51:35 0.4.1? 10:51:41 Guess so. 10:51:42 Deewiant, yes think so 10:51:52 which is last release too 10:51:52 Reasonably recent, then. 10:52:01 is this the befunge with the stack stack? 10:52:07 just missing a few revisions, including the CR correction bug. 10:52:12 coppro, yes 10:52:15 What do you return for 4y in bzr-built things? 10:52:16 :/ 10:52:25 s/correction bug/bug correction/ 10:52:52 fizzie, same, I have been too lazy to set up something in the build system to automatically find revision 10:54:50 Did you have a '93 compatibility mode in cfunge, or was that just efunge or something else? 10:55:09 -!- atrapado has quit ("Abandonando"). 10:55:39 fizzie, only in cfunge, but I never claimed it was very good. It only alters the semantics for spaces in strings. 10:55:42 to 93 ones 10:55:51 doesn't make instructions not in 93 reflect. 10:56:03 and I'm probably going to drop that mode. 10:56:31 !befunge98 aa*:*:*.a,@ 10:56:31 100000000 10:56:35 !befunge98 ee*:*:*.a,@ 10:56:36 1475789056 10:56:39 !befunge98 ef*:*:*.a,@ 10:56:39 1944810000 10:57:45 hm what is the best way to get 2^31-1 in befunge? 10:57:50 as in, shortest 10:57:50 Well, I don't think the 93 spec defined anything for undefined ops. 10:58:20 Put it in the playfield and use ...g for it, that's the shortest thing. 10:58:32 fizzie, right, but this is a one-time use so... 10:58:53 -!- KingOfKarlsruhe has quit (Remote closed the connection). 10:59:41 !befunge98 88*::*:**:1-+ 10:59:44 AnMaster: looking at the efunge code right now, I see you match [_|_] a lot - is that to avoid empty lists? 10:59:57 !befunge98 88*::*:**:1-+.a,@ 10:59:57 2147483647 11:00:03 That's 2^31-1. 11:00:11 I don't claim it's the shortest one, though. 11:00:13 coppro, in what specific place? 11:00:23 start() 11:00:48 coppro, Ah yes indeed, That is after all user provided data, better make sure it is reasonable :P 11:01:10 !befunge98 "PXIF"4(n284*1-R1-.a,@ 11:01:10 2147483647 11:01:14 * coppro starts poking around efunge, which has to be better-coded than his horrible Erlang messes 11:01:19 Deewiant, core instructions only :) 11:01:45 coppro, I was learning erlang as I coded it. So some parts are pretty bad 11:02:00 some of that code I wouldn't write today 11:02:00 well, you have -specs on yours, for starters 11:02:19 I was learning Erlang too, and I haven't actually gotten back to it. 11:02:21 coppro, yes, because I always preferred detecting bugs before I run the app. 11:03:37 fingerOpStacks()? 11:03:38 and if that isn't possible, at least catch them early on. Which might explain some matches like {_X,_Y} = Coord 11:03:39 and such 11:03:44 coppro, defined in some *.hrl 11:03:46 with -type 11:03:48 ah 11:03:49 I think 11:04:02 oh, yeah, that's where I'm looking 11:04:04 sorry 11:04:07 should be more specific 11:04:11 wondering what that is for 11:04:50 !befunge98 '@::*:**2*1-.a,@ 11:04:51 2147483647 11:04:53 Oh, and if you can assume ASCII, you can trivially replace the 88* with '@ to save one character... 11:05:07 Deewiant: I hates you! I had written that much and then you ruined it. 11:05:23 Oh, I didn't even notice your solution earlier 11:05:54 I use :1-+ instead of that 2*1- but it's otherwise pretty close. 11:05:55 Well, at least I'm being a bit more different in that I do 2*1- instead of :1-+ 11:05:59 NGH! 11:06:02 :-D 11:06:18 Stop being such a thought-vampire. 11:06:21 (Thought-pire?) 11:06:34 Thompire 11:07:05 heh 11:07:09 If you don't mind using a bit of nontextual data you can do '<256> 11:07:14 But I guess you do so I won't bother 11:07:56 Also <256> is tricky if you only have a non-locale-aware [0, 255]-bytes-as-input thing. 11:07:58 coppro, ah yes it is for fingerprint semantics stacks 11:08:06 A "thompire" sounds like one of those block-like things that drop from the ceiling and squish Mario, except edgier. 11:08:11 which is when you do like "PXIF"4( 11:08:15 Oh true, 256 is too big 11:08:18 Well, '<128> anyway 11:08:45 '<255>1+ might be better though, not sure 11:08:48 actually my input needs to be valid utf-8 as well as ASCII 11:09:05 so I'll go for '@::*:**2*1-.a,@ 11:09:05 Well, the '@ is rather nice. 11:09:13 Certainly it's more interesting than a silly 88*. 11:10:01 The :/* sequence in 8:*::*:**:1-+ is aesthetically pleasing, though. 11:10:20 !befunge98 "@@@@@@"***\+*.a,@ 11:10:21 1073745920 11:10:24 Darn 11:11:10 Oh, right, hmph. 11:11:28 !befunge98 "@@@@@@"+****1-.a,@ 11:11:28 2147483647 11:12:17 -!- coppro has quit (Remote closed the connection). 11:12:19 coppro, did that explanation help? I'm afraid you have to know funge-98 to understand fingerprints. 11:12:23 gah bad timing 11:12:32 -!- GreaseMonkey has quit ("HydraIRC -> http://www.hydrairc.org <- Nobody cares enough to cybersquat it"). 11:12:42 !befunge98 " @@@"+*:**1-.a,@ 11:12:43 2147483647 11:12:50 !befunge98 '~.a,@ 11:12:50 126 11:12:53 !befunge98 '@.a,@ 11:12:54 64 11:12:56 hm 11:13:12 !befunge98 '~2+:::***.a,@ 11:13:13 268435456 11:13:23 !befunge98 '~2+:::****.a,@ 11:13:23 0 11:13:26 !befunge98 '~2+::::****.a,@ 11:13:26 0 11:13:29 -!- coppro has joined. 11:13:30 err 11:13:35 wraparound? 11:13:41 !befunge98 '~2+:::::****.a,@ 11:13:42 0 11:13:47 !befunge98 '~2+:::::*****.a,@ 11:13:47 0 11:13:51 !befunge98 '~2+::**.a,@ 11:13:52 2097152 11:13:54 !befunge98 '~2+::::**.a,@ 11:13:54 2097152 11:13:56 !befunge98 '~2+::::****.a,@ 11:13:56 0 11:14:05 !befunge98 '~2+:::::****.a,@ 11:14:05 0 11:14:06 hm 11:14:12 Deewiant, that seems a bit strange to me 11:14:15 !befunge98 '~2+:::::******.a,@ 11:14:15 0 11:14:17 !befunge98 '~2+:::::::::::******.a,@ 11:14:17 0 11:14:48 !befunge98 '~2+.a,@ 11:14:48 128 11:15:20 > 128^5 `mod` 2^32 11:15:22 0 11:15:37 If you want a differently shaped version, you can use 11:15:39 8#v:*:< 11:15:39 >**:1-+ 11:15:56 It runs that :*: part both ways, which is always nice. 11:16:08 Use 'v, that would be nicer 11:16:13 Instead of an ugly # 11:16:29 (Not sure if it can be made nice though) 11:16:35 But 'v is a ugly number. Well, I guess I could try. 11:16:35 heh 11:16:44 fizzie, is 'v a number? 11:16:50 Of course it is 11:16:53 !befunge98 'v.a,@ 11:16:54 118 11:16:55 oh wait, right 11:16:56 duh 11:24:37 I don't think I can make a 118-based calculation very pretty. Though if you can enter the block using the v direction, you can do something like 11:24:39 8 11:24:39 [:*:< 11:24:39 >**:1-+ 11:24:43 No #jumps there. 11:25:33 Maybe for symmetricity the lower > should be a [ too. 11:27:54 hm what is the smartest way in befunge to check that a possibly unsorted list on the stack contains exactly a given set of elements. For example the stack might have 5 7 3 9 7 7 and I want to check that there is exactly those elements on it, but ignoring order of them. 11:30:54 for each element of list { for each element2 of set { if element == element2 goto Next } fail Next: } success 11:32:17 Deewiant, Not sure how to translate that into befunge... 11:33:03 Depends on how/where your list/set are stored 11:35:38 > ;if no more list elems, success; ;get list elem; > ;if no more set elems, fail; ;get set elem; -#v_ ;same - jump to beginning of this line; 11:35:40 : parse error on input `;' 11:35:53 The v goes to get another set elem 11:52:14 -!- coppro has quit (Read error: 110 (Connection timed out)). 11:59:01 Deewiant, the length of the list is known 11:59:16 (sorry got a phone call so was away) 12:00:14 basically I want to verify in a test suite for ATHR that a specific call to an instruction pushes a specific list on the stack, but where the ordering is unknown. 12:04:18 ah I have an idea. 12:05:40 somewhat like mycorand I think 12:08:33 Doing it as above works 12:08:50 Just fill in the blanks (most of it)... 12:11:24 Deewiant, I suspect what I have in mind results in less code. Not sure though. 12:11:58 Whatever works 12:12:19 Though it doesn't work for the multiset case; if the list is (7, 7, 7) and the multiset contains (7, 8, 9) it will succeed. I'm not sure if that was the case with the question. 12:12:58 fizzie, that should fail 12:13:52 5 7 3 9 7 7 is ok, so is for example 3 5 9 7 7 7 or 7 9 3 7 5 7, but not 7 9 3 5 or 7 7 9 3 5 12:14:08 nor 9 9 9 7 7 7 3 5 12:15:11 Oh, multiset and not a set 12:15:53 Then just remove the element from the multiset whenever you find it 12:16:12 my idea is to use j to create a jump table, then increment a counter in funge space for each hit, then after all elements are processed, check that the counters are correct. 12:18:23 !befunge98 02-;<;j @,a.2 ;@,a.1 12:18:28 um what 12:18:34 !help 12:18:34 help: General commands: !help, !info, !bf_txtgen. See also !help languages, !help userinterps. You can get help on some commands by typing !help . 12:18:47 !befunge98 01-;<;j @,a.2 ;@,a.1 12:18:51 !befunge98 03-;<;j @,a.2 ;@,a.1 12:18:51 2 12:19:02 Deewiant, does that make any sense to you? 12:19:24 (does mycology test negative arguments to j?) 12:19:31 (or is this a real bug?) 12:19:56 Sure; unless you hit exactly that < character, you're going to hit one of the @s before outputting anything. 12:20:12 fizzie, but shouldn't -2 to j hit the < 12:20:18 (that was my plan) 12:20:36 I guess it depends on where/when the delta is added. I don't remember the spec by heart. 12:21:18 fizzie, "Negative values are legal arguments for j, such that 04-j@ is an infinite loop." is all the spec says 12:22:04 "If there is a 1 on the stack, j will work like # does." In this case it sort of makes sense that you need a -3 to hit the <, i.e. the next instruction is k*delta from the position after the j, not the j itself. 12:22:09 !befunge98 04-ja,@ 12:22:24 (that differs with regards to wrapping yes) 12:22:34 (in fact, j when wrapping is quite a headache 12:22:36 ) 12:22:45 !befunge98 ;@,ax';06-j'ya,@ 12:22:55 !befunge98 ;@,ax'<;06-j'ya,@ 12:23:09 FATAL: Out of memory at [/home/egobot/egobot.hg/multibot_cmds/interps/cfunge/cfunge-src/src/stack.c:90]: 12:23:17 Deewiant: You're not actually printing that x, you know. 12:23:31 Just the newline. 12:23:49 Oops 12:23:55 !befunge98 ;@,,ax'<;06-j'ya,,@ 12:24:01 Blargh 12:24:06 Whatever :-P 12:24:45 I get 'x' here 12:24:49 after a newline 12:24:55 Asztal, using what interpreter? 12:24:59 mine 12:25:05 Asztal, which one is that? 12:25:12 !befunge98 ;@,a,x'<;06-j'ya,,@ 12:25:12 x 12:26:10 anyway a program with exactly 04-j@ does not loop forever in cfunge *debugs* 12:26:31 AnMaster: Mycology does test it. 12:26:39 AnMaster: it's called stinkhorn now. to be honest, it's not very good, but it should support j properly 12:26:42 Deewiant, I get all GOOD in mycology 12:26:56 Then you're doing something weird :-) 12:27:17 !befunge98 ;@,a,x'<;06-j'y,a,@ 12:27:17 x 12:27:22 That works, at least 12:27:23 Deewiant, it is related to wrapping 12:27:45 There's no wrapping in that code 12:28:11 Deewiant, no I meant in 04-j@ 12:29:42 Anyway, I'm not quite sure what the jump table is for in that stack-multiset-element thing. If your elements are small integers (like what you'd think is the case if you're using a jump table there) then you could directly use them as x offsets to increment counters in the playfield, then compare the row-with-counters to another row which holds the desired multiset in that representation. 12:30:06 fizzie, x offsets? 12:30:14 I guess you meant p 12:30:21 x-dimension offsets, for p/g. 12:30:26 yeah 12:32:02 AnMaster: There is no wrapping in that code. 12:32:52 Deewiant, sure the test in mycology isn't buggy in some way? 12:33:47 How would I know, haven't looked at it in months 12:34:05 I doubt it, given that other interpreters are happy with it 12:34:22 Deewiant, btw: http://pastebin.ca/1496943 12:35:02 Deewiant, oh and mycology says: 12:35:04 GOOD: 04-j jumps backward the right number of cells 12:35:15 08:43 AnMaster: why do some (all?) TFT monitors "buzz" with a high pitch when the brightness setting isn't at 100? 12:35:16 only low quality ones 12:35:34 Mycology's "04-j" test might not be at the left border of the file, though. 12:35:40 AnMaster: Like said, you do something weird. 12:35:55 09:14 coppro: holy crap I got digested 12:35:56 wat 12:35:59 fizzie, yes, as far as I understand j there crosses the border 12:36:22 AnMaster: No, it does not. 12:36:24 AnMaster: There is no wrapping in that code. 12:36:32 Deewiant, 01-j for example would as far as I understand hit the - right? 12:36:46 No, it would hit the j itself. 12:36:50 hm ok 12:36:53 Because "0jx" hits the x. 12:37:03 that explains a bit of what is happening 12:37:08 !befunge98 0j'a,a,@ 12:37:08 a 12:37:18 right 12:37:24 !befunge98 02-j'a,a,@ 12:37:24 a 12:38:07 i had a dream where AnMaster was talking about how Kucinich personally tutored him or something. 12:38:19 ehird, who is that? 12:38:38 Dennis Kucinich, the only left-wing politician in America. 12:38:42 (Modulo hyperbole.) 12:39:10 Deewiant, the code for j is http://pastebin.ca/1496948 btw 12:39:28 wrote that long ago 12:39:31 You might get wrapping in "04-j" if you implement j so that when the IP is still at j you add that -4*delta, in which case you would go to the position one left of the 0, then rely on the normal +delta movement from there. And cared about the borders in the -4*delta part. 12:39:35 * AnMaster wonder what broke with wrapping 12:40:01 fizzie, correct, the ip is moved forward normally after always. 12:41:14 fizzie, it doesn't match how other instructions work, if you move before actually executing the side effects of the instruction 12:41:17 hm 12:41:39 Well, what does your ip_forward do when x=3, delta.x=-4, and the left border of the playfield is at x=0? 12:41:44 The spec is explicit in this case, though. 12:42:10 -!- sgeo has joined. 12:42:12 I'm changing it atm indeed 12:43:07 fizzie, hm... Don't ask me such tricky questions. But when delta isn't cardinal, wrapping is implemented as the wrapping algorithm in the spec (that is, reverse ip, go on to other edge, reverse again) 12:43:20 and -4 isn't cardinal 12:47:17 ok I changed behaviour, and now it gets into some infinite loop *sometimes* after "GOOD: z doesn't reflect", but not on all runs. Huh 12:48:10 -!- Judofyr has joined. 12:49:05 So... what I think happens there with "04-j@" is that when you call ip_forward with x=3, delta.x=-4, you'd be attempting to pass to the empty space and would do the backtrack-warping; setting delta.x=4 temporarily, and starting from x=3. Then you're already at the other edge (only whitespace from x=7 and so on) so you stop with the backtrack there. After that your j resets the delta to x=1, and execution proceeds to the @. 12:49:47 fizzie, quite likely 12:51:18 but the new behaviour of failing sometimes is rather weird. Especially since ? hasn't been used at all by that point. Valgrind reports no issues either. 12:57:56 -!- upyr[emacs] has quit (Read error: 54 (Connection reset by peer)). 12:58:40 -!- upyr[emacs] has joined. 12:59:30 oh found it 13:00:02 -!- MigoMipo has quit (Read error: 104 (Connection reset by peer)). 13:01:15 -!- Pthing has joined. 13:17:37 http://www.youtube.com/watch?v=cH6r2tIaRXU // needs hooking up to a visor 13:31:15 to send to ais523 when he comes on: wikipedians are arguing over whether to include the public domain rorschach test images on the article ... because it would make it harder for psychologists to use them, or something. http://en.wikipedia.org/wiki/Talk:Rorschach_test 13:32:05 meanwhile, http://pouletvous.files.wordpress.com/2009/04/rorschach_inkblots.jpg 13:34:55 not as though the test works any more than say, astrology :) 13:35:44 http://truthsilo.com/stds/rorschach.htm 13:37:57 -!- MigoMipo has joined. 13:40:13 "mentioning more than four sex images in the ten plates is diagnostic of schizophrenia" 13:40:36 #scheme people had that bot which understood "later tell [some interesting things]", which would then say ": [some interesting things]" at the point when joined or next said something. 13:42:55 so do we 13:43:08 lambdabot: tell ais523 wikipedians are arguing over whether to include the public domain rorschach test images on the article ... because it would make it harder for psychologists to use them, or something. http://en.wikipedia.org/wiki/Talk:Rorschach_test 13:43:12 @help 13:43:12 help . Ask for help for . Try 'list' for all commands 13:43:15 @list 13:43:15 http://code.haskell.org/lambdabot/COMMANDS 13:43:39 @tell ais523 wikipedians are arguing over whether to include the public domain rorschach test images on the article ... because it would make it harder for psychologists to use them, or something. http://en.wikipedia.org/wiki/Talk:Rorschach_test :not as though the test works any more than say, astrology :D not as though the test works any more than say, astrology... 13:43:39 Consider it noted. 13:43:43 yay \bot 13:44:00 Double paste 13:44:42 So what's the "yhjulwwiefzojcbxybbruweejw" command from "quote" do? 13:44:53 wow, er 13:44:54 Outputs a quote, of course. 13:44:54 @yhjulwwiefzojcbxybbruweejw 13:44:54 Exception: <> 13:44:59 @yhjulwwiefzojcbxybbruweejw 13:44:59 Just 'J' 13:45:01 @yhjulwwiefzojcbxybbruweejw 13:45:02 "\"" 13:45:09 Deewiant: looks to be running random haskell code to me 13:45:11 @yhjulwwiefzojcbxybbruweejw 13:45:11 Just 'J' 13:45:13 @help yhjulwwiefzojcbxybbruweejw 13:45:13 V RETURNS! 13:45:20 well, let's look at the source. 13:45:38 "v" -> rand notoriousV 13:45:39 "yhjulwwiefzojcbxybbruweejw" 13:45:39 -> rand notoriousV 13:45:41 @help v 13:45:42 let v = show v in v 13:45:52 x.x 13:46:21 someone decrypt http://code.haskell.org/lambdabot/State/quote :P 13:46:23 @v 13:46:24 Exception: <> 13:46:26 @v 13:46:27 "\"\\\"\\\\\\\"\\\\\\" 13:46:35 > let v = show v in v :: Maybe Char 13:46:36 Couldn't match expected type `Data.Maybe.Maybe GHC.Types.Char' 13:46:39 thoughtso 13:46:41 thought so 13:47:15 Deewiant, I'm going to release a new cfunge version soon (today possibly). Since it only contains bug fixes and cfunge seems pretty mature now, I'm going to jump version to 1.0.0-pre1 13:47:48 Deewiant, do you have any good suggestion how to differentiate 1.0.0 and 1.0.0-pre1 in the version reported by y? 13:48:34 1.0.0.-1 13:48:46 10000 and 1001? 13:48:49 ehird, um it is reported as a single integer joining the components 13:49:21 Just call it 0.9.9 or something... 13:49:39 AnMaster: -1001 13:49:46 Deewiant, shouldn't it be 100 rather than 10000 ? for 1.0.0 anyway? I don't do more than three "normal" components. (and possibly -pre, as I did for 0.2.1-pre2 for example) 13:49:57 ehird, the idea is that a newer version should have a higher number 13:50:15 ehird, 0.4.1 was 41 13:50:21 Deewiant, good idea 13:50:21 I would probably go with 1.0.0 == 10000 too, and anything below that for pre-x. Since you're not doing a for-real-0.99.x series, maybe 9900+X for 1.0.0-preX. 13:50:22 AnMaster: If you want 100 to be 1.0.0, then 1.0.0-pre1 will have to be <= 99 which doesn't make much sense to me 13:50:24 AnMaster: that'll break 41.0 13:50:31 so your version numbering sux anyway 13:50:33 ehird, that would be 410 13:50:39 ... 13:50:40 so you are wrong 13:50:43 0.9.9. 13:50:55 1 cell containing the implementation's version number (env). 13:50:55 If the version number contains points, they're stripped. v2.01 == 201, v1.03.05 = 10305, v1.5g = 1507. Don't use non-numbers in the version number to indicate 'personalizations' - change the handprint instead. 13:50:57 from the spec 13:51:04 AnMaster: it would break 4.1, though. 13:51:28 ehird, you mean it would break 4.1.0 ? Ok I was wrong. 41.0 would be 41.0.0 thus 4100 13:51:38 and 4.1.0 would be 410 13:52:01 uh huh. 13:53:07 k 13:53:57 If you're sure you don't end up with 1.0.10 at any point, you can do x.y.z => xyz; in that case you're probably going to have to use 91, 92, 93... for 1.0.0-pre1 and so on. Maybe that won't matter if you're not doing a 0.9.x series. 13:54:38 Alternatively just call the "1.0.0-pre1" 0.9.1 externally too. 13:55:02 You can do x.y.z -> xyz anyway. 13:55:06 Just jump from 109 to 1010. 13:55:38 You'll only be screwed if you then go to 200 for 2.0.0. 13:56:17 Well, yes, I guess so, but then the change from version -> "4y" conversion comes at a rather awkward does-not-show-much-of-forethough place. 13:57:47 It doesn't matter since you can't possibly know for sure anyway 13:58:02 Ostensibly you can hit 1.0.100, 1.0.1000, etc. 13:59:06 hm 14:00:14 Deewiant, you could encode them like Gödel would have done. 14:00:34 …thus showing that AnMaster doesn't understand what Gödel's paper was about. 14:00:56 ………………………… 14:01:09 ..................................................................................... 14:01:18 An encoding which preserves a total ordering? 14:01:26 -!- Pthingg has joined. 14:01:26 Ooh, you used the fancy ellipsis character too, even for >3 dots. 14:01:28 And fits in a word? 14:01:30 I like that. I do that sometimes. 14:01:41 ……………………………… 14:01:45 Deewiant, that might be a problem though 14:06:18 I just noticed that it's compose-.-. for me :P 14:06:20 … 14:06:23 So now I have to use it. 14:06:31 Ü 14:08:41 Is that even theoretically possible, to define a mapping from three integers (x, y, z) to one such that E(0, 0, x1) < E(0, 1, x2) for any x1, x2? It doesn't sound very likely, since given k=E(0,1,x2)-E(0,0,x1) you get E(0,0,x1+k+1) > E(0,1,x2) which is a contradiction. 14:09:22 (x, y, z) -> y 14:10:05 fizzie, hm... isn't two bignums enough storage for TC iirc? I think someone said it in here 14:10:08 Well, an injective function. 14:10:18 fizzie: You didn't say that :P 14:10:45 Sure you can store (x, y, z) in one integer (with the standard prime-exponent-thing for example) but that doesn't have that ordering property. 14:11:39 fizzie, was that a reply to my last comment about two bignums? 14:12:00 Sort-of, yes. In the sense that you can encode an arbitrary sequence of integers as a single integer. 14:13:17 fizzie, right, so if a language with two bignums is TC, then you obviously will have to be able to implement a bignum brainfuck in it (minus IO of course). That means several arbitrary ordered integers to encode in one number as far as I can see? 14:13:36 or have I missed something 14:14:05 s/arbitrary ordered integers/ordered arbitrary integers/ 14:15:08 -!- Pthing has quit (Read error: 110 (Connection timed out)). 14:15:17 Yes yes but you need the result of the encoding to have that particular property, that if, say, the second integer of first sequence is larger than the second integer of the second sequence, then the first encoding is larger than the second encoding no matter what the rest of the sequence is. 14:15:57 fizzie, ah right, forgot that bit... hm 14:16:12 Which will not be possible, since there's only a finite amount of numbers between the two encodings, yet you need to stick a countably-infinite number of encodings between them. 14:21:25 -!- upyr[ema` has joined. 14:21:35 -!- upyr[emacs] has quit (Read error: 104 (Connection reset by peer)). 14:24:58 I think we had a Scheme exercise about pairs-as-integers, or maybe it's in SICP; (define (cons a b) (* (expt 3 a) (expt 2 b))) and (define (car p) (if (= (remainder p 3) 0) (+ 1 (car (/ p 3))) 0)) and similarly for cdr gives a working system, though the numbers get rather big. 14:25:02 I think it's in SICP, actually. 14:29:11 Yes, exercise 2.5. Big numbers: http://pastebin.com/m2bdcc079 14:30:06 I was barely able to make the list (1 2 1); the list (1 2 3) gave a heap overflow error. 14:34:44 fizzie: does your university thng still use sicpi 14:34:46 sicp 14:35:17 Not really, except there's this special summer course about it. 14:35:27 http://www.cs.hut.fi/~scheme/course-description.html 14:35:54 that sucks, i thought you said they still did 14:35:55 The mandatory programming-basics courses haven't used SICP since 2003 or so. 14:36:23 Well, they did when I did them, but that was the last time. Completely not related, of course. 14:39:08 fizzie, why would anyone think it was related? It seems strange that you felt the urge to point it out... Hmmm ;P 14:39:41 It definitely wasn't the case that the negative-quality of the Scheme code I wrote made their heads implode. 14:40:14 fizzie, So that event didn't affect their decision then? 14:40:48 wait, misread it. My response doesn't work. 14:40:49 meh 14:42:28 fizzie: see if you said yes they do do sicp then i'd have made a bet for a million dollars* that i'd be there in 2013 and you still would be, growing moldy and crinkly :D 14:42:30 *zimbabwean 14:42:54 -!- sgeo has quit ("Leaving"). 14:42:56 I can retcon my answer to "yes" if you want, though that won't actually make them start use it. 14:44:32 are you at all crinkly and/or moldy at the moment? 14:44:38 i'm calculating my probability here 14:45:03 I think there's some mold growing in my pile of stuff on the table, yes. 14:45:11 i... don't think that counts as "you" 14:46:44 I'm sure I can get some good mold going by 2013 if I just put in the effort. 14:46:56 right 14:47:07 try really hard not to umm graduate or whatever you said you still haven't done a while ago. 14:47:21 wait why would you try and lose a bet 14:47:22 that makes no sense 14:48:13 It's not like graduating would necessarily get me out of here. In fact I'm not sure what it would take. Possibly some sort of an explosive charge. 14:48:45 :D 14:52:11 where is your endless money pit 14:53:30 Pthingg: i think it costs money to live outside of a university too. :P 14:54:48 I work as a research assistant here at the university, so they're paying me for being here, chatting around on #esoteric. Well, maybe not exactly for that. 14:54:58 good moneypit 15:00:34 -!- oklopol has joined. 15:01:23 ooooooooooooooooooooooooooooooooooooooooooooooooooooooooo 15:04:54 ^bf >,[>,]<[<]>.[>[.>]<<[.<]>]!oklopol 15:04:54 oklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkoklopolopolkokl ... 15:06:41 i couldn't deduce the algo from the output right away 15:06:51 i really think i'm getting stupider 15:06:59 damn lament 15:08:12 How is it his fault, then? 15:08:38 he told me statistically speaking people get stupider with age. 15:11:49 If you hadn't heard it, you'd be getting smarter and smarter all the time? 15:12:48 i don't see why not 15:14:07 -!- GregorR-L has joined. 15:15:13 opolkok :D 15:15:21 opal cock 15:15:26 fizzie: is that repeated scrambley 15:15:54 I don't remember scrambley; that's just a bouncy-bouncy. 15:16:02 ^bf >,[>,]<[<]>.[>[.>]<<[.<]>]!12345 15:16:02 123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543 ... 15:16:30 oh :p 15:16:39 I just read oklopol backwards and it sounded funny. 15:17:07 don't you read bf 15:17:07 i just basically looked at it 15:17:23 i think it sounds rather boring 15:17:23 NO OFFENSE 15:17:51 Opo-lopo-lolpo-cock. 15:19:26 ^bf >,[>,]+[-<[.<]>[.>]+]!12345 15:19:27 543211234554321123455432112345543211234554321123455432112345543211234554321123455432112345543211234554321123455432112345543211234554321123455432112345543211234554321123455432112345543211234554321123455432112 ... 15:19:31 -!- oklopol has changed nick to opolopololpokok. 15:19:33 hm almost 15:19:49 ^bf >,[>,]+[-[.<]>[.>]+]!12345 15:19:51 123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512345123451234512 ... 15:19:55 lol 15:20:00 ^bf >,[>,]+[-<[.<]>>[.>]+]!12345 15:20:01 543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345543212345 ... 15:20:08 ^bf >,[>,]+[-<<[.<]>>[.>]+]!12345 15:20:09 432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234543212345432123454321234 ... 15:20:10 no wait 15:20:59 oko 15:21:06 meh 15:21:11 can't golf it shorter than fizzie 15:21:28 pipe mine to tail +n 15:21:29 :D 15:22:27 fizzie: how does yours work? too lazy to read it 15:22:56 :\ 15:23:19 you can be surprising 15:23:23 It's just (read to tape), (seek to beginning), loop: {(print forwards), (print backwards)} with a bit of extra <>.s here and there to avoid duplicately printing the ends. 15:23:52 opolopololpokok: i can write bf but not read others' :D 15:24:24 fizzie: yah my reversing the forward/backwards to get it to match fucked up my sentinels :D 15:24:27 imperative languages are always so "extra <>:s here an there", god i hate them 15:24:42 i hate my nick 15:24:42 -!- opolopololpokok has changed nick to oklopol. 15:24:52 oklopol: but you'd do the analogue of that in haskell xD 15:25:05 it's sort of unavoidable when you want to ignore shit 15:25:09 ehird: no worries, i pretty much learned to read other people's code at all last year. 15:25:47 brainfuck has never been my forte tbh, i don't match well with a typeless tape of blobs 15:26:11 i'm speaking in general; also who said functional languages are any better 15:26:11 i hate them too 15:26:38 annoying pieces of shit 15:26:38 EVERYTHING 15:26:38 SUCKS 15:26:45 oklopol: yah but some things suck less 15:26:54 you have to optimize for minimum suck(x) 15:27:16 true. 15:27:42 it's suck physics 15:28:22 i need to clean some floors now. 15:29:23 it's my new job, my philosophy is, who cares if it's not the nicest job ever, as long as the money is okay 15:29:31 :D 15:29:41 granted, the money sucks; but at least i got 50% correct 15:29:42 oklophosophy 15:29:43 oklopol: Your philosophy sucks. 15:30:00 also i just wanted to make that joke, i'd never get a job i don't like. 15:30:09 and i don't have a job 15:30:19 i've never had a job 15:30:22 OK, I'm gonna stab you in the jokehole now. 15:31:36 god, it's like you don't like being lied to. 15:31:44 No ... 15:31:46 oklopol: you never meta-job you don't like 15:31:49 I just like stabbing people in jokeholes. 15:34:24 i dislike the whole idea of having a job, i want to do what the fuck i want, not something that's useful 15:37:11 * GregorR-L hands oklopol an Ayn Rand book 15:39:04 -!- oerjan has joined. 15:39:23 fun is so grammar 15:39:56 Fun is SO grammar. 15:40:10 That is SO Tacoma Way. 15:40:54 -!- BeholdMyGlory has quit (Remote closed the connection). 15:41:33 whatever that is. 15:44:33 -!- GregorR-L has set topic: I'm don't that stupid who understand obviously | http://tunes.org/~nef/logs/esoteric/?C=N;O=D. 15:47:35 you're a kitty! 15:48:52 Latest xkcd is pretty awesome :P 15:48:59 http://xkcd.com/610/ 15:52:43 -!- KingOfKarlsruhe has joined. 15:53:04 Is it okay if I'm fair and balanced? 15:53:20 to be fair and balanced you have to do the same with atheism, dumbass 15:53:30 atheism isn't a religious ideology. 15:54:06 that has nothing to do with how to be fair and balanced. 15:54:13 :P 15:54:44 and if you bash creationists specifically, you need to balance it with some science bashing. 16:00:32 Is that even theoretically possible, to define a mapping from three integers (x, y, z) to one such that E(0, 0, x1) < E(0, 1, x2) for any x1, x2? It doesn't sound very likely, since given k=E(0,1,x2)-E(0,0,x1) you get E(0,0,x1+k+1) > E(0,1,x2) which is a contradiction. 16:00:53 i think that proof is faulty, but the result is true. 16:02:05 or wait. if they are _signed_ integers, then that is actually possible. 16:02:34 ofc 16:03:07 you can map all (0,0,x1) to something negative, all (0,1,x2) to something positive, with room to spare for the rest. 16:03:20 basically you need to find an integer both under and over which there's an infinite amount of ints 16:03:28 (btw injective was specified later) 16:03:36 trivially impossible for unsigned, trivially possible for signed 16:04:00 yeah 16:05:25 i was thinking switching to math for my master's maybe 16:05:44 cuz it's funn 16:07:03 iirc then you can actually get (x,y,z) -> w totally order preserving with rationals 16:07:16 and probably not with reals 16:08:06 bijection? 16:08:13 err 16:08:13 isomorphism? 16:08:13 err 16:08:13 no no bijection 16:08:13 :P 16:08:16 i was wondering about that 16:08:37 it might be bijection, i don't see an immediate reason why not 16:08:49 i'll probably be a noob for the rest of my life 16:10:17 oerjan: i said i was fair and balanced in my bashing of religious ideologies 16:10:18 soooo 16:10:49 You're like the KKK in that you're an equal-opportunity hater. 16:10:53 :P 16:10:55 Is that even theoretically possible, to define a mapping from three integers (x, y, z) to one such that E(0, 0, x1) < E(0, 1, x2) for any x1, x2? It doesn't sound very likely, since given k=E(0,1,x2)-E(0,0,x1) you get E(0,0,x1+k+1) > E(0,1,x2) which is a contradiction. 16:10:56 for (x,y) you could have x just mean [x-1..x], and then just do 1-1/y for the y part 16:10:56 and add 16:10:56 right? 16:10:57 ah yes whenever you choose the rational to map to you can pick the one with smallest denominator. this gives a bijection since Q x Q x Q has no isolated points 16:10:58 you have to ask? 16:11:36 oklopol: huh? 16:11:37 then you could do the same with 1-1/z for the rest of the interval 16:11:43 pikhq: that's some broken analogy you got there... mister knights templar 16:11:52 okay that was lame 16:11:52 :-D 16:12:09 oklopol: i am assuming we start with triples of _rationals_ 16:12:09 oerjan: trying to preserve order too 16:12:11 ehird: I like my analogies broken. ^_^ 16:12:18 not integers 16:12:22 i mean just trying to preserver order 16:12:28 pikhq: your analogies are like broken analogies. 16:12:52 embedding base infinity integers into rationals 16:12:52 ohh 16:13:18 base infinity? 16:13:19 whoa. 16:13:23 > logBase Infinity 77 16:13:24 Not in scope: data constructor `Infinity' 16:13:29 > logBase (1/0) 77 16:13:30 0.0 16:13:33 0.0 16:13:33 :D 16:13:37 it's surprised. 16:13:44 > logBase (1/0) (1/0) 16:13:45 NaN 16:13:46 ehird: how haskell compares tuples. 16:13:48 ... 16:13:50 don't you mean "1" 16:13:51 :D 16:14:00 oklopol: lexicographically 16:14:05 oklopol: erm all members being equal 16:14:10 :t and 16:14:11 [Bool] -> Bool 16:14:15 :t all 16:14:17 forall a. (a -> Bool) -> [a] -> Bool 16:14:23 well 16:14:25 zipWith (==) 16:14:27 except 16:14:28 on tuples 16:14:30 yaknnow 16:14:38 oklopol: i mean (a,b) == (c,d) = a == b && c == d 16:14:54 > sort.join(liftM2(,))$[1..5] 16:14:56 [(1,1),(1,2),(1,3),(1,4),(1,5),(2,1),(2,2),(2,3),(2,4),(2,5),(3,1),(3,2),(3... 16:15:03 oerjan: no 16:15:18 peer review/on a pew. 16:15:20 i mean 16:15:20 lexicographic ordering is not "base infinity" ordering 16:15:21 no what? 16:15:31 oklopol: whuzzagottadowithtuples 16:15:34 it is with tuples, because they are the same length 16:15:40 um k 16:15:43 oerjan: shouldn't log_infinity(infinity) be 1 16:15:57 ehird: certainly not 16:16:13 um wait 16:16:20 > map (join logBase) [1..] 16:16:21 [NaN,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.0,1.... 16:16:23 oerjan: while haskell orders tuples lexicographically, lexicographical ordering isn't how base infinity ordering works 16:16:26 oerjan: sure it should be! 16:16:29 if you do limits to infinity with different speeds on the two parts, you can get it to anything 16:16:46 because if you have (1,0) and (5), lexicographical says (5) is bigger 16:16:47 ehird: ^ 16:16:53 oerjan: wat 16:17:06 but base infinity says (1,0) is bigger 16:17:13 oklopol: haskell tuples of different length don't have the same type 16:17:24 @src join 16:17:25 join x = x >>= id 16:17:30 although you are correct for lists 16:17:30 oerjan: YES I KNOW 16:17:39 what is this base infinity magic/// 16:17:48 oerjan: that's why they are both an example of base infinity ordering and lexicographical ordering 16:18:09 * pikhq sees that, and treats it as a zen koan. 16:18:12 ehird: base ordinal omega, say 16:18:19 so yeah, bad example maybe, but your "lexicographically" comment made no sense. 16:18:23 pikhq: yes / represents - 16:18:24 :t \f xs -> do x <- xs; return (f x) 16:18:25 forall (m :: * -> *) t b. (Monad m) => (t -> b) -> m t -> m b 16:18:30 well some sense 16:18:31 @hoogle (t -> b) -> m t -> m b 16:18:31 Data.Traversable fmapDefault :: Traversable t => (a -> b) -> t a -> t b 16:18:31 Prelude fmap :: Functor f => (a -> b) -> f a -> f b 16:18:31 Control.Applicative (<$>) :: Functor f => (a -> b) -> f a -> f b 16:18:33 oh it's fmap 16:18:33 lol 16:18:57 :t \f xs -> do x <- xs; f x 16:18:58 forall (m :: * -> *) t b. (Monad m) => (t -> m b) -> m t -> m b 16:19:05 whoa 16:19:06 ?. pl undo \f xs -> do x <- xs; f x 16:19:07 (=<<) 16:19:08 mapM is >>= 16:19:11 ehird: oklopol: i mean (a,b) == (c,d) = a == b && c == d <<< talking about comparison, not equality 16:19:14 ordering 16:19:14 whoaaaaaaaaaaaaaaaaaaaaa 16:19:17 mapM is >>= 16:19:17 oklopol: btw the theorem on embedding into rationals works with any countable, totally ordered set 16:19:22 wait no 16:19:25 that's only in the one 16:19:28 dammity 16:19:35 @src mapM 16:19:36 mapM f as = sequence (map f as) 16:19:50 and if there are no points isolated from left or right, then i think it can be made a bijection 16:19:58 sequence = foldr (liftM2 (:)) (return []) 16:20:03 pikhq: i just wanted a mapM that worked on non-lists somehow :D 16:20:08 so what are isolated points? 16:20:32 ehird: If only. 16:20:37 also did you get my point about lexico vs base infinity? 16:20:45 ?hoogle (a -> m b) -> n a -> m (n b) 16:20:46 Data.Traversable traverse :: (Traversable t, Applicative f) => (a -> f b) -> t a -> f (t b) 16:20:46 Data.Traversable mapM :: (Traversable t, Monad m) => (a -> m b) -> t a -> m (t b) 16:20:46 Data.Traversable for :: (Traversable t, Applicative f) => t a -> (a -> f b) -> f (t b) 16:20:54 Deewiant: that's not mapM, yo 16:21:00 you start from different directions 16:21:01 wait 16:21:02 yes it is 16:21:03 ehird: Yes it is 16:21:03 but ehh 16:21:06 that has a typeclass dependency 16:21:11 i could do it with monad transforms 16:21:13 transformers 16:21:14 i think 16:21:27 oklopol: if there is either no or a smallest point y to the right of a point x, then then x is isolated from the right 16:22:06 > Data.Traversable.traverse Just [1,2,3] 16:22:08 Just [1,2,3] 16:22:09 Whee, id 16:23:11 oerjan: makes sense 16:23:55 but, what's the embedding? 16:24:12 hmm what's the transformer class again? 16:24:13 i mean 16:24:13 oerjan: ah yes whenever you choose the rational to map to you can pick the one with smallest denominator. this gives a bijection since Q x Q x Q has no isolated points <<< i don't get this 16:24:14 MonadTrans? 16:24:19 ehird: Traversables are precisely those things that can be traversed like lists with applicatives 16:24:30 ehird: think so 16:25:22 oklopol: you start with a (non-order preserving) bijection f from the natural numbers to Q x Q x Q 16:25:54 then you build a map from Q x Q x Q recursively 16:26:11 call that g : Q x Q x Q -> Q 16:26:20 okay. 16:26:20 g(f(0)) = 0, for a start 16:26:45 (Monad m, MonadTrans t, Monad (t m)) => (a -> m b) -> t m a -> t m b 16:26:45 i think 16:26:48 either that or 16:26:53 (Monad m, MonadTrans t, Monad (t m)) => (a -> m a) -> t m a -> t m b 16:26:54 (Monad m, MonadTrans t, Monad (t m)) => (a -> m a) -> t m a -> t m a 16:26:55 rather 16:27:23 now for f(n), look at the nearest neighbors to f(n) among f(0)...f(n-1). say f(m) < f(n) < f(o) 16:28:11 then you define g(f(n)) to be the _simplest_ rational between g(f(m)) and g(f(o)) (either might not exist if f(n) is min or max so far 16:28:14 ) 16:28:39 ah cool 16:29:05 and that's a bijection because there are no isolated points? 16:29:35 this recursively puts everything in order. also if there were no isolated points then there is no way to miss a rational, since you will eventually use up all the simpler ones close to it 16:30:02 (or anywhere) 16:30:38 simpler means minimal (absolute value of) numerator _and_ denominator 16:30:43 *simplest 16:31:50 i don't see why the no isolated points assumption is the crucial thing 16:31:56 (i'm not sure it "simple" is actually the right word) 16:31:57 not that i've given it thought 16:33:08 oklopol: say if there is no point between f(m) and f(n). then no matter what you map them to, you are going to miss all rationals between them. similar if there are global mins or maxes. 16:33:32 i mean it seems it's the simplicity ordering that does it 16:33:43 hmm 16:34:10 oh right 16:34:21 yes, that ensures you don't miss anything _assuming_ you always continue to put new things between all neighbors 16:34:37 and beyond the global min/max 16:34:38 okay makes perfect sense 16:35:54 food -> 16:37:27 butter -> 16:38:35 vegetable oil spread -> 16:39:02 oklopol is just going to... eat butter? 16:39:02 :D 16:40:13 well no but i assumed you can guess what i'm going to eat with it, as opposed to the other direction. 16:40:40 nah really it's a long story 16:43:32 oklopol: eat the damn butter. 16:43:44 Eat the dam butter. 16:44:27 otoh you cannot fit more than countably many intervals into the reals, so mapping reals x reals order-preservingly to reals is impossible 16:45:39 (reason: every interval must contain a rational) 16:48:50 Right, the "given k=E(0,1,x2)-E(0,0,x1) you get E(0,0,x1+k+1) > E(0,1,x2)" thing relied on the fact that also E(0,0,x1) < E(0,0,x2) iff x1 < x2, in addition to the injectiveness. I didn't bother specifying the full set of demands for E. 16:49:15 fizzie: did you really have to ask though 16:49:18 i mean that's trivially impossible 16:49:31 -!- AnMaster_ has joined. 16:49:33 it's the kind of thing i'd expect AnMaster to ask :P 16:49:37 uh oh, now he'll go "?" 16:49:42 That's why "it doesn't sound very likely". 16:49:43 -!- AnMaster has quit (Nick collision from services.). 16:49:48 -!- jix has quit (hubbard.freenode.net irc.freenode.net). 16:49:48 -!- ineiros has quit (hubbard.freenode.net irc.freenode.net). 16:49:49 -!- AnMaster_ has changed nick to AnMaster. 16:50:02 can pigs fly? it doesn't sound very likely :-P 16:50:13 Yes. I can imagine myself saying something like that. 16:50:46 ehird: Depends on how powerful the rocket is? 16:51:19 :D 16:51:39 GregorR-L: How unimaginative. 16:51:52 ehird: Depends on how powerful the salad is? 16:51:55 Why do you not account for the case of a *jet engine* being strapped on, for example? 16:51:59 right, I'm not surprised about that netsplit 16:52:01 I saw part of it from the other side. 16:52:29 -!- ineiros_ has joined. 16:52:50 -!- jix has joined. 16:52:50 -!- ineiros has joined. 16:55:52 ehird, I looked in the log for today and I can't find the question that fizzie is supposed to have asked. Just some statements. 16:56:09 so afraid I can neither confirm or deny if I would have asked said question 16:56:12 we're answering () 16:57:59 -!- jix has quit (hubbard.freenode.net irc.freenode.net). 16:57:59 -!- ineiros has quit (hubbard.freenode.net irc.freenode.net). 16:58:47 http://article.gmane.org/gmane.linux.kernel/863786 16:59:02 -!- jix has joined. 17:00:29 ehird, heh? His firstname I assume? 17:01:41 No, his last name. 17:02:01 ah yes 17:04:58 oerjan, :D at the sound clip on Darth&Droids today 17:05:18 (I just read the comics today) 17:28:55 I should get my new waterproof cell phone watch with a better camera today whoot 17:30:43 GregorR, "today whoot"? 17:30:55 "whoot" is an exclamation 17:30:58 ah 17:31:29 GregorR, would it be similar to a !, ? or ‽ 17:31:36 -!- KingOfKarlsruhe has left (?). 17:31:40 It's similar to "w00t" 17:31:41 whoot = woot 17:31:43 But spelled in English. 17:31:48 Perhaps it could be a ¡ or a ¿ 17:31:48 w00t is just a silly 1337 version of woot. 17:31:54 I've been wooting for wooting ages. 17:32:01 hm right 17:32:15 But this is all aside from the fact that I should get my new waterproof cell phone watch with a better camera today. 17:32:32 though I know what woot means I decided to google define: it 17:32:34 funny: 17:32:35 Common misspelling of hoot. Common misspelling of w00t. An exclamation of joy or excitement; I agree 17:32:36 en.wiktionary.org/wiki/woot 17:32:44 hoot? 17:32:45 XD 17:32:49 I don't give a woot, frankly. 17:32:58 ehird, yeah, and suggesting that "w00t" is the correct spelling... 17:33:17 Uh, w00t? I don't give a hoot. 17:33:40 bbl for a few hours. Going to driving lesson :) 17:33:47 Give a whoot, don't pull hoot. 17:33:56 who wants to drive. 17:34:00 <-- 17:34:25 -!- BeholdMyGlory has joined. 17:34:30 -!- oklofuk has joined. 17:36:14 -!- jix_ has joined. 17:47:00 -!- jix has quit (Read error: 110 (Connection timed out)). 17:52:39 -!- Gracenotes has quit ("Leaving"). 17:54:29 -!- ehird has changed nick to estoppel. 17:58:28 -!- oklopol has quit (Read error: 110 (Connection timed out)). 18:04:36 oklofuk: i'ma make that theremin vid now 18:05:25 is that my nick :o 18:05:25 -!- oklofuk has changed nick to oklofok. 18:05:27 but yay! 18:07:40 oklofuck 18:07:43 oklofok: it was inevitable, really. just be glad augur wasn't here. 18:13:49 getting le theremin set up. 18:24:24 -!- M0ny has joined. 18:32:40 recorderated. 18:32:42 it sucks but oh well 18:37:19 saving 18:46:48 oklofok: uploading. 18:47:08 oklofok: what os are you using atm btw? and is your internet good enough to dl 23mb? 18:51:13 @. hoogle t fmap 18:51:14 Plugin `compose' failed with: Unknown command: "t" 18:51:21 D'awww. 18:51:29 type 18:51:38 @. hoogle type fmap 18:51:40 Parse error: 18:51:40 --count=20 "forall a b (f :: * -> *). (Functor f) => (a -> b) -> f a -> f b 18:51:40 " 18:51:53 Bahahah. 18:52:42 pikhq: easily fixable 18:52:44 run it past a run 18:52:45 i guess 18:53:05 http://lesswrong.com/lw/12s/the_strangest_thing_an_ai_could_tell_you/xc5 ← this is awesome enough that i want it to be true 18:53:37 oklofok: see /msg 18:53:43 -!- coppro has joined. 18:55:17 -!- augur has joined. 18:55:25 hi augur. 18:55:40 O_O 18:55:41 hi 18:55:50 i made a video of me repeatedly lunging a long, narrow part of my body at things, but only oklofok can see it. 18:55:56 (HYUK HYUK HYUK) 18:56:21 Is it your penis 18:56:32 slereah: obviously not 18:56:34 he said long. 18:56:35 * GregorR-L bashes his head into a wall. 18:56:41 augur: Well played sir :P 18:56:53 augur: ahahaha 18:56:56 i was about to make that joke anyway 18:57:02 what with estoppel being 13 and all 18:57:06 but slereah, you know. 18:57:22 and he isn't even a straight man 18:57:37 yeah i have terrible posture 18:57:50 i was referring to Slereah 18:57:54 i know 18:58:10 Eh, who is anyway :P 18:58:37 but slereah, you know. < wot 18:59:12 augur is confusing you with his awesome syntax powers. 18:59:15 BUT SLEREAH, YOU KNOW, IS ALL OVER THAT 13 YEAR OLD COCK LIKE FASTER THAN I AN REPLY 18:59:51 * GregorR-L hands Slereah his "honorary NAMBLA member" jersey 19:01:16 hm my monitor has a bug 19:01:22 there it flew away 19:02:14 no oerjan. if your monitor displayed weird stuff that's a software or hardware bug 19:02:16 not a monitor bug 19:02:52 must be an AGI then, since it was capable of flying away 19:03:10 :D 19:22:49 -!- augur has quit (Read error: 104 (Connection reset by peer)). 19:23:11 -!- augur has joined. 19:30:13 -!- oklofok has quit (Read error: 60 (Operation timed out)). 20:01:42 Have you read your SICP today? 20:02:22 yes 20:05:31 [[Developer mode can be accessed from the launcher screen of the Pre by typing in the phrase "upupdowndownleftrightleftrightbastart" (the infamous Konami code).] 20:05:32 ] 20:05:36 Okay, I want a Palm Pre. 20:08:33 -!- GregorR-L has quit ("Leaving"). 20:21:54 estoppel / ehird: why that nick? 20:22:05 I've used it sporadically for ages. 20:22:25 estoppel, I noticed it a few days ago. How do you pronounce it btw? 20:22:55 he's been estopped from using his real name, due to child protection laws 20:22:59 ĕ-stŏp'əl, says the conspicuously unsourced answers.com 20:23:12 ess toppel, where the e is eh not ee. 20:23:17 a sad and unreasonable story 20:23:29 AnMaster: and in IPA, 20:23:30 estoppel: Don't do answers.com; use Wikipedia, it's principal source. ;p 20:23:36 /ɛˈstɒpəl/ 20:23:38 estoppel, right 20:23:39 pikhq: *its; and you are wrong. 20:23:45 Wikipedia is ONE OF the sources of answers.com. 20:23:47 estoppel, is it supposed to mean anything? 20:23:56 AnMaster: justfuckinggoogleit.com 20:24:13 hey, wikipedia is a _tertiary_ source, iirc 20:24:18 (ɛ'stɒpəl) says the equally unsourced OED. 20:24:48 Or "({ope}{sm}st{rfa}p{schwa}l)" if I copy-paste directly. 20:25:07 They do IPA characters with tiny images. 20:25:23 You have an online OED accessthingy? 20:25:25 Want. 20:25:49 "Subscriber: Helsinki University of Technology" 20:26:33 "He worked for the Oxford English Dictionary from 1918, and is credited with having worked on a number of words starting with the letter W, including walrus, over which he struggled mightily." (http://en.wikipedia.org/wiki/J._R._R._Tolkien) 20:27:50 :D 20:27:55 There's this thing where one can add ".libproxy.tkk.fi" at the end of the domain name, login using the Shibboleth single-sign-on thing, and get any library-subscribed content without having to fiddle with SSH tunnels or such curiosities. 20:27:59 fizzie: now i want to attend that university. 20:28:02 wait ew 20:28:05 shibboleth 20:28:09 never mind 20:28:26 I would assume OED is a rather widely-subscribed thing. 20:28:34 AnMaster: did i mention i had a dream where you were talking about being tutored to personally by kucinich? 20:28:35 hm wait 20:28:36 yes i did 20:28:38 estoppel: Q? really? 20:28:40 (over irc of course) 20:28:43 EstQp@l? 20:28:44 augur: ? 20:28:46 craziness. 20:28:48 you brits. 20:28:55 that was not from a british site. :p 20:28:57 what i said 20:29:29 oed sais Q too. 20:29:37 craziness happens easily to brittle minds 20:29:39 which is expected; british english has Q. 20:29:59 Where is a q? 20:30:09 EstQp@l <--- there 20:30:44 But I said (ɛ'stɒpəl), the ɒ is "latin small letter turned alpha", aka low back rounded vowel; not a q. 20:30:48 augur, quite 20:30:50 fizzie 20:31:16 Q is sampa for turned a 20:31:21 Ah. 20:31:32 q, on the other hand, is sampa for q. 20:31:49 I can't read that notation. :/ 20:31:55 learn to. 20:31:57 fizzie, nor can I 20:32:03 yet augur wants us all to learn to 20:32:05 odd 20:32:09 think of it like an esolang! 20:32:23 augur, I don't plan to learn every esolang 20:33:29 I'm pretty sure every esolang put together has less instructions than a regular programming language 20:33:31 just think of how wonderfully esoteric it would be t+h bi eI)b@l t+h@ t+haI)p laIk DIs @nd h{v p+hip@5 Vnd3`st{_rnd ju! 20:33:58 Except maybe unikitten 20:34:14 hehe 20:34:20 unikitten will be made one day 20:34:25 once someone makes a strictly monospaced unicode font 20:35:47 ɛstɑpəl: ɪts kʰɔld lusɪdə gɹænd tʍɛɫv 20:36:14 pʰɔɪnt* 20:36:18 estoppel : How do you make a monospaced empty character? 20:36:29 slereah: with magic. :o 20:36:37 Slereah: — modulo special characters, of course. 20:38:49 I should found a university with a focus on not using shitty things like Shibboleth. 20:38:49 Trufax. 20:41:24 -!- comex has changed nick to comex_. 20:44:22 It seems my thereminning was for naught, as oklopol has disappeared. 20:53:58 -!- Gracenotes has joined. 21:15:30 -!- ais523 has joined. 21:52:13 "yep! i have seen people with 2 iphones. 21:52:13 i guess thats the only way they can really multitask for now." 21:52:29 haha 21:52:30 ais523: You have 1 new message. '/msg lambdabot @messages' to read it. 21:53:03 I didn't know lambdabot did that 21:53:09 also, why did it announce in-channel? 21:53:19 so you noticed it immediately 21:53:27 as opposed to noticing later "oh, a new tab with lambdabot on it" 21:53:41 a new tab that turns red and makes the IRC client flash at me? 21:54:07 At least it didn't announce the content in the channel :P 21:54:10 ais523: YOUR irc client. 21:54:17 GregorR: even though i sent it in channel :P 21:54:23 an IRC client that doesn't do nickpings is kind-of rubbish 21:54:30 (Which I assume is "hey ais i think ur hot lets cyber", because what else would a person send via lambdabot) 21:54:57 ais523: some people like to not be bothered 21:55:16 GregorR: 13:43 ehird: @tell ais523 wikipedians are arguing over whether to include the public domain rorschach test images on the article ... because it would make it harder for psychologists to use them, or something. http://en.wikipedia.org/wiki/Talk:Rorschach_test :not as though the test works any more than say, astrology :D not as though the test works any more than say, astrology... 21:55:18 So close enough. 21:55:37 Just wanted to tell him since he's tagged as "wikipedian" in my mind :-P 21:55:41 And I found it highly amusing. 21:59:01 -!- jix_ has quit (Read error: 113 (No route to host)). 22:02:01 brb. 22:04:49 -!- jix has joined. 22:08:36 hi ais523 22:22:19 a sacrum, two gnomes high-fiving, two black women with red hats low-fiving, a shitting giant, a bat, a violin with a sort of rotating razor blade deal, a kind of necklace made of almost axehead shapes, two giant mites sucking some qi out of a linear black hole, and standing on some dead things they probably conquered to get up, a deer god with flaming horns and breathing out smoke, sea creatures having a party like there's a sort of prawn at the top an 22:22:19 d two seahorses and some spiny fish one with a lobster claw 22:31:17 Is that your secret fetish 22:33:10 * oerjan expects that's from one of those recent rorschach threads 22:34:42 * oerjan points out that one thing he saw in that wp article was that _what_ you see is only part of the test, the rationalization for your choices afterwards iirc is even more important 22:34:56 or something like rationalization 22:36:02 mind you it might still be astrology, but it would be like the difference between a newspaper horoscope and a full chart, i think 23:04:15 -!- M0ny has quit. 23:11:52 -!- oklopol has joined. 23:13:25 estoppel: oklofok: what os are you using atm btw? and is your internet good enough to dl 23mb? <<< still vista, and ~ 23:15:25 ~ being "5 hours, 44 minutes left" :P 23:16:56 also why the fuck is my firefox in finnish 23:17:01 where can you change that? 23:18:17 where it says "Suomi" 23:18:25 * oerjan ducks 23:20:54 i have no idea how long it's been in finnish, i just realized something was wrong when comparing my "~ being..." message and the actual time left message in ff 23:21:32 and turns out they were in different langauges 23:21:38 *languages 23:24:56 estoppel: something smaller might be nice. 23:25:16 Man, that's a great description of unsafePerformIO. "We invent the world, perform an action on it, then destroy the world." 23:25:37 except it's the same world 23:25:53 Yeah, yeah, yeah. 23:27:01 i like to ruin other people's fun 23:27:07 estoppel: stop not being here 23:33:33 wtf, also µtorrent is in finnish 23:33:39 this is ridiculous 23:34:07 especially as about 50% of it is translated 23:35:40 -!- oerjan has quit ("Good yt"). 23:37:33 i hate how he actually gets the words right. 23:39:36 where is ehird? 23:39:44 oh wait 23:39:47 estoppel, there? 23:40:46 yes 23:40:48 now I am 23:40:57 23:24 oklopol: estoppel: something smaller might be nice. 23:41:00 it's only 3 minutes 23:41:05 and it'd look shit if i compressed it moe 23:41:13 more 23:41:15 well fuck. 23:41:51 i get like 2.5 kB/s 23:42:00 meanwhile, scientists have synthesized CP in a lab 23:42:05 -!- MigoMipo has quit (Read error: 110 (Connection timed out)). 23:42:06 by which I mean copernicium, the new name of element 112. 23:42:14 cp? 23:42:17 right. 23:42:19 :-D 23:42:25 Captain Planet? 23:42:27 oklopol: 2.5 kB/s → pause utorrent man 23:42:40 synthetic child porn 23:42:49 that was the joke 23:43:05 they cloned a human, but only used it for porn. 23:43:55 well i know, my point was the continuation, admittedly not funny, not that that was my intention anyway. 23:44:27 -!- BeholdMyGlory has quit (Remote closed the connection). 23:44:31 i never really tell "jokes" to be funny, i just tend to mimic what others do on channels. 23:44:38 which i guess means i do try to be funny 23:44:42 but only in the way a markov chain bot would 23:45:41 LOLOL THE GAME 23:57:18 i optimize for loggits 23:58:38 -!- coppro has quit (Remote closed the connection). 23:59:27 -!- coppro has joined.