00:08:48 Positive side of a signed 32-bit int with 8 bits stolen for type tag or flags or some such. 2^23-1 is also maximum bit width for a LLVM integer type in the IR. (That's pretty wide already.) 00:10:35 fizzie, well yes, it is more than enough 00:10:40 and yeah I guess type tag explains it 00:10:54 i8388607, presumably mapped to C as "signed very very long long int". 00:11:26 if each "long" doubles the size - signed long^23 int? 00:13:53 olsner, now type that out in a pastebin 00:14:13 olsner, anway, that seems too many? no? 00:14:27 or did you mean long*23? 00:25:30 -!- cheater2 has quit (Ping timeout: 240 seconds). 00:37:34 blah 00:43:01 -!- cheater2 has joined. 00:48:24 -!- Mathnerd314 has quit (Ping timeout: 245 seconds). 00:50:37 night 00:53:25 -!- Asztal has quit (Ping timeout: 245 seconds). 00:54:21 Protip: If you have a disability, and mind others with disabilities finding out, don't go to my school 00:59:42 ? 01:00:20 -!- Mathnerd314 has joined. 01:00:31 pikhq: don't ask, he doesn't want us to find out 01:00:32 My school just sent an email from the students with disabilities office 01:00:43 ah Cc: ? 01:00:47 They did it by putting each email address in the To: field, apparently 01:01:03 oerjan: Find out about... Wha? 01:01:51 * oerjan leaps gracefully from conclusion to conclusion 01:01:54 pikhq, he's suggesting that everyone here has a disabilty, and since it sounded like I don't want people with disabilities finding out.. 01:02:08 Sgeo: Alaas. 01:02:17 Sgeo: can I have the list? ;-) 01:02:20 no, I just have a few shady friends who like lists of email addresses 01:03:52 * Sgeo gives Mathnerd314 a list 01:03:56 heh 01:04:19 well, I'd need to track my "friends" down first 01:04:34 i guess they don't want you to find them either? 01:05:15 something like that 01:07:48 hmm... an esolang with email addresses :-) 01:08:37 TLD's are commands, usernames are variables, and domains get ignored 01:09:45 not certain what actual language to embed, though 01:10:00 Don't embed a pre-existing esolang! 01:10:18 Make one up from scratch! 01:10:26 I was thinking Haskell, actualy 01:10:30 *actually 01:10:35 That 01:10:41 That's a .. fairly big thing to embed 01:10:48 test 01:11:14 well, it's more like a DSL 01:11:56 Simple Programming And Mail 01:12:50 I could go small and just do some lambda calculus 01:13:10 oerjan, when thinking the ancronym, I ommitted "And" at first 01:13:51 well i tried with Address, but it didn't sound good 01:14:12 no shii 01:14:24 completely out of shii 01:16:00 Slightly Pedantic ActiveMail™ 01:17:34 Hello.World@print.com 01:18:31 one+two@add.com 01:18:47 something like that 01:19:38 not certain what to do with abuse@ webmaster@ etc. 01:19:59 and I doubt I'll implement it :-/ 01:20:05 send@mail.com 01:20:17 abuse would halt the program, i think. it would mean it got caught, after all 01:20:39 heh 01:20:48 maybe it should accept actual emails ;-) 01:21:07 and look at the "To" field to see what to execute 01:21:36 so if you put it on a mail server, you have to spam to send it messages :D 01:21:42 i'm thinking about lazy grid that uses HTTP as an IPC protocol 01:21:59 Cc too 01:22:00 maybe it should be coded in php for extra slowness 01:22:14 -!- Gregor has quit (Read error: No route to host). 01:23:27 -!- Gregor has joined. 01:23:52 no... too close to actual usefulness 01:26:32 ale jest dobry 01:26:35 ooops 01:26:39 wrong window 01:30:49 `translate ale jest dobry 01:31:29 but it is good 01:32:44 ale is no jest 01:33:42 And yet, it is. 01:34:03 it is, however, yeast 01:37:18 a bot? 01:37:20 `help 01:37:21 Runs arbitrary code in GNU/Linux. Type "`", or "`run " for full shell commands. "`fetch " downloads files. Files saved to $PWD are persistent, and $PWD/bin is in $PATH. $PWD is a mercurial repository, "`revert " can be used to revert to a revision. See http://codu.org/projects/hackbot/fshg/ 01:37:42 wow 01:37:50 `sudo 01:37:51 No output. 01:38:00 heh 01:38:16 Root cannot be had on that system. 01:38:27 oh? 01:38:29 libc won't let you. 01:38:32 famous last words 01:38:34 `ls 01:38:36 bin \ cube2.base64 \ cube2.jpg \ hack_gregor \ hello.txt \ help.txt \ huh \ netcat-0.7.1 \ netcat-0.7.1.tar.gz \ paste \ poetry.txt \ quotes \ share \ test.sh \ tmpdir.22913 \ wunderbar_emporium \ wunderbar_emporium-3.tgz \ wunderbar_emporium-3.tgz.1 01:38:53 `ls / 01:38:54 bin \ dev \ etc \ home \ lib \ lib64 \ proc \ tmp \ usr 01:39:04 `sudo ls / 01:39:05 No output. 01:39:53 `gcc -v 01:39:55 No output. 01:40:49 `run which gcc 01:40:50 /usr/bin/gcc 01:41:08 `run gcc -v 01:41:09 No output. 01:41:46 I don't see really see the point of hacking it 01:42:16 heh 01:43:17 Does it have backups? 01:43:40 probably 01:48:10 `run sudo 2> out.txt 01:48:12 No output. 01:48:33 `cat out.txt 01:48:35 /bin/bash: line 1: sudo: command not found 01:48:50 heh. no wonder it was failing ;-) 01:49:19 `uname 01:49:21 Linux 01:52:06 `uname -a 01:52:08 Linux codu.org 2.6.26-1-xen-amd64 #1 SMP Sat Jan 10 20:39:26 UTC 2009 x86_64 GNU/Linux 01:52:43 that xen looks unpromising :-| 01:55:03 i've sort of been guessing that the reason HackEgo is so dog slow at the first command you run is because it's booting up a virtual machine somewhere... 01:55:40 Gregor: is that right? 01:56:32 (mind you i don't really know what i'm talking about) 01:57:01 `uname -a 01:57:02 Linux codu.org 2.6.26-1-xen-amd64 #1 SMP Sat Jan 10 20:39:26 UTC 2009 x86_64 GNU/Linux 01:57:10 oerjan: No, that's not right. 01:57:14 we already did that 01:57:18 oerjan: I think it's just caching. 01:57:23 File caching. 01:57:28 ok 01:57:50 is it your own physical machine? 02:01:32 -!- Oranjer1 has joined. 02:04:15 -!- Oranjer has quit (Ping timeout: 246 seconds). 02:04:27 -!- Oranjer1 has changed nick to Oranjer. 02:23:07 I have rxvt on my DR800SG 8-D 02:23:14 Which I just got today and isn't even fully charged yet :P 02:24:34 DR800SG? 02:31:46 -!- augur has quit (Ping timeout: 248 seconds). 02:35:50 Sgeo: eInk-based reader. 02:36:06 Ah 02:36:14 * Sgeo misread that as elink for a few seconds 02:41:46 elk oink 02:48:35 b ad pun 02:53:12 are you saying it was b-grade? 02:53:46 -!- calamari has joined. 02:54:02 eek, a squid 02:54:04 imho 02:54:14 omg, it's calamari 02:54:46 hi nooga 02:55:05 hello, what's up? 03:01:51 oh, in that case i'm probably going to sleep 03:01:59 gnight 03:09:09 Yo 03:17:06 -!- nooga has quit (Ping timeout: 248 seconds). 03:25:35 -!- augur has joined. 03:29:04 -!- lament has joined. 03:48:59 -!- poiuy_qwert has joined. 04:13:04 -!- Oranjer has left (?). 04:14:39 -!- augur has quit (Ping timeout: 245 seconds). 04:26:34 -!- Oranjer has joined. 04:38:32 -!- MizardX has quit (Ping timeout: 276 seconds). 04:40:15 -!- augur has joined. 05:26:49 -!- calamari has quit (Quit: Leaving). 05:32:20 -!- oerjan has quit (Quit: leaving). 05:33:20 -!- jcp has quit (Read error: Connection reset by peer). 05:33:49 -!- augur has quit (Ping timeout: 245 seconds). 05:34:33 -!- jcp has joined. 05:40:01 -!- jcp has quit (Ping timeout: 240 seconds). 05:46:27 -!- zzo38 has joined. 05:46:49 Where do spider webs normally emanate from the spider's body? 05:47:01 the end of the abdomen? 05:47:09 I can see you changed the 332 topic line again 05:47:20 Oranjer: OK, thanks. 05:49:08 -!- oerjan has joined. 06:01:56 -!- Oranjer has left (?). 06:08:41 -!- augur has joined. 06:12:53 What exactly is the "end of the abdomen" 06:13:16 I am making more of my Wikipedia userpage now 06:14:31 zzo38: http://en.wikipedia.org/wiki/Spider_anatomy 06:14:45 Thanks 06:15:04 Now I have three Wikipedia pages open in three buffers 06:15:28 there's a nice diagram in the Internal anatomy section 06:15:48 Thanks, that helped 06:16:06 i guess you are looking for the spinnerets 06:16:10 Yes 06:16:17 You are correct 06:16:45 Sometimes I have a lot of wikipedia pages open at once 06:17:44 that's a common thing 06:17:59 although i've found it's much worse with tvtropes 06:19:00 but then that's an individual thing, some people don't get lost in tvtropes at all, or so they say 06:19:24 Actually the reason I have a lot of Wikipedia pages open at once is not that reason. 06:19:42 i recall xkcd has made comics for both sites about that problem :D 06:19:56 well i guess if you are actually doing _research_... 06:20:17 What number? 06:20:23 (I mean on xkcd) 06:20:33 i don't recall that, a sec 06:21:35 http://xkcd.com/214/ and http://xkcd.com/609/ 06:23:02 -!- jcp has joined. 06:23:44 I just played D&D today. Now I selected http://zzo38computer.cjb.net/dnd/options/Make_Food.s and http://zzo38computer.cjb.net/dnd/options/Remove_Hand.s as new spells, and yes the question about spiders is relevant here. 06:25:46 well spider silk isn't really food, although i _think_ spiders eat the old web when rebuilding 06:26:53 or did i just contradict myself there 06:27:10 That isn't what the relevance is, however. 06:27:40 -!- poiuy_qwert has quit (Quit: Leaving). 06:28:29 But thanks anyways. 06:29:43 wait, why would you want to cast "Remove Hand"... 06:34:44 I played D&D today. I used up all the webs unfortunately. But I increased experience level today and good thing I have more than 400 XP remaining because I need that much to cast a spell. Next time: I have to make Diplomacy to the beholder, and then Riichi, and also Zwischenzug..... 06:36:45 Do you like this?? 06:37:11 Do you like Riichi and/or Zwischenzug? 06:37:21 i don't play D&D 06:37:52 i have only played a single session of it in my life 06:39:20 Elaborate 06:39:43 it was at the local gamer convention once 06:40:08 a dungeon crawl, i played a paladin i think 06:41:04 What version? 06:41:11 i have no idea 06:41:25 it was > 10 years ago, though 06:41:57 possibly > 15 06:42:14 Did you have any spells/item? 06:42:23 How many eyes does your character have? 06:42:36 What other classes were the other player characters? 06:42:41 i am pretty sure it was a human, i don't remember that much else 06:42:48 OK 06:44:39 I have heard of a Paladin variant class called "DM's Paladin". 06:44:45 15 years ago implies AD&D. So... There's a whole lot of stuff that could've been. 06:45:02 In the "DM's Paladin" variant, you replace the picture of the paladin with Mother Theresa. 06:45:20 heh 06:45:41 The "Smite Evil" ability is replaced with "Hug Evil". 06:46:04 At high levels, the DM's Paladin even gains the ability to rip the universe a bit sometimes, whether you are meaning to or not. 06:47:38 I would likely not play a paladin character unless it was the DM's Paladin variant. 06:47:58 -!- FireFly has joined. 06:49:46 Also, maybe you didn't know, Riichi and Zwischenzug are not terms in D&D actually, anyways, but I try to do it in D&D anyways! 06:49:58 Riichi is in mahjong, and Zwischenzug in chess. 06:50:30 i don't know german chess terms 06:51:18 * oerjan googles 06:52:16 Do you know Japanese mahjong terms? 06:52:36 not at all 06:52:47 i considered that too obvious to comment on :D 06:53:20 * oerjan realizes doesn't know the norwegian term for zwischenzug either 06:53:24 *he 06:53:48 wikipedia has no norwegian link for it 06:56:44 hm seems the direct translation "mellomtrekk" is used, although i don't recall it 06:57:13 Do you understand what it is, however? And how I might try to use in D&D? 06:57:27 more or less 06:58:27 Do you understand anything about mahjong at all? 06:59:28 not the real came, which iirc you have already told is not the same as the simple pair matching solitaire i've seen on pc's 06:59:33 *real game 06:59:36 -!- tombom has joined. 07:00:33 OK. 07:01:03 (well simple and simple, i guess that can be hard too, because of hidden pieces if nothing else) 07:01:47 "Riichi" is something you can call if you have closed hand, you have to bet 1000 extra points and your hand is locked, so you can no longer adjust it. If you win, you earn +1 han for riichi, unless you also make "ippatsu riichi" or "ura dora" in which case you earn more than +1 han. 07:02:35 oh it's a betting game 07:03:09 -!- coppro has joined. 07:03:43 Actually, mahjong is not really a betting game, although you do bet sometimes. 07:04:54 What you have to do mostly, is make a hand with four sets and one pair, and avoid the other players doing the same. You can choose which one to discard on each turn. However, if you discard the tile someone else needed the last one for their hand, you have to pay them a lot. 07:06:04 ok 07:07:13 i don't really like games where i have to pay careful attention to what everyone else has 07:07:26 or even worse, might have 07:10:27 In Washizu Mahjong it is different, because you can see some of the tiles belonging to other players, if those tiles are transparent. (Washizu Mahjong uses both transparent tiles and opaque tiles. I have a Washizu Mahjong set.) Washizu Mahjong was invented by the fictional character Wahsizu Iwao, which was invented by Nobuyuki Fukumoto, who writes mahjong comics. 07:11:57 i think i'm going to bed 07:12:10 -!- oerjan has quit (Quit: Good night). 07:12:52 -!- zzo38 has quit (Remote host closed the connection). 07:24:10 -!- kar8nga has joined. 07:51:38 -!- tombom has quit (Quit: Leaving). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:12:04 -!- lament has quit (Quit: lament). 08:27:45 -!- FireFly has quit (Quit: Hey! Listen!). 08:40:40 -!- lament has joined. 08:49:26 -!- kar8nga has quit (Remote host closed the connection). 09:12:53 -!- lament has quit (Quit: lament). 10:12:38 -!- jcp has quit (Quit: I will do anything (almost) for a new router.). 10:17:35 -!- lereah_ has joined. 10:21:33 -!- Axtens has joined. 10:22:19 just wandered over from #rosettacode to see what happens here 10:23:06 there are very few esolans represented on RC ... BF, Befunge ... maybe a couple others 10:24:53 oh .. there's FALSE 10:59:40 The place has been mentioned on this channel a couple of times, but no-one seems to have been inspired enough to start mass-adding "our" languages there. 11:00:17 There's HQ9+, though that's bit of a joke. 11:01:02 Chef's an esolang too. 11:02:47 And SNUSP. 11:03:50 But not very many. Didn't check especially thoroughly there. 11:20:26 -!- wooby has joined. 11:25:37 hio 11:30:30 -!- Asztal has joined. 11:34:05 -!- oklopol has joined. 11:39:59 -!- ais523 has joined. 11:48:58 did anyone get any further with the MSG language as per http://esoteric.voxelperfect.net/wiki/MSG ? 11:53:29 a wire connects two objects, but '' sends to using .. so what does connecting two objects mean? 11:53:37 nothing? 11:54:11 and then you can just use passon to send stuff to an object without a wire 11:54:31 -!- Tritonio_GR has joined. 11:56:23 also what's the use of creating any new objects? do they do something with the messages you send them? 11:56:38 we should talk about Toi instead, if you ask me 11:57:50 -!- oklopol has changed nick to oklopod. 11:59:07 -!- cheater2 has quit (Ping timeout: 240 seconds). 11:59:09 have you seen rain fall on the surface of water? 11:59:26 that's just fucking awesome i stared at it for hours 11:59:30 maybe more like 3 minutes 12:02:10 -!- Axtens has quit (Quit: insanity). 12:04:43 -!- cheater2 has joined. 12:12:12 -!- FireFly has joined. 12:13:15 -!- nooga has joined. 12:14:16 -!- coppro has quit (Ping timeout: 246 seconds). 12:29:28 oklopod: yes, I have 12:36:13 cool 12:36:20 the people on the street didn't seem to see it 12:37:14 oklopod: do you mean, onto puddles, or onto lakes? I've seen both, but the puddles more often 12:37:20 the UK is really rainy compared to most countries... 12:37:48 it was a river of some sort 12:38:30 there were these small waves or more like ripples due to wind already, and then circles where rain fell 12:38:34 http://www.youtube.com/watch?v=C0c5yClip4o 12:38:39 Warning: Brain cells WILL die 12:38:56 so all sorts of stuff going on 12:39:15 that's the first warning about a link i ever took seriously 12:41:09 i'm learning all sorts of stuff 12:41:36 funny e=mc^2 joke in the beginning 12:41:42 not sure i get it 12:42:44 oklopod, I don't think it's a joke to her 12:47:45 so okay what she's saying is homeopathy works by curing diseases 12:48:11 and that physical models of the world have this concept of energy 12:51:24 chemistry background helpful :P 12:52:01 but i guess you can't argue with results 12:52:37 the guy's knee stopped squeaking 13:40:21 -!- Tritonio_GR has quit (Read error: Connection reset by peer). 14:12:43 -!- nooga has quit (Quit: Lost terminal). 14:57:31 argh, this is a bad cold... 14:58:31 you should do something about your energy state 14:58:49 your vibrations are totally off sync 15:00:47 oklopod, if that is the pun I think it is: AUGH 15:02:18 * Sgeo doesn't get it, except in reference to the video 15:02:34 Sgeo, you know what heat is physically right? 15:02:52 awib 0.2 is cute: http://awib.googlecode.com/svn/builds/awib-0.2.b (announcement at http://awibiswritteninbrainfuck.blogspot.com/2010/04/announcing-awib-02.html ) 15:02:55 (btw I meant "a cold" as in "sick") 15:02:58 AnMaster, oh 15:03:20 Deewiant, literate brainfuck? 15:03:45 or wait 15:03:45 no 15:04:10 wth is that? a polygot? 15:04:35 ah indeed 15:06:02 "Loops known to never be entered are removed." 15:06:11 It should remove all loops that are never entered 15:06:17 >.> 15:06:17 Sgeo, how? 15:06:43 Sgeo, I'm pretty sure that would be the same as solving the halting problem 15:07:07 * Sgeo knows that 15:07:12 * Sgeo was trying to be funny 15:07:19 oh, it wasn't very obvious 15:07:33 yeah i meant it as a reference 15:08:22 oklopod, reference to what? 15:08:58 well try grepping for reference, what could i be responding to 15:09:16 for "reference" 15:09:30 -!- BeholdMyGlory has joined. 15:09:53 i don't know why i have to be so mysterious, reference to the vid, 15:09:58 that Sgeo linked 15:10:11 oh that. didn't look at it 15:10:21 i know that 15:23:31 -!- nooga has joined. 15:39:24 -!- lereah_ has quit (Quit: Leaving). 15:40:56 -!- MizardX has joined. 15:43:09 -!- nooga has quit (Ping timeout: 260 seconds). 15:46:28 -!- zzo38 has joined. 15:46:30 I have fixed this spell: http://zzo38computer.cjb.net/dnd/options/Object_Mirrored.s 15:49:25 -!- kar8nga has joined. 15:50:15 It's here! 15:51:03 Sgeo: wtf? 15:51:17 you said that in three chanels for no good reason 15:51:18 ais523, my Nexus One 15:51:22 >.> 15:51:36 Hmm. Yup, 3 is the count. 15:51:49 * Sgeo didn an amsg 15:51:56 No, 4. 15:52:04 3 on this server. 15:56:09 i watched a few of those bush is an idiot videos so i figured it'd be fair to give obama a try too, politics is fun 15:56:27 It's a bit harder with Obama. 15:56:33 You actually have to search. 15:56:55 Unlike Bush, who has given the following line in a speech: "Hey, you want a taco?" 15:57:10 Meant it literally. He interrupted his own speech to ask that question of someone. 15:57:13 i dunno but these are really funny 15:58:24 there are fewer tho, most are just him stuttering, which isn't really surprising if you work 24/7 15:59:03 at least i assume presidents don't have that much free time, i have never actually been one 15:59:16 Bush had a lot of it. 15:59:29 He spent half his time in office on vacation. 16:07:39 -!- oerjan has joined. 16:09:40 also many of these are fun mixes and not whole speeches, they don't seem to be so much about comedy as they are about mocking the stupid nigger 16:10:05 fun mixes being when you repeat a stupid contradictory sentence 50 times 16:10:47 i need to find something else to waste time on 16:13:55 -!- nooga has joined. 16:14:01 party, nooga! 16:14:53 oklopod: seen the additions i made to the Toi page? 16:15:25 nnno 16:15:49 mainly what we talked about 16:16:40 -!- BeholdMyGlory has quit (Remote host closed the connection). 16:18:02 uuueua-e is pretty :) 16:18:16 yeah 16:18:44 i chose the tuple representation (how much to nest x and y in {}'s) specifically for that 16:19:08 otherwise it would have needed to use an adjustment with one of the other algorithms 16:19:22 okay cool stuff, i'll have to fix the interp as soon as possible 16:19:35 right after i've wasted some more time 16:23:18 should all commands be changed to vowels? 16:23:23 :P 16:23:34 it's not like there are programs out there that would suffer 16:23:47 eek 16:24:11 reading is bad enough with those ('s... 16:24:16 -!- charlls has joined. 16:24:54 (btw i convinced myself you cannot have [A]B) commands too without ambiguity) 16:25:21 ([])[]([])[] can parse in two ways 16:25:54 hmm, yes 16:26:38 now when exactly is it ambiguous, you could just disallow those cases 16:26:44 and that would be sweet 16:27:24 well you need the right combination of ('s and )'s so a [] can match in either direction 16:28:33 hm strictly speaking that first []) is redundant 16:29:00 ([]([])[] should also be ambiguous 16:29:10 it is 16:29:21 (redundant because it can only parse that way) 16:29:53 but are ([]([])[] and []([])[]) the patterns that characterize it 16:30:07 and what would that mean exactly, for their usability 16:30:53 if those patterns are anywhere in a program, with anything in between that parses, then parsing is ambiguous 16:31:10 err 16:31:24 yeah okay the sentence was correct, but i misparsed it after typing it 16:31:55 well ignoring (or treating as independent) things inside the []'s and also {}'s 16:32:23 now what does {}) mean exactly... 16:32:37 i wasn't going for that :D 16:32:41 it's the for-each OOPS NOT THAT ONE loop 16:33:04 heh 16:33:15 okay i'll start fixing the interp now 16:33:49 oh 16:33:53 by all commands to vowels 16:33:58 i mean all the commands except nesting 16:34:02 ok 16:34:04 and -<> 16:34:09 sounds more reasonable 16:34:56 r => y, p => o, and possibly i for input and p to have better semantics 16:35:19 and maybe n could be n still 16:35:24 and maybe i could buy a parrot 16:35:25 well except you have more that five (or sometimes six) 16:35:52 what do you mean 16:36:01 aeiou(y) 16:36:13 you're going to need finnish vowels too :D 16:36:37 you didn't mention . and : 16:36:58 oh well i thought those could be . and : too, because they print themselves so... 16:37:08 actually i originally thought just those two for output 16:37:18 but if i add bf complete output, then they become sort of 16:37:49 re-dun-dant 16:38:15 ok 16:38:38 ah there it is 16:39:06 i love how the example program only prints like 6 numbers 16:39:13 it always makes me smile 16:39:52 that inefficient huh 16:40:24 my sets are implemented unbelievably badly 16:40:54 would be easy to fix by for instance using python's set :P 16:41:17 but i didn't feel like it because i'm gonna make some sort of optimization (the hashing thing) anyway 16:41:26 in the next 5 years or so. 16:41:35 in good time. 16:41:47 nah won't take that long, i just added like 7 characters to toi.py 16:42:05 commented some stuff out 16:46:40 -!- charlls has quit (Quit: Saliendo). 16:47:48 -!- charlls has joined. 16:47:54 hm both of your patterns above contain []([])[] 16:48:22 i _think_ anything containing that may be ambiguous 16:48:52 ([]) is sort of a dual to [], it can match with a [] in either direction 16:49:29 -!- charlls has quit (Read error: Connection reset by peer). 16:49:49 except it can still happen that that ([]) doesn't match either neighboring [], but something farther away 16:49:50 -!- charlls has joined. 16:50:10 ...wanna write a program to actually add together two concrete numbers and print the result? 16:50:27 i'd like to test this thing and i'm you know a bit lazy 16:50:59 err 16:51:13 actually at least making a tuple is pretty easy since i can just... make it 16:51:14 well there's an addition program right there on the wiki, just prepend a tuple of your numbers and append a p (or o) 16:52:02 actually i'll upload it first, and ask questions later, so to speak 16:52:43 in the sense that i first do it and then start wondering if i should've 16:52:54 nm 16:56:11 -!- Oranjer has joined. 16:56:22 yay new version is dl'ble 16:56:35 now let's see if it works 16:56:40 and if the example program works 16:57:01 not that i don't trust your magical powers 16:57:20 good, good, then i don't have to 16:57:47 :) 16:58:08 i actually don't have -e yet, i considered adding -e as a separate command, and not letting you use it in the <> notation otherwise 16:58:25 feels impure to let just one letter in there 16:58:26 ok 16:58:51 if there was also E or something else, say if numbers are added, then definitely 16:59:41 btw often when i say i've thought about doing something i'm just coming up with it on the fly 16:59:53 i don't always realize this until i've said it 17:00:16 sometimes i do but who cares it's more convincing than hey my brain wants to tell us something 17:00:35 i don't know what it is yet but it's confident about it 17:00:36 my brain says that's ok 17:00:47 ok 17:01:09 that's intuition 17:02:50 hey my intuition wants to share something with us let's listen 17:03:03 that sounds a bit less than professional 17:04:49 anyway, see you later 17:05:14 -!- oerjan has quit (Quit: Alligator). 17:08:12 aaand time to debug two programs at once 17:08:17 the addition does not work 17:08:19 :P 17:10:18 this language is a bit hard to read, it's as if my brain was used to thinking ('s need a matching ) 17:19:38 -!- tombom has joined. 17:31:17 -!- nooga has quit (Read error: Operation timed out). 17:45:23 wow HUGE hail 17:45:55 like almost a cm in diameter 17:57:13 oerjan: there was no error really, i just didn't have S be the tuple, but had S contain the tuple 18:01:00 p, which is called d now, has updated semantics that make it nice for debugging, d as in debug prints stuff in the future format for adding sets in code, which is the <> notation plus numbers, <<0>> gets printed like <1> 18:01:32 it's quite beautiful to watch it calculate 3+2 for like 6 seconds 18:01:44 i dunno why i love slowness so much 18:01:47 slowth 18:06:26 -!- seph1 has joined. 18:06:45 -!- augur has quit (Ping timeout: 246 seconds). 18:08:52 * seph1 looks around 18:11:49 Why does the gopher protocol handler I wrote in my browser sometimes break and it reverts to the built-in Mozilla handler until I restart the browser? 18:18:23 Hay! Someone changed one of the userboxes, it now says: "This user thinks in bytecode and dreams of electric sheep." 18:18:38 Here is another one which used to be different when I added it: "This user thinks that the communists ruined the beauty of Chinese characters by simplifying them." 18:21:12 I don't like it much when someone says "this software is for PC" but it really meant it requires Windows. To me, "this software is for PC" should mean that it runs on IBM PC, and does not require an operating system. 18:23:35 -!- nooga has joined. 18:27:44 Knowledge is knowing that tomato is a fruit. Wisdom is knowing that you don't put tomatoes in fruit salad. 18:29:32 Please don' t cross any railings lest suddenness happens! 18:29:39 If they don't have a scientific name for the spider, they don't know what they're doing. 18:30:04 Autocomplete me: "black people ca" --> "black people can secretly levitate" 18:30:30 interesting 18:31:14 -!- augur has joined. 18:31:19 -!- Phantom_Hoover has joined. 18:31:45 <<> << 2 >>> << 3 >> 18:31:46 ( ( ({([r]u}-<<>> { ([r] } rrr 18:31:46 [ ( ({([r]u}-<<>> { rrr ua uuue } 18:31:46 -( ({([r]u}-<<>> { rr r uu } ] 18:31:46 -( ({([r]u}-<<>> { ([r] } rrrr d 18:32:06 err i actually meant to paste just the first line... i think 18:32:11 {}{}{}['] 18:32:21 maybe i didn't think 18:32:24 On the same lines as what I was talking about last night, can I just load some x86 machine code (not an exec format like ELF) and execute it? 18:32:39 Phantom_Hoover: where? 18:32:43 oerjan: numbers now implemented 18:33:01 nooga: Soory; into memory. 18:33:11 s/Soory/Sorry/ 18:33:45 under what OS? 18:34:10 Linux. 18:34:11 Phantom_Hoover: You can emulate it using Bochs 18:34:14 you can 18:34:29 it's a bit tricky but sure, possible 18:34:42 zzo38: I could, but I'm not doing this for practical reasons. 18:35:08 try mmap 18:35:14 nooga: I've tried a simple mmap-jmp thing in assembly, but it segfaullts. 18:35:22 it shouldn't 18:35:34 hmm 18:35:35 strace suggests that it's segfaulting at or after the jump. 18:35:51 let me check my old code, i've got this implemented somewhere 18:35:52 You can't do it in protected mode, because it requires the kernel to know the format so that it can be loaded. 18:36:16 So you can't put some machine code in memory and jump to it? 18:36:50 i did that, let me think 18:36:59 Yes you could, but if you are in protected mode, you are still in protected mode. In addition, you can't just do that without a loader. Protected mode requires the kernel to load it at first. 18:37:00 You might need to call mprotect, to make the region executable. 18:37:36 Or use anonymous mmap() with the right protection flags; either-or. 18:38:09 I now have the quote about tomatoes in fruit salad on my Wikipedia userpage. 18:38:15 Maybe not necessarily anonymous either if you're loading from a file, I guess. 18:38:51 PROT_EXEC|PROT_READ|PROT_WRITE 18:38:55 for mmap 18:39:37 zzo38: if you've got a running process, you can omit kernel's loader and exec 18:40:35 gdb'ing a breakpoint at the address you jump into is also always a possibility. 18:41:40 nooga: Tried that. fizzie: It's written in assembly (inline drives me mad), so there isn't any debugging information. 18:41:55 just uh 18:42:25 If you wrote it in assembly, you shouldn't need debugging information; just use the disassemble command. 18:43:06 maybe the code has some adresses that need to be shifted 18:45:23 It might be because mmap doesn't return in eax. 18:45:49 http://stackoverflow.com/questions/2019923/executing-machine-code-in-memory 18:47:55 I tried that. 18:48:04 Didn't work. 18:48:05 18:35 < Phantom_Hoover> strace suggests that it's segfaulting at or after the jump. 18:51:17 what 18:51:28 i didn't paste that 19:11:14 -!- oklopod has quit (Ping timeout: 248 seconds). 19:12:48 -!- oklopod has joined. 19:26:41 -!- nooga has quit (Ping timeout: 260 seconds). 19:34:08 ais523, strange thing from gcc configure (you might find it funny): 19:34:12 checking for x86_64-linux-gnu-ar... no 19:34:12 checking for ar... ar 19:34:12 checking for ar... no 19:34:12 checking for x86_64-linux-gnu-ar... no 19:34:12 checking for ar... ar 19:34:17 gcc configure is broken 19:34:27 and the only issue there is it isn't showing the paths 19:34:29 first it find ar, then it doesn't, then it finds it again 19:34:34 ais523, ah 19:34:38 it looks funny though 19:35:41 -!- kar8nga has quit (Read error: Connection reset by peer). 19:36:39 ais523, also I found out that to actually get gcc to build with a specific rpath I need something like: 19:36:40 LDFLAGS=-Wl,-rpath,/home/arvid/local/llvm/2.7/lib ../gcc-source/configure [...] 19:36:40 make LDFLAGS=-Wl,-rpath,/home/arvid/local/llvm/2.7/lib LDFLAGS_FOR_TARGET=-Wl,-rpath,/home/arvid/local/llvm/2.7/lib BOOT_LDFLAGS=-Wl,-rpath,/home/arvid/local/llvm/2.7/lib -j2 19:36:49 as in, all of those LDFLAGS are required 19:37:26 ais523, that I find really wth 19:37:28 wtf* 19:41:00 -!- alise has joined. 19:41:30 A confusion of notions 19:41:47 -!- nooga has joined. 19:42:14 hi alise 19:43:19 ais523, any progress at with feather btw? (It was weeks since I asked last time!) 19:43:30 no, why would you expect me to have done? 19:43:34 given that I'm pretty RL-busy atm 19:43:42 ah 19:43:56 ais523, I have been RL-busy too, so wouldn't have noticed 19:45:09 Unit news update! Nothing much. At all. Like, barely anything. I discovered there's a /b/tard there. So you can imagine how quite boring my week has been in general if that is big news. 19:46:14 -!- seph2 has joined. 19:46:43 what's a good prime? 19:46:45 -!- seph1 has quit (Read error: Connection reset by peer). 19:47:01 alise: i made a language called toi and i've been advertising it all winter 19:47:10 oklopod: I heard. 19:47:13 :< 19:47:18 -!- zzo38 has quit (Remote host closed the connection). 19:47:18 A good prime for what? 19:47:20 Generally anything "really big" is nice. 19:47:31 give me something relatively big 19:47:37 but not *that* big 19:47:48 How many decimal digits, approximately, are we going for? 19:47:53 Want to fit it into a 32-bit integer? 19:47:54 ~7 19:47:57 i don't care 19:48:08 but ~7 19:48:25 lemme look 19:48:34 oh you heard in the logs? 19:48:46 not really a question 19:48:49 I just saw today's and you said "toi". 19:48:53 So. 19:49:14 oklopod, a good prime? what about 3? 19:49:26 optimus prime, apparently 19:49:29 does 1299827 sound nice to you? 19:49:31 oh 19:49:38 (whatever that is) 19:49:41 there are a lot of others at http://primes.utm.edu/lists/small/100000.txt, but 1299827 is nice because it is the last one. 19:49:45 anyway it's neat, currently trying to optimize the interpreter so that you can manipulate numbers greater than (ridiculously small number) 19:50:21 alise: how far from edinburgh are you? 19:50:21 if 6 is ok and you've suddenly become a decimal fan, 888887 is nice because it has a lot of 8s in it 19:50:24 actually the current interp can barely handle operations on numbers of size 7, but you could easily go to 20 with simple optimizations 19:50:32 also 1000003 19:50:34 that's 7 19:50:40 nooga: why? 19:50:43 wanna visit? 19:50:51 no 19:50:59 why then 19:51:34 My Oracle (name of Maps, Google) tells me that road separates me and Edinburgh by 95.8 miles. 19:51:41 i'm just trying to make myself sure that the distance is big enough 19:51:42 It may be less if you count, say, lakes as being passable. 19:51:45 uuuuffff 19:51:53 I'm not going to murder you. 19:51:59 still 19:52:07 I'm imprisoned Monday-to-Friday; too tired on Friday; and hurriedly doing more interesting things the other two days. 19:52:30 Good afternoon, madame alise. 19:52:46 * alise wonders if "madame" is correct for this nick's customised gender structure.. 19:53:03 I think so. 19:53:03 *...; .. is definitely not correct anywhere. 19:53:46 i think i'm going to dring with scots 19:53:49 drink* ffs 19:53:55 So. Unit has been motherfucking boring. Got it. 19:54:18 Though a bad idea, you *could* make it much more interesting by feigning various mental disorders. 19:54:45 Hallucinations are ever-popular. 19:54:47 "I can't go to class today... the /other beings/ are there." 19:55:04 "Ford^WNurse, you're turning into a penguin. Stop it." 19:55:56 What's this about Edinburgh? 19:56:19 http://www.youtube.com/watch?v=TeOvMhkK5pI CTO 19:56:28 Phantom_Hoover: i'm in EDI 19:56:30 Presumably, nooga arrives there sometime. 19:56:33 ...Or in the past. 19:56:50 nooga: You know, if you visited me I'd only slightly murder you. 19:56:53 I'm stuck here till monday 19:57:05 alise: bah, i don't want to 19:57:13 oklopod, what do you mean "of size"? 19:57:28 alise: Why do you want to kill nooga? 19:57:30 "Stuck"; a nice word to describe Britain. 19:57:33 Phantom_Hoover: He's irritating! 19:57:47 *runs like hell* 19:57:47 i prefer scots... i can't understand their blabbering and they're too drunk to laugh at me ;] 19:58:10 They all think I'm English... 19:58:23 nooga: You just need to reverse the Great Vowel Shift. ;) 19:58:32 ;p 19:58:42 pikhq, huh? 19:58:50 The Great Vowel Shift of 1822. 19:58:51 And, depending on your accent, strip out ~half the "r"s. 19:59:00 A war in the land of linguistics! 19:59:03 RRRRRRRRRRRRRRRRRRRAIT 19:59:04 alise: XD 19:59:08 alise: I thought it was a drawn-out thing. 19:59:09 Lo, prescriptivist blood did spill! 19:59:10 MAIT 19:59:18 http://en.wikipedia.org/wiki/Great_Vowel_Shift 19:59:21 THE TIMES THERE ARE ALL LIES 19:59:22 ALL LIES 19:59:26 WRITTEN BY THE ENEMY 19:59:29 also I think the Scottish accent isn't too hard to understand. With the exception for the odd strange phrase. But much less so than Australian I find 19:59:38 E before I except in a few rare cases. 19:59:57 beh, i've been in oysralia an it was okay 20:00:02 AnMaster: One of the most notable bits about the Scots *language* is that it retains a large number of vowels from before the Great Vowel Shift, IIRC. 20:00:06 Trying to rationalise English spelling is pointless. 20:00:11 It's just insane. 20:00:22 pikhq, remind me, what was the Great Vowel Shift now again? 20:00:30 http://en.wikipedia.org/wiki/Great_Vowel_Shift 20:00:35 Oh, I forgot; still ignored. 20:00:37 Child. 20:00:47 (I actually did forget, for once.) 20:00:49 i think scottish should write english using danish alphabet ;p 20:00:55 All the vowels shifted in Middle English over some 100 years. 20:00:58 or something like that 20:01:02 This produced Early Modern English. 20:01:08 nooga, what? with ø and æ? 20:01:12 uhum 20:01:26 and other weird vowels 20:02:19 oh, btw. i've went to a museum and saw a book written in older english with all that f-like characters we used to use here some time ago 20:02:21 AAAARRRGH! I stumbled into a Party Political Broadcast! 20:02:24 It was technically also occuring well into the 1700s, but it's the initial shift into Early Modern English that's actually interesting. 20:03:24 Phantom_Hoover, what is that? 20:03:42 pikhq, right 20:03:59 Hmm, MathJax = jsMath's next version. I thought it was a ripoff. 20:04:02 AnMaster: "Vote for me" stuff. 20:04:17 Also, the *degree* of the shift produces a large amount of the variance in English dialects in the UK. 20:04:25 Phantom_Hoover, as in, an ad? 20:04:29 Phantom_Hoover: Which party? 20:04:31 -!- jcp has joined. 20:04:35 AnMaster: An ad that lasts five years, sure... 20:04:48 pikhq, heh 20:04:50 (not so much in the US. We forked from a few dialects and had a decent number of our own vowel and consonant shifts) 20:05:11 alise: Tories. 20:05:21 Phantom_Hoover: RUN! RUUUUUN! 20:05:29 hrm 20:05:32 You are not safe! 20:05:34 food 20:05:35 NOBODY IS SAFE 20:06:15 alise: I tried, but by the time I realised I had been listening to Cameron it was over. 20:06:24 If only the Great Vowel Shift hadn't coincided with the printing press being introduced in Britain. 20:06:25 in scootland 20:06:27 The rapture is at hand. 20:06:38 Woe, oh woe. 20:06:57 Really? I haven't noticed any Christians disappearing... 20:07:12 Though I try to dissociate with the strongly-religious... 20:07:13 The... non-Conservative rapture!!! 20:07:16 (this is the reason for much of our bloody bizarre orthography) 20:07:23 Every non-Conservative shall be sent to a land of pain and torture! 20:07:32 It is the singularly most unrealistic rapture possible, which is EXACTLY WHY IT'S HAPPENING! 20:07:36 rapture rapture 20:07:58 Note: the land of pain and torture is more commonly known as "a Britain governed by the Tories". 20:08:44 At least it could be worse. 20:10:17 All I can think of is the BNP. 20:10:17 Well, and UKIP. 20:10:17 And a dozen other parties. 20:10:17 But they're not exactly at risk of running the country. :-) 20:11:14 Or the Tories might not have decided that moving somewhat to the left was a good idea. 20:11:57 -!- nooga has quit (Ping timeout: 260 seconds). 20:12:17 Hi alise 20:12:32 Somewhat; but that's still not nearly left enough. Maybe a few more minutes 'til meltdown, but what could we do except come more to the sickening reality of our imminent demise? 20:12:43 Or, you know, maybe I'm overly melodramatic. 20:13:03 * Sgeo has his Nexus One in his hand 20:13:10 -!- wooby has left (?). 20:13:24 Sgeo: Good boy. 20:13:24 Sgeo: Where else? 20:13:28 Phantom_Hoover: HIS PANTS 20:13:40 Thanks for that image... 20:14:03 very strange thing happened 20:14:11 I'm not allowed to put the SIM card in it though, and I don't have the password for the wireless with me 20:14:14 booted an old dell computer with an usb keyboard attached 20:14:18 But I did put the SIM in anyway earlier 20:14:19 know what BIOS told me? 20:14:21 So I got to play a bit 20:14:31 "Please attach USB keyboard to port at the back of computer" 20:14:31 Right now, using it as a VERY expensive MP3 player 20:14:45 I had connected it to one at the front 20:14:48 very strange 20:15:07 I'm not allowed to put the SIM card in it though, and I don't have the password for the wireless with me <-- why aren't you allowed to do that? 20:15:33 My dad wants to hide the fact that he bought a new phone for me from my step-mother 20:15:53 When my step-mother's mom comes back, I'm just supposed to say it's a PDA 20:15:58 Sgeo, so, you won't ever be able to use it as a phone? 20:16:00 Eventually, we'll get a new line for it 20:16:05 huh 20:16:16 Sgeo: Your family is crazy. :-) 20:16:28 And in the process, costing money, because my dad's worried about my step-mother being upset about spending money 20:16:29 alise, yes 20:16:46 Sgeo: How about this for a line: "It's my dad's; I'm borrowing it". 20:16:53 bbl 20:17:05 Is there anyone in a position to upgrade the wiki? It's using a 2-year-old version of the wiki software. 20:17:10 alise, when my step-mother's mom sees me around with it all the time? 20:17:28 Well, then there is no real line you can take. 20:17:49 Phantom_Hoover: Only graue, and disturbing him usually leads to Monstrous Things. Not really, but we're all pretty content. 20:18:02 Sgeo: It's a phone, it was bought. Hiding these terribly obvious things is impossible. 20:18:23 I seem to recall thinking that there was something useful that the wiki didn't have, but I forget. 20:18:24 alise, it's temporarily being hidden, not permanently 20:18:26 But I agree 20:18:55 The controls for Frozen Bubble on Android are a bit unintuitive 20:18:58 "It's fine that money was spent and hid it from me. If you'd just spent it and /not/ hid it... well, then there'd be trouble!" 20:20:30 I like big numbers. 20:20:35 Phantom_Hoover, probably less security issues ;) 20:21:43 Phantom_Hoover: There is; probably lots. 20:21:46 But eh. 20:22:03 * Sgeo hasn't followed MediaWiki updates since.. 2004, maybe? 20:22:05 2006? 20:29:32 hi 20:29:43 hi again 20:30:42 -!- charlesq__ has joined. 20:32:52 Sgeo: Your family is freaking crazy. 20:33:55 -!- charlls has quit (Read error: Connection reset by peer). 20:34:23 * Sgeo decides that the trackball is useful for something: Playing Frozen Bubble 20:36:27 So, /me has a long term project. 20:37:20 Oh? 20:37:32 Sgeo, your phone has a track ball? 20:37:39 Sure. 20:37:57 Sgeo: A computer algebra system/dependently-typed programming language: two for the price of one. 20:38:21 pikhq, no it is a fairy tail. It is a classical motif. Step mother and that ;) 20:38:21 Sounds fun 20:38:21 This will be the basis of my OS. Plus, a large database of constructions of mathematical objects in this language, from the empty set to the (computable) reals and beyond. 20:38:31 I should probably learn what dependent typing is. 20:38:36 Sgeo: Oh, /theorem prover, too. 20:38:45 Dependently-typed programming languages <=> theorem verifiers. 20:38:57 Add lots and lots of sugar and automated tactics and you get a full-blooded theorem provers. 20:38:58 *prover 20:39:08 AnMaster: But where's the fairy godmother? 20:39:53 pikhq, you have to to move with the times. Gender equality is all the rage these days. I would say "whoever bought you a Nexus One" 20:40:20 That's his father, not his godfather. 20:40:26 And still not a fairy. 20:40:57 Did you know that 11^11 = 285311670611? 20:40:58 * Sgeo takes a pointless video of IRC with his phone 20:41:00 I bet you didn't. 20:41:16 alise: No, but my computer could soon discover it. 20:41:24 Indeed it could. 20:41:27 The video mode doesn't have auto-focus :( 20:41:27 And that is the beauty of computers! 20:41:33 :) 20:41:33 That's his father, not his godfather. <-- hm true 20:41:52 but wrt. fairy: in disguise of course 20:42:03 That makes Sgeo fae. 20:42:14 pikhq, sure it is inherited? 20:42:44 pikhq, I thought it was more a job description (or maybe that is a unique feature of Discworld faeries?) 20:43:07 That's a unique feature of Discworld. 20:43:15 You fail at the good folk. 20:43:27 pikhq, sure, but I prefer the Discworld variant 20:43:42 pikhq, plus we don't have this in Swedish folk lore 20:43:46 we have different stuff 20:44:01 I prefer the good and proper folklore variant. 20:44:18 Before they got to be all nice, pretty, shiny, and nice. 20:44:42 pikhq: Also, n^n = pi, where n = e^{W(\log{\pi})} ~ 1.85411. 20:44:59 Self-exponentiation is fun. 20:45:03 pikhq, hm in the folklore, are elves == faeries? 20:45:08 AnMaster: no 20:45:15 What is "? 20:45:17 W? 20:45:31 http://mathworld.wolfram.com/LambertW-Function.html 20:45:46 AnMaster: No, different folklore. 20:46:08 pikhq, huh 20:46:21 Is log(0) just undefined? 20:46:40 Phantom_Hoover, yes? 20:46:48 yes 20:46:51 OK. 20:47:32 Though it's hard to say, as what exactly constitutes a "fairy" changes from tale to tale. 20:47:38 Sometimes, it will include any magical being. 20:47:39 Indeed for any m, n^n = m is solved by n = e^W(log(m)), so long as e^W(log(m)) - 1 != 0, and log(m) != 0. 20:47:55 How do I know this? The oracle of Wolfram Alpha, naturally. 20:47:56 Phantom_Hoover, remember what log actually means. y=log_a(x) <=> a^y = x 20:48:02 How to win: CHEAT 20:48:07 Phantom_Hoover, you can't get 0 there. a^0 = 1 20:48:28 ^echo a^0 is undefined. 20:48:28 a^0 is undefined. a^0 is undefined. 20:48:32 oh wait it's ignored 20:48:35 ]oi a^0 is undefined. 20:48:38 aw, it's gone 20:48:47 !sh echo a^0 is undefined. 20:48:51 a^0 is undefined. 20:48:55 hooray 20:48:59 another bot for AnMaster to ignore 20:49:13 huh why are the bots spamming 20:49:19 Big thing, though: elves are Germanic folklore. Fairies are Celtic. 20:49:31 spamming truth, yeah 20:49:36 also, a^0 = 1 20:49:42 not undefined 20:49:47 pikhq: please correct AnMaster's error 20:50:13 AnMaster: The bots are not spamming, alise is making use of the botten. 20:50:26 pikhq, well he is incorrect. a^0 = 1 for all a 20:50:28 well 20:50:33 not for 0^0 iirc 20:50:42 but for all a != 0 20:50:55 http://en.wikipedia.org/wiki/Exponentiation#Exponents_one_and_zero 20:50:59 see there 20:51:01 alise: He's right. 20:51:08 just checked on my calculator too 20:51:12 it does what I said 20:51:20 (TI-83+) 20:51:34 I'm not sure what that property made convenient, though. 20:51:58 (I can only presume that was defined for convenience's sake somewhere) 20:52:10 a^0 is /not/ defined 20:52:17 a^0 is just most conveniently 1 most of the time 20:52:27 er wait 20:52:32 i thought he said 0^0... 20:52:42 holy shit, i've mistyped it all the way above 20:52:45 pikhq, wikipedia seems to try to explain that 20:52:51 ... :|, forgive me i've just come back from hell 20:52:56 but I can't paste it since the math is rendered as images here 20:52:59 alise: forall a where a != 0, a^0 = 1;forall a where a = 0, a^0 is undefined. :) 20:53:03 yeah 20:53:06 AnMaster: Is a thinko apparently. 20:53:08 although using a TI-83+ calculator to verify mathematical things is lunacy 20:53:16 pikhq, hm? 20:53:23 Pretty damned bad one, but hell. I've done worse. 20:53:30 AnMaster: He's been thinking you were discussing 0^0. 20:53:38 oh, well I said I didn't 20:53:44 Yes. 20:53:50 Like I said. Thinko. 20:53:51 anyway 20:53:57 a log_0() doesn't make sense 20:54:08 thus a = 0 would make no sense whatsoever in this context 20:54:22 log_0 is... Probably stupid. 20:54:40 pikhq, is log_0 even definable? 20:55:22 AnMaster: Not as a function. 20:55:52 lets see, log_a(x) = ln(x)/ln(a) right? 20:55:56 or was it the other order? 20:55:59 0^0 = 1 by knuth 20:56:01 log_0(x) = nullity 20:56:08 in which case log_0() is not defined yeah 20:56:12 oklopod: of course, for almost all purposes 0^0=1 20:56:13 pikhq, then how else could you define it? 20:56:16 oklopod, huh? 20:56:29 Hmm. Actually, yeah, log_0(x) is most definitely a function. log_0(x) = _|_ 20:56:30 >:D 20:56:37 he said it should be 1 20:56:48 pikhq, yes it is undefined for all values 20:56:56 well ln(0) is only undefined if log_e(0) is undefined 20:56:58 circularity! :-D 20:57:00 oklopod, huh 20:58:40 alise: Well, lim x->0 log_e(x) = -oo... Which makes lim a->0 log_a(x) = 0, I think... Not useful, though. :) 20:59:45 who let you define x/-oo = 0 EH 20:59:46 EH EH 21:00:05 MY ASS 21:00:19 don't get no mo lim x->-oo n/x on me beyotch 21:02:03 pikhq, heh 21:03:10 oh btw from logs: "12:53:08 although using a TI-83+ calculator to verify mathematical things is lunacy" <-- sure, I didn't actually need it to know I was correct. 21:03:20 were* 21:03:27 More like a TI-83+ is not a paragon of mathematical precision. 21:03:36 And if you are to read logs for the purpose of conversing with me, unignore me. 21:03:37 -!- Slereah has quit (Ping timeout: 240 seconds). 21:04:38 15:03 < alise> And if you are to read logs for the purpose of conversing with me, unignore me. 21:04:46 Smartest thing I've heard said all week. 21:05:14 Using bots to make snarky comments, on the other hand, is A-OK. 21:05:14 I only read it because I wanted to see how alise reacted to noticing he was wrong 21:05:15 :P 21:05:41 AnMaster is doing a very bad job of attempting to trod on a dog with a bullet in its chest. 21:05:49 Like with socks. 21:05:52 I don't plan to continue to read the logs further 21:06:00 AnMaster: Dude, seriously, /unignore him or *actually ignore him*. 21:06:17 pikhq, yes I closed the log now. 21:06:23 Your ignoring thing is like "LALALALA IM NOT LISTENING", except somewhat less infantile. 21:06:38 alise: Hah. 21:06:53 AnMaster? --Less infantile? 21:07:06 I'm actually somewhat infantile in a quite literal sense, at least I have an excuse! 21:07:40 alise: Vi vejnas unan Interneton. 21:07:55 Ixnay on the Esperanto. Ay. 21:08:10 日本語が良いか。 21:08:25 Your caret is a carrot. 21:08:32 (THAT WOULD BE AN AMAZING FONT) 21:09:00 Wouldst thou prefer a more Anglo-Frisian tongue? 21:09:39 If so, then thou hast won one Internet. 21:09:42 okay i have utterly failed to optimize this thing to handle numbers without adding special code for them :( 21:09:45 Very Modern English would work, but -- not too modern. 21:09:57 oklopod: tell me how it goes and i'll sprinkle magic on it 21:10:37 -!- Slereah has joined. 21:10:51 Photographic jesus 21:13:10 The reproach. 21:14:25 code is linked on the page 21:14:58 oklopod: link the page 21:15:02 the basic idea of mine fails because even though i got memory usage down, turns out constructing the numbers takes about the same amount of time 21:15:06 I am a genius and a prodigy; you do the banal work. 21:15:16 I even get computers to do most of my arithmetic for me. 21:15:17 http://www.esolangs.org/wiki/Toi 21:15:19 :P 21:15:46 "There is no set called the error set." 21:15:51 is there a set called the purple banana set? 21:15:51 well there isn't 21:15:58 no, why would you think that 21:16:10 -!- pikhq_ has joined. 21:16:27 well i wouldn't think there is a set called the error set either 21:17:09 Your ignoring thing is like "LALALALA IM NOT LISTENING", except somewhat less infantile. <-- iirc alise said that phrase a few times 21:17:22 good point, anyway the point of the language was to make something where all operations are "global" in some sense 21:17:43 it's a rather new paradigm, afaik 21:17:53 oklopod: well optimising numbers here ~= optimising von neumann ordinals basically yeah? 21:18:04 ~= optimising certain sets 21:18:13 absolutely horrible paradigm implemented with a language with a horrible syntax that's inherently horribly slow 21:18:14 -!- pikhq has quit (Ping timeout: 276 seconds). 21:18:14 but anyway 21:18:17 so compress sets. that's my amazing prodigal discovery 21:18:19 yes 21:18:24 pay me now 21:18:26 (in money) 21:18:29 yeah but operations on the sets........................... 21:18:37 i suppose everything's solvable 21:18:39 optimise them also 21:18:42 but it's not trivial :-( 21:18:55 how slow is constructing a 7-digit number exactly? 21:19:03 well i can get up to the number 12 21:19:04 well, roughly 21:19:06 then it hangs 21:19:12 are we talking on the order of years here? 21:19:17 millennia? 21:19:17 12 takes a few minutes 21:19:19 days? 21:19:23 exponential grown 21:19:25 *growth 21:19:25 alise, http://www.youtube.com/watch?v=C0c5yClip4o 21:19:30 oklopod: I was about to ask about the growth 21:19:32 so infinite time 21:19:41 given some rounding error 21:19:42 oklopod: I don't think exponentials work like that 21:19:44 :P 21:19:45 i do. 21:19:52 Sgeo: old 21:19:54 n^huge = infinity 21:19:54 learn ur math dud 21:19:55 -!- pikhq_ has changed nick to pikhq. 21:20:39 oklopod: anyway so what's the basic issue, like what construction operation takes too long 21:20:47 is it 21:20:47 # 'a' changes S to S ∪ {t | t ∈ s, s ∈ S}. 21:21:01 or # 'r' changes S to {t | t ∈ s, s ∈ S} (this is decrement if S is an ordinal). 21:21:12 the basic issue is you can never create a number of any considerable size 21:21:20 right right 21:21:32 but which operation blocks this, or is it just the sheer size of operations 21:21:33 i now have a data structure for *having* big numbers tho 21:21:39 so yeah just construction 21:21:41 now 21:21:45 -!- Asztal has quit (Ping timeout: 265 seconds). 21:21:50 because of my geniustructure 21:22:03 like wrt a/r, I'd consider storing a set as X \cup {t | t \in s, s \in Y} 21:22:06 so you just store X,Y 21:22:11 along with whatever else you need for general sets... 21:22:19 but maybe it is just the sheer manifoldosity of operations 21:22:25 in which case just optimise some loops :P 21:22:44 is that set representation really closed under set operations? 21:23:01 probably not, just add enough variables until it works 21:23:09 but it sure would make a/r O(1)... 21:23:14 i mean yeah sure i could just do everything lazily 21:23:49 -!- Asztal has joined. 21:24:03 actually i think what i have now might give me O(n^2) construction of numbers, that's what i originally hoped for 21:24:06 imo it's a very pretty representation of sets :P 21:24:08 i have to think about it 21:24:45 X \cup {t | t \in s, s \in Y} <-- i think this can obviously do anything a set can 21:24:57 ofc it's not very usefu 21:24:57 l 21:25:11 so if you do a on it, what do you get? 21:25:32 what's a(X \cup {t | t \in s, s \in Y}) 21:25:40 let [[X,Y]] := X \cup {t | t \in s, s \in Y} 21:25:48 then a([[X,Y]]) := hmm 21:26:06 a([[X,Y]]) := [[ [[X,Y]], [[X,Y]] ]] 21:26:12 easy 21:26:17 a(S) := [[S,S]] 21:26:21 umm 21:26:27 r(S) := [[{}, S]] 21:26:29 or what do you mean 21:26:43 that's not of the same form 21:26:50 because [[X, Y]] is not a set 21:26:57 yeah it is, I defined it to be so :P 21:27:00 let [[X,Y]] := X \cup {t | t \in s, s \in Y} 21:27:13 or if it's considered one, then you just have a tree, you're just storing the operation 21:27:25 true, but it avoids a loop in r/a 21:27:29 but fair enough, lemme try it the other way 21:27:48 meh, you're right 21:27:53 i'm sometimes right 21:28:01 sometimes. 21:28:04 or areyou an oracle 21:28:29 it'd be kinda cool to code a bf interpreter in toi when no interpreter could even run a hello world in a million years 21:28:32 i mean currently 21:28:58 and i doubt anyone other than me is interested in trying 21:29:07 oklopod, heh 21:29:50 one thing i could do is just switch to <^n >^n ordinals... but that'd be kinda boring 21:30:41 then if you'd store sets as (depth, "leaf element"), you'd have optimized numbers completely 21:32:41 should be really trivial to make a bf interp actually, just make a stack out of tuples 21:33:26 well do that :P 21:33:32 kinda boring but c'mon, big numbers are nice 21:33:33 i might! 21:33:53 well i'm still weighing my options 21:34:51 maybe i'll optimize numbers first for funsies 21:36:33 arch/x86/kernel/head_32.S: Assembler messages: 21:36:33 arch/x86/kernel/head_32.S:64: Warning: shift count out of range (32 is not between 0 and 31) 21:36:34 hum 21:36:44 -!- Phantom_Hoover has quit (Ping timeout: 265 seconds). 21:41:10 -!- coppro has joined. 21:53:10 My phone just fell 21:53:24 Fortunately, it was an inch or so above the ground before it fell 22:00:02 meh 22:13:02 -!- tombom_ has joined. 22:15:11 -!- tombom has quit (Ping timeout: 258 seconds). 22:21:01 Sgeo: Wow, you do drop it a lot. 22:25:19 -!- seph2 has quit (Read error: Connection reset by peer). 22:29:52 Sgeo, You *do* need a rugged phone 22:38:07 -!- wareya has changed nick to warey. 22:38:07 -!- warey has changed nick to wareya. 22:38:30 Fuck, it doesn't reset identification when you do that on freenode? 22:43:08 alise: i just calculated 20+20! 22:43:14 oklopod: AWESOME 22:43:14 huge improvement! :P 22:43:47 How many digits is 20+20!? 22:44:20 ? 22:44:22 wareya: no 22:44:32 40 needs 2 digits 22:44:42 is this an INTERCAL library or something? 22:44:46 40 seems too small to be 20+20! 22:44:58 no turns out it's just rigt 22:45:01 *right 22:45:13 coppro: this addition thing? is intercal slow? 22:45:21 this is about MY LANGUAGE TOI 22:45:23 oklopod: yes, INTERCAL is relatively slow 22:45:34 ais523 22:45:34 : is it 20+20 slow? 22:45:41 Given that 20+20 = 40, how can 20+19*20, which is < 20+20!, be <40? 22:45:51 ah 22:45:53 30+30 still takes forever with my current sets 22:45:54 oklopod: let me find the shortest known INTERCAL addition statement that doesn't resort to an external library 22:45:56 Sgeo: you know what he meant 22:45:58 stop being pedantic 22:46:02 :P 22:46:05 oklopod: it's not that it's slow. It's that it invovles implementing shift-and-add 22:46:05 oklopod: now define * 22:46:14 how much overhead will 20*2 have over 20+20? 22:46:38 WHat's oklopod's project? 22:46:45 Sgeo: oh finally i get what you meant 22:46:46 (1)DOCOMEFROM!2~.2'~#1WHILE:1<-"'?.1$.2'~'"':1/.1$.2'~#0"$#65535'"$"'"'&.1$.2'~'#0$#65535'"$#0'~#32767$#1" 22:46:48 lul 22:46:51 http://esolangs.org/wiki/Toi 22:47:01 but the INTERCAL version is probably faster 22:47:02 interp should be updated 22:47:16 OK, it's multithreaded, but it's O(log n), rather than Toi presumably being O(n) 22:47:29 well it's a low-level language, isn't it, you don't easily get an exponentixplotion 22:47:37 (and if you're wondering wtf addition is shorter multithreaded, welcome to INTERCAL) 22:47:59 used to be O(2^n), now it might be polynomial, but perhaps not 22:48:05 * Sgeo disses Toi syntactic sugar 22:48:13 ah, CLC-INTERCAL 22:48:14 :( 22:48:30 (there are two threads in the above; one of which does the addition in a loop, the other of which checks to see when the loop terminates) 22:48:33 coppro: actually, that's C-INTERCAL 22:48:38 it is? 22:48:40 the two have borrowed quite a few features from the others 22:48:44 ah 22:48:51 in any case, it's taking a horrible language and making it truly disingenuous 22:48:57 ais523: O(log n) wrt what n? 22:48:58 e.g. the / operator exists in C-INTERCAL, but it isn't as general 22:49:14 n's value i guess 22:49:15 oklopod: that's worst case, where n is the large of the numbers being added 22:49:34 the great thing about that addition algorithm is that it actually does long addition 22:49:39 like you might implement with pencil and paper 22:49:43 add, work out the carries, add those on, etc 22:50:29 Ooh, do long division! 22:50:31 Worst algorithm ever. 22:50:37 yeah the toi version is far from linear, but i imagine with enough work numbers could be hacked to be pretty fast 22:51:36 alise: fun fact: the original INTERCAL division implementation was described as a "slick trick" by Don Knuth 22:52:02 although I think it operates using iterated subtraction 22:52:12 Why do people call him Don? 22:52:18 he called himself Don in the program in question 22:52:20 "Don Knuth" just feels wrong. 22:52:22 Fair enough. 22:52:44 (29733) DON KNUTH'S IMPLEMENTATION OF TPK IN INTERCAL 22:52:49 Hmm, and his homepage uses Don Knuth too. 22:53:24 * oklopod wishes he was more interested in intercal so his conscience would allow him to expect ais523 to be interested in toi 22:53:37 he used the 5-bit Baudo format in order to create meaningful variable numbers 22:53:48 you can fit three characters into a 16-bit label or variable number that way 22:53:49 *Baudot 22:54:01 oklopod: I am vaguely interested in Toi, but have to expend my mental effort on other things atm 22:54:24 I may look at it again if I ever end up with significantly more free time 22:55:18 don't worry, see i'm currently not very interested in intercal, so i'm not expecting you to be interested in toi. 22:55:34 i'm tired. 22:55:46 some day someone should make a less insane version of INTERCAL 22:55:52 there are a lot of good ideas in it 22:56:02 but yes you should definitely look at it, your brain will love it 22:56:12 god the syntax is horrible <3 22:56:22 what order does it iterate over sets in? 22:56:30 arbitrary order, given that sets are inherently unordered anyway? 22:56:32 any 22:56:35 but umm 22:56:48 there aren't any loops where the order is visible 22:57:18 can't you produce output inside a loop? 22:57:28 it would be visible then by observing the order of the side-effects 22:57:28 yes, right, that's ordered 22:57:29 randomly 22:57:38 wth is going on with openssh 22:57:52 "recent" entries in ~/.ssh/known_hosts look so strange 22:57:56 no ips any more 22:58:07 they look like: 22:58:10 |1|lMQmHP/IGoqcEp49WRP0fmQYcZk=|/hwTECkVnXFM3gnraIRiHbEZ+/8= 22:58:16 where there was previously an IP 22:59:20 but it's not good practise to rely on the order of a given interp obviously 22:59:51 you can do io in sensible order by just using it in while loops 23:00:04 and not in for-each loops 23:00:28 i could even disallow io in for-each loops that loop over multiple elements 23:02:53 -!- Phantom_Hoover has joined. 23:10:49 anyone know that dijkstra paper (handwritten) talking about equality, leibniz's law, and calculation/computation proofs as opposed to deductive ones? 23:10:54 i need a link :( 23:15:31 Google? 23:19:46 awib made itself a polyglot in perhaps the cheapest way possible. 23:20:16 It's got a prettyprinter. Said prettyprinter attaches a C and Bash Brainfuck implementation to the code. 23:20:32 (the prettyprinter is *also* a fairly simple Brainfuck preprocessor) 23:23:26 Phantom_Hoover: tried 23:23:59 * Mathnerd314 looks at the Toi wiki page 23:24:07 AnMaster: looks vaguely like a pubkey signature 23:24:13 -!- augur has quit (Remote host closed the connection). 23:24:24 trusting pubkeys makes more sense than trusting IPs, if you think about it 23:24:29 oklopod: "useful algorithms"! 23:24:37 -!- augur has joined. 23:27:13 oklopod: my preprocessor looks even more useful now... 23:27:33 -!- augur has quit (Remote host closed the connection). 23:27:53 ais523: The .ssh/known_hosts thing is supposed to be a mapping between pubkeys and IPs, though. 23:28:05 hmm 23:28:11 So that ssh can scream bloody murder if the pubkey of a server has changed. 23:28:14 yes 23:28:22 -!- augur has joined. 23:28:30 perhaps it's encrypting the IPs in order to prevent people working out where you've been connecting 23:28:36 one-way hash would work 23:29:49 Perhaps. 23:29:59 That would, in fact, make sense. 23:30:04 The format actually fits, too. 23:30:26 It always used to irk me that the random numbers people put at the end of their screen names weren't sequential. 23:31:51 mine is, just sequential with a data source you're probably unaware of 23:31:57 Mathnerd314 falls under "trying too hard". 23:32:11 alise: ? 23:32:13 -!- tombom_ has quit (Quit: Leaving). 23:32:24 Look guys, I'm totally hot for mathematics! I can prove this because I have the first three decimal digits of pi without the decimal point after this assertion. 23:32:27 No offence :P 23:32:27 you mean my nick? :p 23:33:03 yar 23:33:47 well, it started as a joke :-) 23:33:59 -!- Phantom_Hoover has quit (Remote host closed the connection). 23:34:10 -!- oklopod has quit (Ping timeout: 265 seconds). 23:34:26 I needed a nick for a quick registration or two... 23:35:14 -!- charlls has joined. 23:37:59 -!- charlesq__ has quit (Ping timeout: 258 seconds). 23:41:26 -!- charlls has quit (Ping timeout: 258 seconds). 23:42:44 -!- oklopod has joined. 23:44:47 when i saw Mathnerd314 i thought "what a coincidence, pi starts that way too" 23:45:14 heh 23:45:28 well at first i didn 23:45:31 't even notice the number 23:45:42 but after phantom's sequential numbers comment 23:45:43 i did 23:46:02 before that i saw Mathnerd 23:46:32 -!- oerjan has joined. 23:47:00 HI OERJAN HAEV YOU HERD NWE NEWS 23:47:09 *TOI NEWS 23:47:48 give me a little time to read the logs, okay? 23:48:18 this language is a bit hard to read, it's as if my brain was used to thinking ('s need a matching ) 23:48:21 you don't SAY 23:48:30 i willl 23:48:42 the tuple algorithms remind me of Haskell Arrows 23:49:01 it essentially implements their fundamental methods, i think 23:49:01 everything becomes tons clearer if i just add ) before a [/{ :D 23:49:12 huh 23:49:24 thaz cool mann. 23:50:14 you're gonna shit bricks when you hear i managed to add 20+20 with the current interp 23:50:19 that only took like 5 minutes 23:50:28 or maybe significantly less but anyway 23:51:05 yay 23:51:53 -!- FireFly has quit (Quit: Hey! Listen!). 23:52:03 the first algorithm uuueua-e is id &&& id 23:52:21 then first a, and second b 23:52:38 arr fst and arr snd 23:53:03 perhaps it's encrypting the IPs in order to prevent people working out where you've been connecting <-- yes it is 23:53:09 it is a "new" feature 23:53:10 however 23:53:20 it makes pruning out old dead entries impossible 23:53:24 >>> is just composition 23:53:27 so I turned it off on desktop 23:53:53 ais523, I had over 200 lines before pruning dead entries, now I have less than 100 23:54:15 Y'know, I have half a mind to extend Brainfuck to support Linux system calls. 23:54:30 pikhq, using what syntax? 23:54:32 and *** can be built with >>>, first and second, while a &&& b = (id &&& id) >>> (a *** b) 23:54:37 AnMaster: Dunno. 23:54:46 I'm just thinking that it would actually be a useful extension. 23:54:58 And let me write coreutils in Brainfuck. 23:55:02 >:D 23:56:10 The main issue is that that would probably require 32-bit Brainfuck, or at least peek, poke, and malloc... 23:57:20 oerjan: i'd have to look up arrays 23:57:26 just heard the name 23:57:28 oklopod: _arrows_ 23:57:44 Control.Arrow is the module 23:57:49 err right 23:57:53 that was a mental typo 23:57:54 Or, alternately, just represent pointers as 4 Brainfuck chars. XD 23:58:59 btw i was just outside looking at the sky, i had this eerie feeling that there were northern lights up there but that the sky was just too light to be entirely sure 23:59:37 as if something was swiftly moving, almost but not quite imperceptibly