00:05:19 Google Alerts tells me it found my name here: http://twitter.com/cerias/status/55662898420260864 00:05:25 Now, Google Alerts was of course right. 00:05:35 The question is, why did CERIAS feel the need to tweet every bloody poster? 00:05:46 Gregor: Because they love you. 00:06:07 Also: lol @ having a Google Alert on your own name :P 00:06:14 Narcissism: I has it. 00:08:51 -!- sftp has quit (Read error: Operation timed out). 00:09:19 -!- sftp has joined. 00:16:25 -!- sftp has quit (Ping timeout: 252 seconds). 00:56:21 Like, it should be, if you make a program with WEB or Enhanced CWEB or whatever, you should publish the book and include a DVD in the back cover of the book, for loading the program into your computer. 00:57:34 AHW*(R()E*TH(WEHGISGH 00:58:24 What is "AHW*(R()E*TH(WEHGISGH"? 00:59:40 Yes. 01:00:09 the ancient gothic god of mismatched brackets 01:17:21 -!- poiuy_qwert has joined. 01:40:22 -!- azaq23 has quit (Quit: Leaving.). 02:07:08 -!- WHARRGARBL has changed nick to coWHARRGARBL. 02:18:33 -!- calamari has joined. 02:21:23 -!- poiuy_qwert has quit (Ping timeout: 246 seconds). 02:27:20 coWHARRGARBL: lol 02:27:30 WHARRRGARBL 02:27:40 coWHARRGARBL: hello 02:32:52 -!- poiuy_qwert has joined. 02:37:28 * tswett investigates Google Alerts. 02:37:48 There's only one result for my name, and it's false. 02:38:50 Ivan Hope, or Tanner Swett? or Warrigal? 02:39:03 My actual real name. 02:39:07 I.e. the latter. 02:39:09 Ivan Hope then! 02:39:15 The latter is Warrigal :P 02:39:25 The latter is the second of two. 02:39:25 wow, the Christian Party are Poe's Law exemplified 02:39:28 replace the standard of 'beyond reasonable doubt' with the more biblical 'evidence of two or three reliable witnesses' in the criminal justice system. 02:39:36 Hmm 02:39:37 lat·ter/ˈlatər/Adjective 02:39:38 1. Situated or occurring nearer to the end of something than to the beginning. 02:39:38 2. Belonging to the final stages of something. More » 02:39:42 latter 02:39:42 relating to or being the second of two items 02:39:43 near (or nearer) to the end 02:39:43 close (or closer) to the present time 02:39:57 Since there were three items, I was interpreting it as the obvious generalisation as the last one 02:39:59 I'm using it in the former sense. :P 02:40:08 In Wales the party wants to change the Welsh flag, because it views the red dragon as a satanic symbol, they would replace it with the cross of Saint David.[10] 02:40:18 I've... actually not used "latter" to mean "last". I think of it as meaning "all but first". 02:40:31 So out of three options, I would think of the latter two. 02:40:41 Anyway, "Tanner Swett" is what I searched for. 02:40:42 the latter N is the last N, I would say 02:41:01 Indeed. 02:41:02 The options are A, B, C and D; the latter two have the problem that they're gay, the first has the problem that it sucks, and the second has the problem that it's made out of fish. 02:41:55 ais523: Have you ever ran a Perl script over GCC's output? 02:42:11 elliott: I don't think so 02:42:19 It's quite errr, enlightening 02:42:31 What I'm saying is, dear god someone tell Gregor he's mad. 02:42:32 I've ran a Perl script over makefiles generated during gcc's build process before now, though 02:43:03 * tswett searches for 'john powell' and finds that most of the results are for the wrong word. 02:43:09 Why does John Powell have to be so many people? 02:43:47 ais523: you too! There must be... at least 523 of you! 02:43:57 Gregor: you're an evil mangler 02:45:47 tswett: I think so; there are 10 Alex Smiths more famous than me, imagine how many must be less famous 02:46:32 billions and billions 02:46:49 I do not think there is any need to change the flag, since it already exists. The red dragon can also be seen as a red dragon instead of a satanic symbol; although if there are more than enough people that prefer change the flag to the cross, then maybe they should do so. I myself don't care much as I do not live there. 02:46:58 I'm pretty sure that a majority of people on Earth are named Alex Smith. 02:47:33 tswett: What percentage do you expect? I know someone who had the same name as a few people and caused confusion, someone thought he was their boss even though he wasn't. 02:48:08 gah, the label has failed 02:48:13 I expect... 0.1%. 02:48:16 this is so brittle 02:48:24 That may be a bit high, come to think of it. 02:48:34 * tswett shrugs. 02:48:51 tswett: 6.79 million people are called Alex Smith?!?!?!?! 02:49:00 they could found a fucking country 02:49:11 "morning Alex" 02:49:12 "morning!" 02:49:15 "where you off to, Alex?" 02:49:17 "ah, just going to work" 02:49:23 "Ah, hello, I'm here to see Mr. Smith" 02:49:26 "Which one?" 02:49:35 Oh, wait. I'm assuming everyone has an Englishy name. 02:49:40 :D 02:50:27 moon power bitches 02:50:56 Okay, let's assume that... 6% of all people have Englishy names. 02:51:07 Then the number becomes 0.006%, I believe. 02:51:28 Then there are only, like, 400,000 of ais523. 02:52:28 Ihope there are not too many ais523. It would Warrigal me a lot and I might even break out into tswett. 02:52:37 (Warrigal: SOUNDS LIKE "WORRY") 02:55:58 you know, if everyone had the same name you'd have to start giving auxiliary names to tell all the alex smiths apart 02:56:14 and eventually you could just drop the alex smith part 02:57:27 :D 02:57:38 I'm Alex Smith Jacque Loutique. 02:57:44 Oh, hi. I'm Alex Smith Azerbajan Remi. 02:57:54 (ELLIOTT MAKES UP NAMES) 02:58:25 alex is good, because it could be short for both alexander and alexandra 02:58:25 tswett: HELLO 02:58:43 It could also be short for Alxe-wielding insane hobo. 02:58:43 so you could definitely start and maintain a country where everyone has that name 02:58:44 The l is silent. 03:00:13 -!- elliott has quit (Quit: Leaving). 03:00:18 -!- elliott has joined. 03:00:21 HELLO HELLO HELLO 03:06:27 heo heo heo 03:07:59 tswett is actually a elephant. did you know? 03:08:13 So, a friend gave me a password to something 03:08:19 So I'm logged in as her 03:08:22 Kinky. 03:08:30 *So, 03:09:22 Sgeo__: We're still waiting for the point. 03:09:31 No point 03:09:34 I just feel weird 03:11:02 we've waited for the point for years 03:11:33 Sgeo__: you know who *else* dressed up in the skin of women? 03:11:54 IT PUTS THE LOTION ON ITS SKIN OR ELSE IT GETS THE HOSE AGAIN 03:12:33 *RUBS 03:13:56 hmm, the sequences are even longer than i remember 03:15:01 smell my breakfast bitch 03:15:20 sorry, i don't eat dogs 03:15:42 let's see... 9 + let's say 29 (cba to count them all) + 03:15:58 7 + 03:16:02 5 + 03:16:07 no wait 03:16:09 that's just the most important posts 03:16:23 9 + 29 + 14 + 03:16:42 21 + 03:17:08 14 + 03:17:19 5 + 03:17:30 24 + 03:17:53 28 + 03:17:58 15 + 03:18:01 83 + 03:18:02 holy fucking fuck how many fucking posts are there 03:18:09 oerjan: i'm actually counting blog posts here 03:18:19 * oerjan whistles evilly 03:18:21 18 + 03:18:24 * elliott adds the totals so far 03:18:38 162 + 03:18:48 7 + 11 + 03:18:55 12 + 03:19:07 are you counting all the blog posts, or some particular category? 03:19:27 17 + a bit (minor subsequences) 03:19:43 olsner: I'm counting the number of blog posts that together constitute Less Wrong's Sequences 03:20:01 aka what you get told to go and read the entirety of if you comment on less wrong and someone disagrees :D 03:20:09 6 + 03:20:26 current total: 215 + a bit 03:20:49 24 + 03:20:58 9 + 03:21:05 8 + 03:21:16 15 + 03:21:46 38 + 03:22:12 31 03:22:36 so in the *main* Sequences series, there's 340 posts. plus dependencies. 03:23:01 misc. Yudkowsky sequences: 03:23:14 7 + 11 + 03:23:31 evolution posts that i'm too sick of this to count + 03:23:40 13 03:23:43 + 03:23:50 14 + more 03:24:00 i'm not going to count other people's sequences because this is FUCKING ENOUGH 03:24:19 so the total is 385 plus dependencies plus ones that nobody bothered to include in the lists because there's too fucking many 03:24:24 olsner: oerjan: any questions 03:24:44 only "wat?" 03:25:04 what are you talking about? 03:25:21 olsner: do you know what Less Wrong is, because if not i can't even hope to give an answer :) 03:25:34 nope, I don't 03:25:36 oops! i missed one 03:25:50 28 03:25:52 whatever 03:26:01 olsner: then i'm not even going to bother trying to explain :) 03:26:10 okelidokeli 03:26:31 *okely dokely, you stupid scannd 03:26:40 w/e 03:27:06 now, i'm fairly sure oerjan knows, so i'm going to say OVER 385 POSTS FFFFFFFFF 03:27:34 so basically the sequences are longer than the somplete sacred texts of some major religions? 03:27:41 *complete 03:27:41 oerjan: :D 03:27:50 oerjan: i dunno, the bible is easily 400 blog posts i'm sure :) 03:28:02 especially if you include all the rationalisations from way back when to present 03:28:06 and err "interpretations" 03:28:07 i guess it depends on post length 03:28:15 oerjan: yudkowsky length 03:28:23 'nuff said 03:28:36 um those are long aren't they... 03:28:42 quite :P 03:28:51 but i mean 03:28:58 a page or two of the bible would easily fill a yudkowsky post 03:29:10 and the bible is pretty long... 03:30:23 Some books of the Bible are rather short 03:32:14 There are 1,281 pages in the Bible (Old and New Testament combined), including 66 different "books"... 03:32:16 clearly a reliable source 03:32:18 anyway it's a long book 03:32:40 seriously though. 03:32:42 jesus fuck. 03:34:20 The number of pages should depend what print edition you have? The number of different books, though, should remain the same (unless it differs by counting apocrypha/deutrocanonical or not) 03:35:59 From a long lineof virgins? 03:36:44 wtf, how did this happen 03:36:56 oh 03:36:57 it erased dead code 03:36:59 fucking fuckshit 03:38:29 I give up until Gregor mangles labels :P 03:38:31 Or I guess I could. 03:38:33 But it sounds painful. 03:40:12 Wait... he DOES... 03:41:51 -!- poiuy_qwert has quit (Read error: Operation timed out). 03:42:47 -!- poiuy_qwert has joined. 03:42:51 * calamari wishes he could fork off a copy of himself then join later 03:43:13 you can, just think about two things at once 03:43:17 or do you mean physically 03:43:33 physically :) 03:43:47 meh, who cares about atoms? 03:43:49 although maybe you could write code and play videogames at the same time, you're pretty bright :) 03:44:01 that's a physical issue, mostly 03:44:03 wrt control 03:44:10 and the fact that it's hard to look at two things at once 03:44:22 also, videogaming tends to be a multi-core kind of thing, it uses all the available system resources 03:46:35 calamari: mind you, the human brain's low thread limit is also a physical issue :) 03:46:51 yeah my brain is mostly single threaded 03:47:17 I'm one of those people whjere if I'm driving, it's dangerous for me to be doing much of anything else 03:47:24 i look forward to moving into some leet 128-core brain hardware in the future 03:47:30 preferably digital too, to stop all these stupid bits flipping 03:49:29 -!- oerjan has quit (Quit: Thai dung). 03:54:26 -!- Zuu has quit (Read error: Connection reset by peer). 03:59:25 -!- Zuu has joined. 04:00:10 -!- coWHARRGARBL has changed nick to failedhipster. 04:01:07 -!- failedhipster has changed nick to copumpkin. 04:02:40 -!- kwertii has joined. 04:10:52 tswett is no longer a duck. he is now a bear. 04:13:00 -!- Zuu has quit (Ping timeout: 260 seconds). 04:21:04 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 04:23:53 -!- poiuy_qwert has joined. 04:37:21 -!- asiekierka has joined. 04:39:53 -!- poiuy_qwert has quit (Read error: Operation timed out). 04:43:54 -!- poiuy_qwert has joined. 05:02:04 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 05:04:23 -!- poiuy_qwert has joined. 05:04:28 I had an idea of music file format, how well would it work? There are three parts: a MIDI sequence, a synthesizer program, and a conversion table from MIDI note numbers to other numbers (usually the frequency of the notes, but can be used for whatever purpose you want). 05:06:37 The MIDI sequence would consist of four threads, each with four registers: instruction counter, delta counter, loop counter, and auxiliary counter. It can also contain external signal messages, which might be used for singing text or whatever. 05:06:57 -!- elliott has quit (Ping timeout: 264 seconds). 05:10:38 The synthesizer program would have sixteen threads, one for each MIDI channel, with 128 registers each (changeable by the program itself as well as by MIDI control change messages); in addition, there are 128 programs which one is used on which channel is selected by a MIDI program change message. 05:11:08 -!- asiekierka has quit (Remote host closed the connection). 05:11:27 Is it good? Is it sensible? 05:17:11 In addition, there can be some special programs that can be selected instead of writing your own; these could include one to just play sample data (as a module tracker program might do). 06:17:10 -!- celticwench has joined. 06:17:47 hello all :) 06:22:47 -!- kwertii has quit (Quit: bye). 06:38:22 -!- celticwench has quit (Quit: Byeeee.....eyyy...eyyyy....). 06:40:31 -!- poiuy_qwert has quit (Quit: This computer has gone to sleep). 06:41:27 -!- poiuy_qwert has joined. 07:28:47 -!- ais523 has quit (Remote host closed the connection). 07:40:40 -!- Lymia has quit (Quit: ==(>^w^)> ==(> >.<)>). 07:49:39 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 07:51:53 -!- poiuy_qwert has joined. 07:54:18 -!- Lymia has joined. 07:54:18 -!- Lymia has quit (Changing host). 07:54:18 -!- Lymia has joined. 07:54:18 Do you know Giveaway Chess (also called Losing Chess and Suicide Chess)? 07:54:40 -!- Lymia has quit (Client Quit). 07:58:20 -!- Lymia has joined. 07:58:20 -!- Lymia has quit (Changing host). 07:58:20 -!- Lymia has joined. 07:59:35 -!- Lymia has quit (Client Quit). 08:06:50 -!- poiuy_qwert has quit (Ping timeout: 246 seconds). 08:11:47 -!- poiuy_qwert has joined. 08:21:22 -!- zzo38 has quit (Quit: zzo38). 08:30:09 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 08:31:47 -!- poiuy_qwert has joined. 08:31:58 -!- Lymia has joined. 08:31:58 -!- Lymia has quit (Changing host). 08:31:58 -!- Lymia has joined. 08:39:00 -!- Lymia has quit (Remote host closed the connection). 08:41:00 -!- Lymia has joined. 08:47:18 -!- poiuy_qwert has quit (Read error: Operation timed out). 08:47:59 -!- Lymia has quit (Quit: ==(>^w^)> ==(> >.<)>). 08:49:49 -!- Lymia has joined. 08:49:49 -!- Lymia has quit (Changing host). 08:49:49 -!- Lymia has joined. 08:51:45 -!- poiuy_qwert has joined. 08:57:08 -!- monqy has quit (Quit: hello). 09:14:35 -!- Imk0tter has quit (Ping timeout: 260 seconds). 09:14:50 -!- Imk0tter has joined. 09:33:57 -!- calamari has quit (Quit: Leaving). 09:47:03 -!- cheater- has joined. 09:49:23 -!- cheater00 has quit (Ping timeout: 246 seconds). 10:10:34 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 10:12:51 -!- poiuy_qwert has joined. 10:27:53 -!- poiuy_qwert has quit (Ping timeout: 246 seconds). 10:32:46 -!- poiuy_qwert has joined. 10:44:20 -!- poiuy_qwert has quit (Read error: Operation timed out). 10:52:49 -!- poiuy_qwert has joined. 11:08:31 -!- poiuy_qwert has quit (Read error: Operation timed out). 11:12:45 -!- poiuy_qwert has joined. 11:31:09 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 11:32:57 -!- poiuy_qwert has joined. 11:48:03 -!- poiuy_qwert has quit (Ping timeout: 246 seconds). 11:52:58 -!- poiuy_qwert has joined. 12:06:14 -!- poiuy_qwert has quit (Ping timeout: 246 seconds). 12:33:18 -!- Sgeo__ has quit (Ping timeout: 258 seconds). 12:59:30 -!- FireFly has joined. 13:41:49 -!- augur has quit (Remote host closed the connection). 13:45:40 -!- Ilari_antrcomp has quit (Quit: Reconnecting). 13:46:08 -!- copumpkin has quit (Quit: Computer has gone to sleep.). 13:47:00 -!- Ilari has quit (Ping timeout: 260 seconds). 13:48:03 -!- oerjan has joined. 13:51:54 -!- sftp has joined. 13:54:01 critical vlc failure. On this DVD it shows I'm at 05:01/00:17 14:08:57 -!- augur has joined. 14:23:51 -!- oerjan has quit (Quit: leaving). 14:27:08 -!- MigoMipo has joined. 14:30:21 -!- asiekierka has joined. 14:32:04 -!- augur has quit (Remote host closed the connection). 14:33:33 -!- augur has joined. 14:38:06 -!- SimonRC has quit (Ping timeout: 252 seconds). 14:38:13 -!- SimonRC has joined. 14:55:39 -!- Ilari has joined. 15:02:14 -!- Ilari_antrcomp has joined. 15:06:32 -!- Sgeo has joined. 15:24:56 -!- augur has quit (Remote host closed the connection). 15:27:05 -!- augur has joined. 15:27:33 -!- BeholdMyGlory has joined. 15:32:03 -!- Zuu has joined. 15:32:54 APNIC down 0.02 (6930944, 0.413 blocsk left): 3x8k+4k+1k+/32+/48 to Australia, 32k+4k to China, 3x4k+1k to Japan, 32k to South Korea, 1k to Philippines, 2k+2x1k+/32 to Singapore, 4x16k to Vietnam, 2k+1k to Vanatu. Slow day. 15:34:18 New depletion estimate: Monday 18th April. 15:41:02 -!- cpressey has joined. 15:48:50 -!- elliott has joined. 15:49:07 19:20:02 * SgeoN1 vaguely wonders where his dad is 15:49:07 19:32:18 In case anyone was worried or otherwise cares: don't be 15:49:07 19:32:22 He's ok 15:49:07 THANK GOD 15:49:38 oh hi cpressey 15:51:28 hi elliott 15:51:53 is/was cpressey zomgmodules? 15:52:25 you can't say ((car (quote (cdr car))) (quote (a b))) in Scheme, but you can say *[*[*car [*cdr *car]] [a b]] in Bizaaro-Pixley! 15:54:05 cpressey: erm the scheme equivalent is 15:54:14 ((car (quasiquote ((unquote cdr) (unquote car) ... 15:54:17 which DOES work :P 15:54:23 or you could use lambdas 15:54:55 does bizaaro-pixley have lambdas? 15:55:00 yes 15:55:04 I'd just allow any quoted cons to be used as a function 15:55:11 and bind its single argument to "x" or something :) 15:55:21 or maybe have it like [x *[car *x]] 15:55:27 that would be slightly more reasonable 15:55:29 i'm sure you would 15:55:42 well picolisp would too :p 16:00:01 thus concludes this morning's session of leaving elliott nonplussed 16:00:05 back later 16:00:07 -!- cpressey has quit (Quit: leaving). 16:01:12 morning? what a joker, it's just 19h past bedtime 16:01:48 :D 16:02:40 so I think I'll just have breakfast and go to bed 16:06:59 fuuuck. Maybe elliott knows the answer to this: 16:07:11 .IFO detected. Redirecting to dvd:// 16:07:12 There are 2 titles on this DVD. 16:07:12 There are 1 angles in this DVD title. 16:07:19 how do I get mplayer to play the second title 16:07:43 I can't get mplayer to even open the dvd menu, and vlc opens it but I can't find the second title 16:10:39 you give it the option for selecting a title, or you press the button for going to the next title 16:10:43 obv. 16:11:03 olsner: breakfast? Swedes have breakfast? 16:11:09 i thought all meal times were Regular Ordinary Swedish Meal Times 16:11:19 Vorpal: it's... part of the path 16:11:22 dvd://something/something 16:11:23 I think 16:11:30 yes, breakfast *is* a regular ordinary swedish meal time 16:11:43 olsner: CRUSH THE CEREAL 16:11:47 elliott, hm 16:11:54 including the pre-breakfast snack: it's good for you 16:11:56 DVD Playback 16:11:56 As mentioned above, MPlayer does not support the playback of DVD menus. To play the first title on a DVD, use 16:11:56 $ mplayer dvd:// 16:11:56 If the first title is not the main movie, try playing other titles: 16:11:57 $ mplayer dvd://2 16:11:59 $ mplayer dvd://3 16:12:01 http://wiki.linuxquestions.org/wiki/MPlayer 16:12:06 elliott, but it doesn't even want to accept dvd:// when it is a file on the disc. I have to give it the .IFO file thingy 16:12:07 Vorpal: the great juffgy triumphs once again 16:12:20 v 16:12:21 elliott, as in... file on hard disk 16:12:22 Vorpal: erm 16:12:33 Vorpal: try /home/arvid/poop.ifo/blah 16:12:34 elliott, I don't have the dvd handy. I have the ripped stuff 16:12:38 elliott, hah 16:12:38 and stick a dvd:// in front if that doesn't help :) 16:12:54 mplayer [dvd|dvdnav]://[title|[start_title]-end_title][/device] 16:13:01 Vorpal: dvd://2/home/arvid/blah 16:13:02 presumably 16:13:19 elliott, hm 16:13:23 dunno what dvdnav is mind you 16:13:32 ah 16:13:34 menu support :D 16:13:39 used with keypad! 16:13:47 elliott, dvd://2//home/arvid/blah even 16:13:55 but i think my previous address should work 16:14:11 elliott, nope, it was a relative path :P 16:14:16 so you need an extra / 16:14:23 perfectly sensible 16:14:54 but what the crap. This isn't the stuff I expect. This is just the logo. -_- 16:18:03 -!- Sgeo has quit (Read error: Connection reset by peer). 16:18:17 Vorpal fails to watch a movie 16:24:06 olsner, quite. Meh. Will have to find it another way 16:25:08 Vorpal: or you could just try title 3, 4 16:25:12 or use dvdnav 16:25:26 I hear there are places where people set up the movie for you, you just sit there and it rolls 16:25:40 olsner, I doubt this one would be sent there. It is old. 16:26:03 olsner, besides I can google for stuff in it at the same time. And no popcorn 16:26:05 yay 16:26:26 the sound of crunching popcorn is annoying 16:26:40 crunchcrunch 16:26:54 it's less annoying if you're the one making it 16:26:57 olsner, I doubt this one would be sent there. It is old. 16:27:01 ^ worst excuse for porn ever 16:27:16 elliott, hahahaha. You must have a very strange taste. 16:27:30 elliott, to consider Cosmos by Carl Sagan... porn. 16:27:52 carl sagan porn? ewww :/ 16:27:59 olsner, my reaction indeed! 16:28:04 olsner, what can elliott be up to 16:28:11 gross 16:28:16 this is worse than auto-tuning his voice 16:28:21 Vorpal is a sicko 16:28:22 elliott, hey it is you who made that up! 16:28:23 http://codu.org/tmp/reverb-2011-04-11.ogg <-- check out the sweet room reverb generator I made :) 16:28:51 Gregor: Are you actually writing a whole music conductor program thing :P 16:29:00 elliott: One step at a time, yes. 16:29:01 Gregor, why is there so much noise in it? 16:29:12 Vorpal: Because I don't mix very well, I'm working on it :P 16:29:15 Gregor: What were you using before 16:29:24 Gregor, sure you didn't turn on the LP effect? 16:29:29 elliott: fluidsynth, sox, and no conductor program. 16:29:40 variable: Har-dee-har. 16:29:43 Erm 16:29:46 Vorpal: ^^^ 16:29:48 Yeah, that variable. 16:29:51 Always such a joker. 16:30:04 Also, I conclude that Vorpal has never heard an LP, ever. 16:30:44 elliott, actually I had. And yes the noise is somewhat different. This is more like bad cassette recording or such. 16:31:03 Would you jerkfaces focus on the reverb instead of the noise :P 16:31:17 Gregor, what reverb? Can I hear a before/after to compare? 16:31:27 I haven't focussed on the noise 16:31:39 My professional opinion is that it sounds like reverb, though 16:31:58 Gregor: Now turn the reverb up 16:31:58 to 16:32:00 another non-essential thing to concentrate on: nice music 16:32:00 MAXIMUM 16:32:06 elliott, is that 11? 16:36:26 *oh* found it. The box says something else than the discs say. Part 2 is on disc 2. Even though nothing else indicate this is the case. Oh well. 16:37:42 so every disc except the first has two episodes 16:37:43 okay 16:37:52 -!- wareya_ has quit (Ping timeout: 276 seconds). 16:41:28 (I assumed it was the last one that had just one episode, which the box indicated too) 17:13:18 -!- sebbu has quit (Read error: Connection reset by peer). 17:13:43 -!- sebbu has joined. 17:13:43 -!- sebbu has quit (Changing host). 17:13:43 -!- sebbu has joined. 17:16:19 -!- cpressey has joined. 17:17:22 hm, you can also say ((car (list cdr car)) (quote (a b))) in Scheme, because list evaluates its arguments. 17:18:05 indeed 17:18:24 (quasiquote (unquote cdr) (unquote car)) = (cons cdr (cons car '())) = (list cdr car) 17:18:31 -!- monqy has joined. 17:18:39 and bizarro-Pixley [] is quasiquote, and * is unquote 17:18:59 with the whole thing being in a sort of implicit (car (quasiquote ...)) 17:19:04 (for *x at the top level) 17:19:12 erm 17:19:21 (car (quasiquote (... ()))) 17:19:22 that is 17:19:44 no, there's no quasiquote in bizaaro-Pixley, just quote and eval 17:20:22 er, with quote being implicit 17:20:30 cpressey: what is the result of [*[*+ *2 *2] blah] in a hypothetical bizarro-Pixley with those functions and integers? 17:20:40 elliott: [*[*+ *2 *2] blah] 17:20:55 what is the result of *[car [*[*+ *2 *2] blah]] 17:20:56 well, no, malformed, because you have a triple in there :) 17:21:09 you know what I mean :) 17:21:15 pretend triples exist :p 17:21:38 *[car [*[*+ *2 *2] blah]] => error, because evaling a pair where the lhs is not a function is an error (but i'm considering changing the meaning of evaling a pair, so stay tuned) 17:21:52 what is the result of *[*car [*[*+ *2 *2] blah]] 17:22:33 *[*car [*[*+ *2 *2] blah]] => error because *4 is not a function 17:22:53 um 17:22:56 what is the result of [*car [*[*+ *2 *2] blah]] 17:23:03 hm, wait 17:23:11 your semantics, they is incoherent to me 17:23:34 i'm fairly sure what you have is [a b] = (quasiquote (a . b)) and *x = (unquote x)... 17:23:35 *[*car [*[*+ *2 *2] blah]] => *4 17:23:44 then yes, you have quasiquote and unquote 17:23:46 i think. i don't know, i don't have fricken integers! 17:23:50 if [] was quote, then you'd just get 17:23:53 *[*+ *2 *2] 17:23:54 back 17:24:14 not quite 17:24:21 car takes a pair 17:24:25 and does things to it 17:24:31 it's not a general quasiquote 17:24:41 so does car actually get the car and then evaluate that? 17:24:47 yes 17:25:00 i'll hold off thinking about this until there's an implementation :-P 17:25:15 there is one, but i'm holding off releasing it until i decide i like it a lot 17:25:51 meh, all languages are just inferior versions of thue 17:28:16 i have some ideas about making cons superfluous and replacing lambdas with "pure closures", but they're just ideas right now 17:28:26 who needs closurse? 17:28:29 *closures? 17:31:18 -!- sebbu2 has joined. 17:31:18 -!- sebbu2 has quit (Changing host). 17:31:18 -!- sebbu2 has joined. 17:34:11 -!- wareya has joined. 17:34:33 -!- sebbu has quit (Read error: Operation timed out). 17:35:13 elliott: ah lahks lexical bindings 17:35:33 cpressey: when john mccarthy made lisp 1.0 did he use lexical bindings NO HE DID NOT 17:35:36 are you questioning mccarthy 17:36:39 yes, i am 17:36:57 Mr. McCarthy, isn't it true you have been seen in the presence of several known members of the Communist Party? 17:37:22 oh he isn't here 17:37:22 oops 17:38:50 -!- wareya has quit (Ping timeout: 258 seconds). 17:38:57 -!- ais523 has joined. 17:39:05 hi ais523456789 17:45:43 -!- cpressey has quit (Quit: leaving). 17:49:34 I should try to get uplink demo running hm 17:50:01 ooh nice.... a self-extracting shellscript 17:50:03 "fun" 17:50:54 .setup17415: error while loading shared libraries: libgtk-1.2.so.0: cannot open shared object file: No such file or directory 17:50:57 gnh 17:52:40 ./lib/uplink.bin.x86: error while loading shared libraries: libjpeg.so.62: cannot open shared object file: No such file or directory 17:52:41 gah 17:53:31 elliott, I think dynamic linking is acceptable when it is for core distro package. But not for "binary blobs" 17:56:47 okay it kind of starts now 17:58:09 -!- copumpkin has joined. 18:00:15 -!- asiekierka has quit (Remote host closed the connection). 18:02:23 -!- Sgeo has joined. 18:05:11 -!- wareya has joined. 18:10:57 -!- ais523 has quit (Ping timeout: 246 seconds). 18:26:06 elliott, I got uplink running fine. However it is made for lower DPI screens 18:41:17 -!- kassioms has joined. 18:42:16 -!- kassioms has left. 18:43:49 -!- oerjan has joined. 18:49:24 carl sagan porn? ewww :/ 18:49:31 http://www.reddit.com/r/spaceporn 18:49:41 i think that's close enough 18:50:02 weird result from typoing in units: http://sprunge.us/ZcAf <-- what's up with the first one 18:50:08 m^5 what? 18:50:41 You have: m to m 18:50:42 You want: 18:50:42 Definition: 0.018039068 m^5 18:50:43 same 18:50:44 wtf 18:50:50 *oh* 18:50:52 -!- impomatic has joined. 18:50:53 to is an unit 18:50:53 Hi :-) 18:51:07 which is volume it seems 18:51:08 the knew /r/*Porn subreddits are going to pose an interesting conundrum for net nannies... 18:51:12 *new 18:51:24 oerjan, there are uh, several? 18:51:25 wtf 18:51:47 yes, there are 10 listed sister reddits on that page 18:52:39 i think EarthPorn may have been the first with that naming convention 18:52:40 oerjan, oh, not actually porn as such 18:52:55 or, humanporn might be 18:53:15 you might think, but no... 18:53:21 * oerjan visited that one before 18:53:21 oerjan, then what is it? 18:53:31 oerjan: erm tv tropes sort of pioneered it no? 18:53:35 Scenery Porn and whatnot 18:53:41 wel 18:53:41 i think there is also a plain /r/porn, which _is_ what it sounds like 18:53:42 *well 18:53:48 i think that actually predates tvtropes 18:53:49 elliott: that may be 18:54:06 also "gorn" which is an obvious contraction 18:54:06 oerjan, what is humanporn, I can't figure it out 18:54:22 elliott: however the subreddits started getting created only a month or so ago 18:54:31 elliott, isn't that like an violence instead of sex? 18:54:33 well your mom only started getting created a month or so ago. shut up. 18:54:42 oh man /r/earthporn is not going to be good for me 18:54:49 Vorpal: i think the actual subject is something like "awesome people" 18:54:52 my list of places to visit will never stop increasing 18:54:56 oerjan, hah 18:54:58 portraits, really 18:55:05 why did you tell me about this oerjan 18:55:13 so pretty ;_; 18:55:13 oh there are descriptions on the side 18:55:14 right 18:55:17 "This subreddit is devoted to hi-res artistic portraits of individuals or groups of people. NSFW content is allowed, as long as it is flagged as NSFW." 18:55:24 humanporn: "This subreddit is devoted to hi-res artistic portraits of individuals or groups of people. NSFW content is allowed, as long as it is flagged as NSFW. There is a difference between art and smut. All smut will be removed, there are other subreddits for that." 18:55:26 go figure 18:56:57 oerjan is a very bad person 18:57:22 http://imgur.com/s/Ggybq what 18:57:56 elliott, I'd guess a saltlake at dawn or dusk 18:58:07 oh wait spaceporn is actually older than earthporn 18:58:13 it's absolutely surreal 18:58:35 elliott, based on the title: http://en.wikipedia.org/wiki/Mono_Lake 18:58:43 http://en.wikipedia.org/wiki/Mono_Lake it's this 18:58:53 elliott, I beat you to that 18:58:54 why is everywhere so pretty ;;;___;;; 18:59:01 elliott, salt lake indeed as I said 18:59:16 whyyy 19:00:20 hm wasn't mono lake that place they found those arsenic bacteria 19:00:25 *where 19:00:46 zyes 19:01:03 oerjan: you have to buy my plane tickets for me 19:01:19 :D 19:01:41 oerjan: IT'S ALL YOUR FAULT 19:02:15 elliott, speaking of tvtropes above. Their article on Dwarf Fortress is quite amusing 19:04:16 -!- augur has quit (Remote host closed the connection). 19:07:03 olsner, I doubt this one would be sent there. It is old. 19:07:24 there _are_ film clubs and the like that show old films. at least there is one in trondheim. 19:07:59 although wasn't cosmos a tv series rather than a movie 19:08:51 this is worse than auto-tuning his voice 19:09:31 * oerjan now has the vague image of adjusting the visuals to be pornographic, while keeping the soundtrack as usual 19:10:12 oerjan, you have a dirty mind : 19:10:21 although wasn't cosmos a tv series rather than a movie <-- indeed 19:10:50 also: s/ :$// 19:11:59 :D 19:12:22 i wonder if carl sagan and david attenborough ever made anything together 19:12:23 wait 19:12:27 the world still exists 19:12:36 * elliott checks Has The Earth Exploded From Awesomeness Yet? 19:12:40 nope, guess they never did 19:12:55 -!- augur has joined. 19:13:28 elliott, argh. 5 hours to go for next disc... 19:13:39 (yes the mail delivers in the night) 19:15:39 elliott: it would appear they were at least autotuned into the same piece http://en.wikipedia.org/wiki/Symphony_of_Science#The_Unbroken_Thread 19:16:16 THEY KNOW NOT WHAT THEY MESS WITH 19:16:26 i've never actually listened to any of the post-glorious-dawn ones PROBABLY THEY SOLD OUT 19:17:11 Vorpal: what's the gcc stuff for likely/unlikely branches? 19:18:45 elliott, uh, check manual, I don't remember it offhand. Something like __builtin_gcc_expect iirc 19:18:57 elliott, basically likely/unlikely are kernel macros 19:19:24 -!- KingOfKarlsruhe has joined. 19:19:37 I know that much 19:19:39 it was the name i forgot 19:19:51 lol, it lectures me to profile 19:19:57 I'M NOT PROFILING FOR YOU 19:20:21 i suppose i can imagine a universe where bignum+bignum arithmetic is more common than bignum+fixnum or fixnum+fixnum, but it's sure as hell not this one 19:20:48 -!- Sgeo has quit (Ping timeout: 258 seconds). 19:21:18 elliott, profile to see if it actually helps 19:21:29 meh, all languages are just inferior versions of thue 19:21:49 i actually find /// / Itflabtijtslwi more elegant than thue 19:22:02 oerjan, "Itflabtijtslwi"? 19:22:16 what a name 19:22:27 for one thing the latter can do arbitrary stdin/stdout IO 19:23:06 Vorpal: ignore this fancy little acronym, basically this is just that slashes language with input 19:23:14 oerjan, haha 19:24:34 * oerjan wasn't the one to name it though 19:24:51 although i did write the slightly nontrivial programs 19:26:30 -!- elliott has quit (Ping timeout: 252 seconds). 19:41:04 -!- Sgeo has joined. 19:47:18 -!- KingOfKarlsruhe has quit (Quit: ChatZilla 0.9.86.1 [Firefox 3.6.16/20110319135224]). 19:48:44 oerjan, so is it BF-IO complete? 19:48:49 oerjan, or is it more limited? 19:50:47 assuming that means it can read and write any byte, then i believe so (although it needs a large table of characters if it is to recognize all of them, similarly to unlambda) 19:52:19 as in, i see no fundamental obstacles, given that i could write rot13 in it 19:52:46 -!- asiekierka has joined. 19:53:15 -!- asiekierka has quit (Remote host closed the connection). 19:54:17 oerjan, ah 19:54:27 oerjan, what about the zero byte? 19:55:57 shouldn't be a problem. it has a separate convention for EOF distinct from any character (in fact that _was_ my decision to clarify the spec when i wrote the perl implementation) 19:56:50 well unless there is some bug related to how perl deals with NULs, but i would consider that a flaw in the implementation, not the language 19:57:42 i don't know exactly how perl does that stuff 19:59:06 this means that it should be _more_ IO-complete than an 8-bit BF implementation which cannot avoid confusing some characters with EOF 20:04:39 hah 20:04:51 oerjan, how do you tell them apart in the source code? 20:06:24 tell what apart? 20:08:31 the GG command reads a char if available, and substitutes it for a chosen string. eof substitutes the empty string instead. 20:09:43 -!- zzo38 has joined. 20:11:34 If it was up to me, I would have the C pointers with NULL work like: An implicit cast from a constant 0 is NULL. An implicit cast from any other number, or a non-constant 0, is a compile error. An explicit cast from any number to a pointer is the corresponding address, so 0 might not necessarily be NULL. 20:12:37 An implicit cast from a pointer to boolean is true if and only if it is not NULL. An implicit cast from pointer to number is a compiler error, but an explicit cast works and 0 will not necessarily be NULL. 20:20:27 -!- ais523 has joined. 20:20:30 zzo38, how do you determine at compile time if something is an "non-constant 0" as opposed to for example, a number in the range 3-4? "An implicit cast from any other number, or a non-constant 0, is a compile error." 20:21:25 of course it doesn't really matter for this 20:21:48 If the compiler sees it a constant expression or not, I mean, an expression without variable/function call 20:21:55 right 20:47:15 night 20:49:17 -!- elliott has joined. 20:49:20 19:21:18: elliott, profile to see if it actually helps 20:49:22 difficult 20:49:24 it's not an application 20:49:44 elliott, what was it then? 20:49:44 (in this case, gcc is being used to generate instruction implementations for a JIT) 20:49:49 elliott, ah 20:49:54 19:21:49: i actually find /// / Itflabtijtslwi more elegant than thue 20:49:56 oerjan: that's true. 20:50:00 elliott, you could do test cases with/without it maybe 20:50:06 -!- zzo38 has left. 20:50:20 19:50:47: assuming that means it can read and write any byte, then i believe so (although it needs a large table of characters if it is to recognize all of them, similarly to unlambda) 20:50:27 oerjan: it's more like that + arbitrary effect at an arbitrary point 20:50:28 e.g. the 20:50:37 B... = bf program with no output 20:50:38 yeah yeah 20:50:38 P... = print this 20:50:46 language has both input and output of any byte, but, right :) 20:51:27 Vorpal: anyway, this code path appears for every arithmetic op 20:51:33 Vorpal: and fixnums are overwhelmingly the common case 20:51:41 elliott, I see 20:52:05 elliott, not sure if you seen the df thread about how to best set up a mermaid farm? Because their bones are valuable when crafting things of them. 20:52:13 only in dwarf fortress! 20:52:30 Vorpal: no, i don't read that forum 20:52:49 elliott, sometimes it can be fun, or horrible: http://www.bay12forums.com/smf/index.php?topic=25967.0 20:52:54 Vorpal: i could do test cases, but so far there are no language implementations on top of this host 20:53:09 elliott, is it for that language for PH's game? 20:53:31 Vorpal: no 20:53:34 Vorpal: it's Fythe 20:53:44 elliott, mhm, which one is that? 20:53:48 anyway, strictly, gcc doesn't generate the implementations 20:53:53 it generates a partial implementation 20:53:57 which is then cleaned up with a perl script 20:54:02 and a patch is kept to it 20:54:05 elliott, depends on a specific gcc version then? 20:54:06 to fill in things like function prologuee 20:54:10 /epilogue 20:54:12 *prologue 20:54:16 and "jump to here if not overflow" 20:54:44 Vorpal: Fythe is Gregor's general-purpose language implementation VM/parser system 20:54:57 the basis of (the as of yet unimplemented) Plof 4 20:55:05 I don't think it depends on a specific gcc version 20:55:09 most of the patches are pretty general 20:55:27 probably the overflow stuff will have to be redone, but the prologue/epilogue things should be all right 20:55:31 since they're just replacing a string :) 20:55:38 ah 20:56:07 elliott, why are you doing evil mangler sort of stuff instead of using llvm or something 20:56:35 Vorpal: because LLVM doesn't fit Plof's needs? 20:56:46 elliott, in what ways= 20:56:48 s/=/?/ 20:56:50 Fythe is suited for dynamic languages, as well as static onse 20:56:51 *ones 20:56:58 and has a built-in extensible packrat parser engine 20:57:02 hm 20:57:04 which forms the basis of Plof's language extension features 20:57:07 and indeed Plof's implementation itself 20:57:15 you can implement a language in Fythe without writing any C code, basically 20:57:32 Vorpal: the evil mangler stuff is Gregor's idea, it's just how the opcode impls are generated 20:57:45 you could hand-code them if you wanted, but if that route was taken, there probably wouldn't already be an arm backend :P 20:58:04 hah 20:58:13 Vorpal: also, it has an optimisation engine type of thing built in 20:58:19 or, really, arbitrary numbers of passes 20:58:30 and all this is done at runtime 20:58:53 all I'm doing is changing the integer implementation to use bignums on overflow and the like 20:59:19 -!- Sgeo has quit (Ping timeout: 258 seconds). 21:00:24 hmm, I wonder if I could free up a register by adding the two booleans 21:00:27 and conditioning on that 21:00:34 oh wait, that wouldn't let me distinguish right only vs. left only bignum 21:00:55 mangle mangle twist and tangle 21:02:22 -!- elliott has quit (Remote host closed the connection). 21:03:11 -!- elliott has joined. 21:03:18 heyy, gcc has AWESOME builtins 21:03:47 gc spurn and pointer dangle 21:04:01 gah 21:04:05 the builtin that looks cool isn't in 4.4 21:04:58 specifically __builtin_unreachable 21:05:06 i think that would reduce the mangling a little bit 21:05:17 hm the null pointer derefs should become __builtin_trap() instead maybe 21:08:44 Vorpal: fun thing the mangler has to do: rename all labels 21:09:00 otherwise gcc generates them terribly (seemingly pseudo-randomly) 21:09:01 and the diff breaks 21:11:35 -!- impomatic has quit (Quit: ChatZilla 0.9.86.1 [Firefox 3.5.18/20110319140258]). 21:14:47 hello sweethearts 21:17:39 -!- Mathnerd314 has joined. 21:20:27 -!- MigoMipo has quit (Read error: Connection reset by peer). 21:36:13 -!- yiyus has quit (Ping timeout: 276 seconds). 21:36:48 -!- yiyus has joined. 21:39:41 Vorpal: http://codu.org/tmp/reverb-2011-04-11.tar <-- this tar includes no reverb, simple reverb, pan+reverb, and my full room reverb system. 21:40:03 ah 21:40:15 will check tomorrow, have to sleep now. Will wget it 21:40:18 Simple reverb and full room reverb are actually the most similar, but simple reverb gives no sense of space, whereas pan+reverb gives a distorted, actually kind of disturbing sense of space. 21:41:54 Pork. 21:42:52 this sentence no reverb 21:44:01 ,mnbgyuio 21:45:30 * oerjan wonders how you would converse if you could only use neighboring keys consecutively 21:45:40 badly, i assume 21:47:44 redsassertfreesaws 21:48:11 hm, I just had two ideas for a programming language 21:48:18 these aren't actually esoteric ideas 21:48:22 but ones that will make programmers hate me! 21:49:08 1) parentheses and other similar things aren't required to be closed or opened, in fact, they are just operators (this will annoy people 21:49:22 2) white-space affects precedence 21:49:36 the latter has been done 21:49:49 oh, cool 21:50:01 i don't quite recall where 21:50:13 oh, would've been nice to look up 21:50:27 it was discussed here, anyway 21:50:34 * oerjan wonders how you would converse if you could only use neighboring keys consecutively 21:51:05 hyujk, mjuuik, ,li 21:51:07 i give up 21:51:29 Zwaarddijk: even merd did the latter :) 21:51:30 in one channel I'm on 21:51:32 Hmm... Esolang where the program is a general digraph. :-) 21:51:34 merd.sf.net 21:51:46 we once communicated in three-letter abbreviations 21:51:48 elliott: the left side seemed to have more promise. although i ignored the return key... 21:51:49 and such 21:51:58 the idea was to look sort of pseudo-assemblerlike 21:52:44 werdfeedsaweddedsasser 21:52:45 Zwaarddijk: tla huh 21:53:03 oerjan: of course we did it all-caps 21:53:13 elliott: fe? 21:53:19 Bonus points for not associating any data with vertices or edges and having any digraph be valid program. 21:53:26 oerjan: werd-feeds-a-wedded-sasser 21:53:38 i had no o, dammit 21:53:42 elliott: no i mean f does not touch e 21:53:44 Ilari: graphica? 21:53:49 oerjan: sure it does, diagonally 21:53:57 gimme a break :D 21:54:16 well if your keyboard is like a chessboard pattern, maybe 21:54:38 fredsaswedded... bah 21:54:41 -!- Zuu has quit (Ping timeout: 260 seconds). 21:56:31 Of course, that would involve digraph homomorphism problem. 21:57:29 And also likely vertex equivalence. 21:58:54 is that NP-complete? 21:59:53 Graph homomorphism isn't known to be in P nor in NPC. Don't know if digraphs change things. 22:00:10 Don't know about vertex equivalence. 22:00:20 who's vertex eq 22:00:36 i think you mean isomorphism for the "not known"? 22:00:57 or hm 22:00:58 graph homosexuality 22:01:31 Yeah, isomorphic. 22:01:49 oerjan: erm, homomorphism has it as a subcase 22:02:02 when you have the same amount of edges and vertices 22:02:15 oh 22:02:23 but it might be known to be np-complete 22:02:26 i just don't know it 22:02:35 yes, homomorphism is NPC 22:02:45 subgraph is easily seen to be np-complete so prolly okay 22:03:09 -!- iamcal has quit (Read error: Operation timed out). 22:03:15 -!- iamcal has joined. 22:03:21 what's the proof? 22:03:31 i just saw it claimed on wp 22:03:36 oh okay 22:03:48 well easy to believe, maybe i'll think about it later 22:03:50 however actually isomorphism is _not_ a subcase of homomorphism 22:03:56 at least not obviously 22:04:05 because the map is not required to be injective 22:04:22 " when you have the same amount of edges and vertices"? 22:04:29 (for homomorphism) 22:04:34 doesn't help 22:04:45 huh. 22:04:58 maybe i don't know what a function is then 22:05:17 e.g. you have a homomorphism from C4 to itself which collapses two opposing vertices 22:05:36 err, that's not surjective? 22:05:51 homomorphisms are not required to be surjective either 22:05:59 okay so i guess the problem is me assuming it's assumed surjective 22:06:12 because that makes more sense 22:06:13 -!- FireFly has quit (Quit: swatted to death). 22:07:12 -!- Zuu has joined. 22:07:39 Subgraph isomorphism is NP-Complete. But is isomorphism with full graphs? 22:07:41 or, alternatively, it is my opinion that the epimorphism problem is more natural than the homomorphism problem 22:07:52 Ilari: that's the unknown thing 22:07:54 Ilari: that is the unknown question 22:08:50 oerjan: so, for the homomorphism problem, i don't really see how it can be NPC, since you can just map everything to a single vertex? 22:09:12 or hmm 22:09:18 oklopol: no, you cannot map vertices that have edges between them to the same 22:09:29 oh right yeah 22:09:39 then it should work 22:09:59 i think maybe it suffices to consider the "from" graph being complete, for which homomorphism and subgraph isomorphism become the same, and also the same as the maximal clique problem? 22:10:30 (the same because injectivity is then automatic) 22:11:08 Vertex equivalence is equivalence relation: Vertex is equivalent to itself, it is symmetric relation and if x is equivalent to y, and y is equivalent to z, then x is equivalent to z. 22:11:10 which one's the from graph 22:11:30 HOLY MOTHER OF GOD. 22:11:44 Ilari: thank you for this 22:11:45 Anyway, all C_n and K_n graphs have all vertices equivaent. K_n,m graphs (biparite) have two sets of equivalent vertices. 22:12:09 what 22:12:41 Ilari: did god give you The Equivalence Relation? 22:12:46 -!- Zuu has quit (Ping timeout: 260 seconds). 22:13:26 "from" graph as in the one from which you try to find stuff? that can't be complete 22:13:29 -!- Zuu has joined. 22:13:45 oklopol: "from" graph as the domain of the homomorphism function 22:14:31 so homomorphism from K_n to some graph G actually marks a K_n in G 22:14:35 the map goes from the set of vertices of one graph to the set of vertices of another 22:14:46 yes 22:14:47 then we 22:14:51 're done 22:14:55 but let me try to see why. 22:15:15 well as i said it's the maximal clique problem, no? 22:15:24 well yes 22:15:28 i guess we can just take that as a given 22:15:37 that that's NPC 22:15:46 because everyone knows that 22:15:56 * oklopol continues thinking anyway 22:17:09 "Subgraph isomorphism is a generalization of both the maximum clique problem and the problem of testing whether a graph contains a Hamiltonian cycle, and is therefore NP-complete." 22:17:30 sure 22:17:54 the hamiltonian thing doesn't look like it would transfer to homomorphisms though 22:18:11 (cycles can easily have vertices identified) 22:19:00 well you could add new vertices inside the edges to make them directed and unique for the beginning vertex? 22:19:09 well 22:19:12 that doesn't work at all 22:19:17 but otherwise? 22:19:27 * oklopol considers sleeping 22:20:40 the clique problem was one of http://en.wikipedia.org/wiki/Karp%27s_21_NP-complete_problems 22:21:33 ur mom is a np 22:24:27 Ah, of course vertex equivalence and graph isomorphism are equally hard. :-) 22:24:47 what's vertex equivalence? 22:25:26 Ilari: http://en.wikipedia.org/wiki/List_of_NP-complete_problems#Iso-_and_other_morphisms lists somthing called digraph D-morphism, but the link leads nowhere 22:26:42 *something 22:27:24 * oerjan guesses that vertex equivalence means there's an isomorphism of the graph to itself mapping one vertex to the other 22:28:04 then i don't see the equally hard claim 22:28:50 then vertex eq can be reduced to graph isomorphism by marking the vertex with some weird thingie i think 22:29:15 probably 22:29:16 but the other direction i don't see in the vaguest 22:29:35 oh! 22:30:01 ! 22:30:26 make a graph that is the disjoint union of the two, and see if there is a vertex equivalence between vertices from different original graphs 22:30:33 ah 22:30:37 good one 22:30:50 so yeah of course 22:31:21 but i think i solved maximum clique 22:31:43 proving it NP-complete? 22:31:50 yes 22:32:17 take 3sat, and for each (x v y v z) you take three vertices which are not connected, then connect every pair x, y everywhere else, unless x = not y 22:32:28 hm i vaguely recall thinking about that one some months ago 22:32:30 and require one vertex for all 22:32:43 so find K_n where n is the number of clauses 22:33:14 must choose exactly one from all, and it's then K_n unless you made a contradicting choice in two clauses 22:33:42 hm 22:33:49 and yes, i know that was very unclear 22:34:46 but let's see if i know what i mean 22:35:59 if you find some K_n, then you chose one from each clause, so you can just set those to true, then it doesn't matter what you do with other vars, because everything's satisfied 22:36:18 and you can set those to true because there can't be both x and not x chosen from two clauses 22:36:42 if you can satisfy, then just choose one from each clause, you won't get x and not x because, well, x has some value 22:37:05 * oklopol has never felt this formally challenged 22:37:28 are u grokking meh :( 22:38:50 i vaguely recall how i did it, and i think you have a flaw there. you need to also have a vertex for each variable x and each not x, to ensure all settings are globally consistent 22:39:15 but otherwise, that's the idea 22:39:27 i don't think you need a vertex for each variable 22:39:52 yes you do, because you can have a set of clauses that restrict a variable without doing so "locally" 22:40:14 but a K_n marks a true variable in every clause 22:40:29 hm maybe 22:40:35 so you get a satisfying valuation 22:40:37 and conversely 22:40:54 but yeah this might not be the most illustrative way, i just didn't see how it's done with variable vertices 22:41:17 so you choose the correct value of each variable into the K_n, as vertices? 22:41:19 then what? 22:41:43 then you choose that value also in those thingies i contructed i guess 22:41:54 and stuff happens 22:42:06 well anyhow it's kinda obvious, i should go to sleep 22:46:01 hm i think i understand how your method works now 22:46:22 thank god 22:46:39 because i'm like should i try to actually do it or not 22:46:42 but now i can like not 22:46:46 heh 22:47:13 i slept 14 hours last night but for some reason i can't seem to do it now 22:47:59 have you seen the proof for hamiltonian path np-complete? 22:48:37 i'm actually going to read that tomorrow, it's interesting how often the stuff i do at random at uni pops up here 22:48:43 i cannot recall that 22:48:48 usually complexity theory but other stuff too i think 22:48:57 (i don't usually do ct) 22:49:04 (i mean, read ct) 22:49:09 (i don't *do* ct) 22:49:12 (no one does ct) 22:49:43 well *directed* hamiltonian is easy 22:49:48 i'd assume the people over at godel's letter do... 22:50:21 the karp 21 page claimed undirected hamiltonian was proved by reducing it to directed 22:50:30 you have a chain from right to left and left to right for each variable, and put these under each other, have the hamiltonian cycle go through each, in one of the two directions 22:50:36 then, for each clause 22:50:46 you have a vertex, and you can visit it iff you're going in the right direction 22:51:02 in one of its variables 22:51:38 that one is clear when you draw a picture, but i doubt it's gettable from that :D 22:54:34 so basically you have a start vertex up high, and two paths down from it, then between those paths, between their nth vertices, you have paths in both directions, one representing "nth variable true", one representing "nth variable false". you also have edges for changing path from left side to right as you go down 22:55:26 then, somewhere in the middle of say x=false path, you have one of the edges optionally going through a vertex that signifies that a certain clause disjuncting (not x) is true 22:55:49 that should be pretty much it 22:56:36 * oerjan has brain mush again 22:56:49 brain mushmshmsuhmsuhsmhshmsuhmsuhmsmhshsmhsmhsmhsmhsmhmshmshmshmsmhsmhsmhsmhsnhsmhsmh 22:57:08 i'll be happy to clarify if you feel like it 22:57:24 but how the fuck do you reduce directed to undirected.... 22:57:41 wait what 22:57:51 undirected reduced to directed? why would you do that :D 22:58:13 just have edges both ways.. 22:58:14 er i guess the other way 22:58:29 okay 22:59:33 i meant "reduced" as reducing NP-completeness of one to the NP-completeness of the other, which is of course the exact opposite direction of the actual problem reduction 22:59:33 yeah so about the undirected case: i have no idea 22:59:58 yeah 23:00:06 apology accepted 23:00:09 everyone makes mistakes 23:00:22 LET'S NOT OVERDO THIS 23:00:22 especially the ones that are stuppid 23:00:23 hahahaha 23:00:26 hhahahahaahaa 23:00:57 i have to wake up in 4 hours if i want to be at uni before the cleaning ppl :( 23:01:15 the girl that cleans our office is the cutest little thingie 23:02:17 also that was a completely orthogonal note 23:02:26 i'm not even going to the office 23:03:23 anyhow let's see how this goes after proving these mindnumbing trivialities -> 23:10:51 -!- Imk0tter has quit (Ping timeout: 248 seconds). 23:11:04 -!- Imk0tter has joined. 23:11:09 -!- poiuy_qwert has joined. 23:29:42 -!- poiuy_qwert has quit (Read error: Connection reset by peer). 23:31:00 -!- BeholdMyGlory has quit (Remote host closed the connection). 23:32:59 -!- cheater00 has joined. 23:34:37 -!- poiuy_qwert has joined. 23:34:44 -!- poiuy_qwert has quit (Changing host). 23:34:44 -!- poiuy_qwert has joined. 23:35:55 -!- cheater- has quit (Ping timeout: 248 seconds). 23:48:44 Bayesians caught smuggling 23:48:44 priors into Rotterdam harbor 23:48:44 Rogier A. Kievit 23:48:44 Amsterdam, 2-2-2011. A group of 23:48:46 international Bayesians was arrested today in 23:48:48 the Rotterdam harbor. According to Dutch 23:48:50 customs, they were attempting to smuggle over 23:48:52 1.5 million priors into the country, hidden 23:48:54 between electronic equipment. The arrest 23:48:56 represents the largest capture of priors in history. 23:48:58 ‘This is our biggest catch yet. Uniform priors, Gaussian priors, Dirichlet priors, even 23:49:00 informative priors, it’s all here,” says customs officers Benjamin Roosken, 23:49:02 responsible for the arrest. “There are priors for memory experiments, intelligence 23:49:04 tests, flanker tasks, meta-analyses, political preference, everything! God only knows 23:49:06 what would have happened if this had gotten through. We’re pretty lucky to catch 23:49:08 them too. The chance of being in the right place, given the right time, if you take into 23:49:10 account the number of arrests, divided by the number of successful arrests every year, 23:49:14 it’s pretty slim. We’re very glad indeed. ” 23:49:16 ugh, that pasted terribly 23:50:56 -!- ais523 has quit (Remote host closed the connection). 23:56:56 -!- Sgeo has joined. 23:59:54 -!- poiuy_qwert has quit (Ping timeout: 246 seconds).