00:01:45 ok 00:01:52 now how the hell do i solve these equations 00:02:22 bsmntbombdood: what equations 00:02:25 i have a list of tuples of the form (a, b, D[a] ^ D[b]) 00:02:28 i need D 00:02:31 i have magical mathematica so i could give it a go if you want :P 00:02:40 bsmntbombdood: erm d is of length 2 right? 00:02:47 no 00:02:59 bsmntbombdood: that's, uh, not possible, anyway. as you just have the values, not any key stuff 00:03:02 D[a] isn't related to a 00:03:22 a list of tuples of the form (a, b, D[a] ^ D[b]), and D[0] 00:03:36 bsmntbombdood: i'm not convinced that's possible. 00:03:40 it is 00:03:40 bsmntbombdood: wait, are the tuples like 00:03:43 (0,1,...) 00:03:46 (1,2,...( 00:03:46 ) 00:03:50 or is it all permutations 00:04:13 no 00:04:13 bsmntbombdood: ? 00:04:43 bsmntbombdood: which 00:04:51 could be (0, 2), (1, 2) 00:04:57 It's only possible if you have the right tuples, though. If you know D[0], Knowing D[0]^D[1], D[2]^D[3], D[2]^D[4] 00:05:03 Grah, backspace-problem. 00:05:07 fizzie: exactly 00:05:20 ah and you wanna know what (a,b)s you need? 00:05:36 no, i know what a,b's i need 00:05:46 i need to get the data back 00:05:47 given A, A^D, D^B, B^E, E^C, you can solve for all A, B, C, D, E, right? 00:06:02 bsmntbombdood: well 00:06:06 A^(A^B)=B 00:06:09 B^(A^B)=A 00:06:12 you can figure it out frmo that 00:06:13 *from 00:06:16 ... 00:06:59 bsmntbombdood: if we have A, A^D, D^B then B=(D^B)^((A^D)^A) 00:07:02 pretty obvious 00:07:14 oh shit i couldn't have guessed! 00:07:17 You can consider the (a,b) tuple as an edge in a graph, then just find a path that starts from 0 and visits each other vertex. (Then you can walk that path by moving from D[a] to D[b] using D[a] and D[a]^D[b].) 00:07:19 D is thousands of items long 00:07:20 bsmntbombdood: i don't get your question 00:07:23 well, yeah 00:07:35 bsmntbombdood: only thousands is trivial though. 00:07:39 well sorta. 00:08:22 ehird: ok, in a 120 minute 1080p movie, D is 1.7 billion items long 00:08:33 bsmntbombdood: true dat. 00:08:36 so this needs to scale asymptotically well :P 00:08:40 00:07 fizzie: You can consider the (a,b) tuple as an edge in a graph, then just find a path that starts from 0 and visits each other vertex. (Then you can walk that path by moving from D[a] to D[b] using D[a] and D[a]^D[b].) 00:08:43 sounds optimal 00:08:48 i don't get it 00:08:54 bsmntbombdood: it's just graph-walking 00:09:06 bsmntbombdood: ofc you want to do this at encode-time, right? 00:09:12 you're not expecting to do this in real-time i hope 00:09:15 no,this is decoding 00:09:30 bsmntbombdood: then it'll be far too slow 00:09:38 i don't think so 00:09:44 You don't of course actually need a single path that visits each vertex. You just need to have each vertex reachable from 0. 00:09:52 i was thinking to just keep a sparse array of data-dependencies 00:09:59 bsmntbombdood: finding a shitload of short paths in 1.7 billion items? 00:10:06 that'll take weeks, man 00:11:22 i don't think so 00:11:30 locality of reference is high 00:11:37 fizzie: can you disillusion fizzie 00:12:00 bsmntbombdood: btw this codec is useless if you can't decode fast, because otherwise you need the disk space for the full version :) 00:13:27 Well... if you have a bitmap of all the D[x]'s you know (initialized to contain only D[0]) you can just loop the following: for each known D[a], take all the (a,b) tuples for which D[b] is unknown and use D[a] and D[a]^D[b] to find out D[b]. Then stop when during one iteration you didn't discover any new D[b]'s. If there are any remaining unknown ones, you're out of luck. 00:14:01 fizzie: That seems filesize-inflatingly. 00:14:26 I haven't really been following the context here; I was just talking about the abstract thing. 00:14:33 I was watching a lossily compressed movie. :p 00:14:35 keep a map of undecoded tuples, that you scan for dependencies, outputting as you go 00:16:29 wait it's easier than that 00:17:02 00:17:30 the tuples go (1, 2), (2, 4), (4, 3), (3, 5) 00:17:38 If you're sure you actually have that case like "A, A^D, D^B, B^E, E^C, ..." where you have a single path, you can just directly walk through it by keeping the tuples in map where you can easily index by a. 00:18:02 (Or even in an array, ordered by a, since each one will only be there once.) 00:18:25 an array won't work because you can't keep a whole movie in memory 00:18:47 i eagerly wait you decoding this fast enough to watch 00:18:55 -!- Gracenotes has joined. 00:21:03 If you don't want to keep the whole movie in memory, I guess you have some sort of thing there that you don't get a (1, [last block of the movie]) tuple. 00:21:35 yes 00:21:46 the encoder uses a fixed-sized window 00:27:30 no i know i cant download the whole internet. but u know how u can save website to youre computer...can i download facebook or even just the facebook chat 00:27:37 http://forums.macrumors.com/showthread.php?t=717413 00:28:23 hm. 00:28:30 opinion required 00:28:40 psygnisfive: ur a fag 00:28:43 :o 00:28:45 opinion given 00:28:47 omg rally? 00:28:52 yes 00:28:55 a rally of OMGs 00:28:56 :o 00:29:34 Quote: 00:29:34 Originally Posted by rdowns 00:29:36 Can't believe no one mentioned this. Just take a server on the plane. 00:29:38 where can i get one and do they let u take them on the plane? if i do will i be able to use fb and aim? im just really scared of goin on the plane and it wd be cool to talk to friends 00:29:41 xDDDDDDDDD 00:29:46 ehird, im thinking of designing a grammar engine language 00:29:50 k 00:30:35 and what i intend to do is have grammar rules be first class in the language 00:31:34 -!- GreaseMonkey has joined. 00:36:12 ok now i'm bored 00:38:23 bsmntbombdood: turn green. 00:39:17 http://pastebin.ca/1459422 00:39:22 ehird: you can finish 00:39:34 that's your completely untested compressor 00:39:35 bsmntbombdood: meh 00:39:43 it own't it won't compress enough :) 00:47:56 wow now this is weird 00:48:09 bsmntbombdood: wut 00:48:29 i started playing with elias-gamma coding results from just the sequential xoring 00:48:32 on integers 00:48:34 yah? 00:48:51 it seems to work well with multiple passes 00:49:16 bsmntbombdood: sweet 00:49:22 you could just put it in a loop where it stops if it doesn't help :P 00:50:31 actually, it will expand a ton, then shrink back smaller 00:50:42 hahaha 00:50:42 running on range(1000) 00:51:33 bsmntbombdood: i'm not exactly sure how elias gamma would ever shorten it 00:52:37 easy 00:52:47 after xoring, you end up with lots of small numbers 00:53:20 bsmntbombdood: but elias-gamma always is longer than the source 00:53:40 uhhuh 00:53:48 bsmntbombdood: http://en.wikipedia.org/wiki/Elias_gamma_coding 00:53:50 how am I wrong? 00:53:54 it always prepends something to the binary 00:53:57 thus it will never shrink 00:54:03 what do yo mean by source? 00:54:13 bsmntbombdood: the number you're encoding 00:54:16 that's only meaningful for a certain encoding of source 00:54:16 * Kolonai ponders how to store and combine fractions of bits. 00:54:30 bsmntbombdood: do you mean that elias-gammaing it, then gzipping, sometimes shortens it? 00:54:32 i can believe that 00:54:35 no 00:54:44 bsmntbombdood: so htf does it shorten it 00:55:03 you take 1, 1^2, 1^2^3, 1^2^3^4, etc 00:55:11 possibly more than once 00:55:19 then elias-gamma that 00:55:34 bsmntbombdood: bitsin(elias-gamma(x))>bitsin(x). 00:55:39 so elias-gamma can never shorten... 00:56:17 bitsin(natural number) is nonsensical 00:56:32 bsmntbombdood: bitsinbinaryrepresentationof. 00:56:52 how do you encode an arbitrary natural number in binary? 00:57:11 http://en.wikipedia.org/wiki/Prefix_code+ 00:57:13 bsmntbombdood: from [[Elias gamma coding]]: 00:57:17 To code a number: 00:57:17 Write it in binary. 00:57:20 QED. 00:57:52 sigh 00:57:59 bsmntbombdood: you're saying that sometimes elias-gamma shortens the input 00:58:04 that makes no fucking sense 00:58:21 how are you going to find the boundaries between the numbers? 00:58:31 you're not 00:58:34 but elias-gamma has overhead 00:58:36 plain and simple 00:58:39 IT CAN NEVER SHORTEN 00:58:45 why are you dodging that? 00:58:52 you are saying that elias gamma is shortening at some point 00:58:53 that's nonsensical 00:58:54 shorten compared to _what_ 00:59:00 i don't freaking know 00:59:01 you said it 00:59:07 00:50 bsmntbombdood: actually, it will expand a ton, then shrink back smaller 01:02:01 -!- BeholdMyGlory has quit (Read error: 54 (Connection reset by peer)). 01:04:43 -!- psygnisfive has changed nick to augur. 01:10:43 -!- amca has joined. 01:13:07 -!- FireFly has quit ("Later"). 01:21:41 ehird: for example, the sequnce (1, 200000) is compressed into 208738 bits 01:22:02 hmm 01:22:09 bsmntbombdood: odd definition of compress :) 01:22:22 that's an odd definition? 01:22:38 >> 200000<208738 01:22:38 => true 01:22:39 i'd say 01:22:48 i get that it's a compact representation 01:22:50 but it's not compression :P 01:23:22 uh, ok -- naively, using 18 bit ints, it takes 3600000 bits 01:23:51 well,yeah 01:24:18 or, using elias gamma without any xoring, it takes 6475750 bits 01:24:27 yah 01:24:32 it's a good representation 01:24:34 i'll give you that 01:26:15 obviously it's very good with runs - each item takes 1 bit 01:29:56 [4, 12, 4, 3] * 1000 -> 4018 bits after 4 iterations 01:35:27 -!- jix has quit (Read error: 113 (No route to host)). 01:50:20 you know, bzip2 ought to be really easy to paralellize 01:50:35 because the block sorting is probably the slowest part, and that's done in fixed sized blocks 01:51:44 bsmntbombdood: Can I ask what block sorting is? 01:52:18 burrows-wheeler transform 02:24:25 -!- oerjan has joined. 02:30:34 -!- oerjan has quit ("Reboot"). 02:34:28 -!- oerjan has joined. 02:45:28 -!- calamari- has joined. 02:45:31 -!- calamari has quit (Read error: 110 (Connection timed out)). 03:29:23 -!- calamari- has quit ("Leaving"). 03:38:32 GregorR, GreaseMonkey, Gracenotes: This channel ain't big enough for the three of us. 03:38:39 heh 03:38:41 'lo. 03:38:54 * GregorR growls. 03:38:55 Grrrrrrrrrrrr 03:42:32 egorR 03:42:36 RRRRRRRRRRRRRR 04:13:14 -!- augur_ has joined. 04:13:14 -!- augur has quit (Read error: 104 (Connection reset by peer)). 04:16:42 -!- Corun has quit (Read error: 110 (Connection timed out)). 05:12:13 -!- augur_ has changed nick to augur. 05:33:41 -!- oerjan has quit ("leaving"). 05:57:01 -!- oerjan has joined. 07:04:54 http://codu.org/music/auto/Blusteringly%20Versed%20Sonata.ogg // the latest version of my algorithm is having some sweet results 8-D 07:16:22 (02:14:53 AM) <>: My friend didn't think that second one was made by ai 07:16:28 Cool, it passes the musical Turing test :P 07:22:14 wtf is that 07:22:50 It's music made by an algo I wrote. 07:22:51 is it ai or just generative? 07:23:04 Just generative, but I choose not to correct my friend :P 07:42:51 -!- kar8nga has joined. 07:48:28 masterpiecemachine.com is registered and hasn't been updated in 9 years ... 07:48:32 And has no content. 07:48:38 I think I should email the owner and ask to buy it :P 07:49:52 what, you mean wolfram hasn't bought it for their alpha yet? ;D 07:51:15 :P 07:51:29 *his 07:56:26 -!- coppro has quit (Read error: 110 (Connection timed out)). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:04:35 oerjan, you were using the Royal 'they' 08:04:51 ah that may be true 08:04:58 ;) 08:05:09 because Wolfram is a royal twit 08:05:10 :D 08:05:37 thank you, explainer-of-jokes 08:06:06 NO PROBLEM, CITIZEN. 08:06:09 * augur flies off 08:06:22 oerjan: that should be masterpieceautomaton.com. 08:06:41 might be, might be 08:06:50 except i'm pretty sure alpha is no CA 08:08:41 not all automaton are cellular automaton! 08:08:48 .. automata? 08:09:07 tsk tsk 08:09:18 automats. 08:09:27 er... 08:09:47 i don't think that's english... 08:10:04 oh wait it is 08:10:11 it just means something different 08:10:19 i just made it up for fun. 08:10:23 stop being ridiculous. 08:10:34 um but it is 08:10:39 http://en.wikipedia.org/wiki/Automat 08:11:46 no, im sure it is 08:11:51 im saying i just constructed the word on the fly 08:12:06 that it is homophonous with an existing word is coincidental and can be dismissed as irrelevant. 08:12:19 on a related note: http://en.wikipedia.org/wiki/File:Bamn_Automat.png 08:12:23 ive been past there. 08:13:41 sad to hear they've closed 09:16:39 -!- tetha has quit (Nick collision from services.). 09:16:48 -!- tetha has joined. 09:40:52 -!- ais523 has joined. 09:44:31 -!- ais523 has quit (Read error: 54 (Connection reset by peer)). 09:44:41 -!- ais523 has joined. 10:03:49 -!- oerjan has quit ("leaving"). 10:06:55 -!- MizardX- has joined. 10:12:23 morning 10:12:24 hi ais523 10:12:26 morning 10:17:46 -!- MigoMipo has joined. 10:21:56 -!- whtspc has joined. 10:24:36 i have made a sketch for an esolang based on nand logic-gates 10:24:40 -!- MizardX has quit (Read error: 110 (Connection timed out)). 10:24:47 it lacks recursion for now 10:24:54 -!- MizardX- has changed nick to MizardX. 10:25:33 at initialisation you have a infinite memory tape filled with 0's 10:26:40 every memory cell has the adress named by a natural number 10:27:18 the main syntax of the language is this: 10:27:30 1:2#3 10:27:58 hm 10:28:16 whtspc, so how do you program in it? 10:28:18 which means that the result of the value at adress 2 NAND the value at adress 3 will be put in adress 1 10:28:21 ah 10:28:48 3:1#2/4:3#1/5:3#2/6:4#5 10:28:48 whtspc, are the rules processed in order, iterating through the list? 10:29:07 if 1 is equal to 2, 6 is false (0) 10:29:14 Anmaster: yes 10:29:20 mhm 10:29:58 You will be able to input with the following command ,adress 10:30:13 and it will put the binary byte starting at the adress 10:30:21 outpt: .adress 10:30:35 whtspc, based on how bf does it? 10:30:36 :P 10:30:51 well yes 10:31:08 whtspc, hm, you can't skip input/output based on conditions can you? 10:31:10 so I need a thing for recursion that's more creative 10:31:31 so you will always have to input/output a fixed number of bytes each iteration 10:32:24 whtspc, are these rules separated by a newline in the input or? 10:32:25 It needs an if-construction 10:33:10 hm 10:33:14 I like esolangs without newlines, so probably a / will separate the actions 10:33:52 heh 10:34:20 whtspc, are you new here? I don't remember seeing you here before. 10:34:42 I like some fair feedback (tell me it's boring/been done a 1000 times before), so I can quit working on it :) 10:34:58 I don't come here often 10:34:59 I once made paintfuck 10:35:00 whtspc, actually I haven't heard of something like this before. 10:35:07 a 3-day hit :) 10:35:24 yes, thanks for that 10:35:30 it's rare to see a BF derivative that is actually interesting 10:35:32 but Paintfuck was 10:35:36 indeed 10:35:47 well, thank you 10:36:54 I find it rather boring to insert [ ] in the nand-language 10:37:15 it would probably look like 6[ 10:37:34 whtspc, that looks like some sort of IR representation for some optimising BF compiler 10:37:36 :) 10:37:36 if memorycell 6 is false skip the parentheses 10:37:51 whtspc, you need more nand 10:38:13 what about "if memory cell x nand y != memory cell z then" 10:38:17 or something like that 10:38:32 or maybe fix z to 0 or such 10:38:39 excuse me but what's IR representation? 10:39:09 whtspc, oops, that would be "Intermediate Representation representation" 10:39:10 more NAND to complicate, or as feature? 10:39:17 so drop one of those representation, 10:39:27 s/,/./ 10:39:34 whtspc, not sure. 10:39:54 whtspc, is that bitwise nand btw? 10:40:05 yep 10:40:12 so how large is each "cell"? 10:40:24 one bit 10:40:33 true or false 10:40:38 hm ok. So then it is same as logical nand for this purpose 10:42:47 Could one cell (for instance cell 0) be the checkup cell for iteration? 10:43:19 so the program is divided in portions with eg. char ! 10:44:02 when program reaches ! it checks memory cell 0, if true go back to previos ! 10:44:14 hm 10:44:39 whtspc, might work. You need some way to shuffle data to/from this cell in between 10:44:49 also another question. How do you fill in initial values 10:45:09 wait. with nand that isn't an issue is it? 10:45:15 A:A#A 10:45:19 with 'and' it would be. 10:45:27 the initial value is 0 10:45:48 nand always confuse me. Probably because most languages doesn't have it. 10:45:53 C doesn't iirc for example. 10:45:56 memA NAND memA is the same as not memA 10:46:01 which makes it 1 10:46:04 indeed 10:46:07 AnMaster: !(a && b) 10:46:10 = a NAND b 10:46:12 ais523, right 10:46:24 no need for a separate operator, you can trivially form it out of the ones you have 10:46:31 ais523, right. 10:47:42 if you have one cell to check for returning back to previous ! 10:47:55 I think you can't have loops in loops 10:49:58 whtspc, can't you shuffle the value around 10:50:22 like "move loop cell to cell x, move cell y to loop cell" 10:50:22 ? 10:50:32 not sure how you would do that with nand 10:50:38 but might be possible? 10:50:59 you can swap two values with just nands 10:51:07 make the nands into xors and do an xor swap 10:51:31 that would be very interesting 10:52:47 or maybe it'sjust the same as checking wether the state of a certain cell is true/false 10:52:59 but complicated with swapping 10:54:11 think so 10:58:35 other thing that worries me a bit is that when an adress isn't pointed to in the program, it can never be part of execution 10:58:43 but I don't know if that 10:58:54 is problem to make working language 11:12:32 Oh, and the name of the language would probably refer to a certain ABBA song 11:13:06 FERnO 11:13:12 FER#O 11:13:23 fernando 11:13:47 because more esolangs should refer to ABBA-songs 11:22:51 -!- amca has quit ("Farewell"). 11:28:59 -!- BeholdMyGlory has joined. 11:31:29 -!- bsmntbombdood has quit (Read error: 60 (Operation timed out)). 11:36:35 -!- M0ny has joined. 11:55:06 -!- tombom has joined. 11:58:12 -!- GreaseMonkey has quit ("YES -> thor-ainor.it <- THIS IS *DELICIOUS*!"). 11:58:29 -!- M0ny has quit. 12:05:33 -!- bsmntbombdood has joined. 12:10:31 -!- ehird has left (?). 12:10:35 -!- ehird has joined. 12:10:49 -!- whtspc has quit ("ChatZilla 0.9.84 [Firefox 3.0.11/2009060215]"). 12:16:56 -!- inurinternet has quit (Read error: 60 (Operation timed out)). 12:20:02 -!- FireFly has joined. 12:27:39 -!- bsmntbombdood has quit (Success). 12:33:56 -!- MaxDrAkyla has joined. 12:34:13 -!- MaxDrAkyla has left (?). 12:52:55 -!- sebbu has joined. 13:01:14 -!- ais523 has quit (Remote closed the connection). 13:08:03 -!- sebbu2 has quit (Read error: 110 (Connection timed out)). 13:18:49 -!- BeholdMyGlory has quit (Remote closed the connection). 13:37:48 -!- kar8nga has quit (Read error: 110 (Connection timed out)). 14:23:36 -!- olsner has quit (Read error: 110 (Connection timed out)). 14:31:20 "Amusing random IRC paste from people with names like 'BBB' and 'Dark_Shikari'. Very authoritative. Links to specific patents please. Thanks." 14:31:25 — because authority is determined by IRC nickname. 14:33:44 -!- MigoMipo has quit (Read error: 60 (Operation timed out)). 14:49:53 -!- MigoMipo has joined. 14:53:54 -!- jix has joined. 14:54:09 -!- Corun has joined. 15:03:34 -!- oerjan has joined. 15:04:15 -!- olsner has joined. 15:14:29 -!- Gracenotes has quit (Read error: 104 (Connection reset by peer)). 15:25:53 ehird, where is that quote from 15:26:03 AnMaster: reddit. 15:26:22 BBB and Dark_Shikari are developers of x264, which is basically the best open source lossy video encoder in existence. 15:26:33 heh 15:26:33 we figured u reddit, but _where_? 15:26:33 (and possibly one of the best lossy encoders full stop) 15:26:44 oerjan: haw haw haw 15:29:13 oerjan, I like the annotation to IWC today 15:29:22 me too 15:29:57 heh 15:30:12 oerjan, I guess having a computer program that need exact time doesn't count? 15:30:59 rolexes are for people, not computer, AnMaster. 15:31:04 *s 15:31:23 "Seriously, who need to know the time to better than a few seconds anyway" 15:31:35 unless your program is a strong AI, anthropomorphizing it is wrong. 15:31:43 -!- Asztal has quit (Read error: 60 (Operation timed out)). 15:31:47 yeah they don't like that 15:32:23 -!- sanxiyn has joined. 15:34:44 -!- Asztal has joined. 15:39:04 YARGH 15:39:06 Jun 14 15:37:41 tux [99654.704060] ata4.00: exception Emask 0x0 SAct 0x0 SErr 0x0 action 0x6 frozen 15:39:06 Jun 14 15:37:41 tux [99654.704075] ata4.00: cmd ca/00:01:98:7d:65/00:00:00:00:00/e6 tag 0 dma 512 out 15:39:06 Jun 14 15:37:41 tux [99654.704078] res 40/00:00:01:4f:c2/00:00:00:00:00/00 Emask 0x4 (timeout) 15:39:19 Anyone have the paintfuck .swf lying around? Asztal? You did some stuff with it. Slereah? 15:39:19 the computer locked up for about half a minute during that 15:39:27 The file upload expired. 15:39:30 it seems it re-initialised the drive after: 15:39:41 Jun 14 15:37:41 tux [99654.704084] ata4.00: status: { DRDY } 15:39:42 Jun 14 15:37:41 tux [99654.704112] ata4: soft resetting link 15:39:42 Jun 14 15:37:41 tux [99654.861464] ata4.00: configured for UDMA/100 15:39:42 Jun 14 15:37:41 tux [99654.861484] ata4: EH complete 15:42:51 -!- bsmntbombdood has joined. 15:43:45 ehird, any clue what DRDY is? All I find on google is various error messages containing it, and some vague mention saying basically "DRDY is useless, it should not have been in the standard". But I can't find a description on what this "DRDY" _is_... 15:43:57 Context? 15:44:07 ehird, ATA error message from dmesg 15:44:14 Jun 14 15:37:41 tux [99654.704084] ata4.00: status: { DRDY } 15:44:19 AnMaster: get ata standard? 15:44:29 ehird, expensive or open? 15:44:37 AnMaster: piracy 15:44:41 http://www.t13.org/ 15:44:43 http://www.t13.org/ 15:44:44 er 15:44:45 Technical Committee T13 is responsible for all interface standards relating to the popular AT Attachment (ATA) storage interface utilized as the disk drive interface on most personal and mobile computers today. 15:44:53 AnMaster: it may be open. 15:44:58 ok 15:45:04 ehird, so you didn't happen to know what it was then? 15:45:08 nope. 15:47:49 ah found another way 15:47:50 include/linux/ata.h: ATA_DRDY = (1 << 6), /* device ready */ 15:47:51 grep 16:05:25 -!- KingOfKarlsruhe has joined. 16:07:39 15:39 ehird: Anyone have the paintfuck .swf lying around? Asztal? You did some stuff with it. Slereah? 16:11:05 -!- kar8nga has joined. 16:16:25 f=:*/1+i. 16:16:35 hmm fails 16:18:08 http://firefly.nu/diverse/bottles.html <-- I want CSS conditionals :| 16:18:38 And HTML in content:-inserted content 16:18:38 haha awesome 16:18:53 FireFly: just do things like :after:after:before 16:18:55 and use CSS on 'em 16:19:04 Hm, is that actually possible? 16:19:18 hopefully 16:19:19 also 16:19:27 there is pseudo-element for that 16:19:28 FireFly: yours goes to -1 bob :) 16:19:36 lifthrasiir: he knows that much... 16:19:53 Yeah, I know 16:20:01 I can't correct the grammar either 16:20:13 so is there any way to loop only using css? 16:20:17 no 16:20:25 just replicate? :S 16:20:53 My first idea was to insert a new
in the :after content, e.g. recursively 16:21:00 But I realised I can't insert HTML :( 16:21:06 -!- MizardX has quit (Read error: 104 (Connection reset by peer)). 16:21:11 -!- MizardX has joined. 16:37:24 16:07 ehird: 15:39 ehird: Anyone have the paintfuck .swf lying around? Asztal? You did some stuff with it. Slereah? 16:37:24 :(( 16:41:56 oh, it's expired? 16:42:09 yes 16:42:37 how idiotic 16:46:12 oerjan: haf you got it? 16:46:28 certainly not 16:46:35 butt 16:47:23 Aren't there other implementations? 16:48:25 yes, a javascript one 16:48:38 yeah but they're all shit to use 16:48:41 and slow and crap. 16:49:16 even the C/C++ ones? 16:49:22 yah. 16:49:24 well 16:49:26 might not be slow 16:49:28 but suck to use. 16:56:15 -!- Corun has quit ("Leaving..."). 17:01:28 i'm gonna try the uberman's sleep schedule soon. 17:01:51 in spite of all the "if you're under 18 or pregnant don't do this you fucking retard you need >3hrs of sleep a day" warnings people say. :) 17:03:14 well you should at least be safe on the pregnancy issue. 17:03:29 yeah i don't plan to get pregnant any time soon 17:04:55 i'm just wary about losing ~10 days to insanity 17:05:18 also bsmntbombdood had a pretty fucking bad time with uberman's :P 17:05:31 I don't have the .swf, sorry :( 17:05:38 i figure anyone who starts with uberman's at this point is already insane, so nothing to worry about. 17:05:43 Asztal: do you have the .exe? 17:05:46 -!- bsmntbombdood has quit (Read error: 110 (Connection timed out)). 17:05:53 i might be able to extract the .swf or sth 17:05:55 oerjan: yah 17:05:59 ehird: possibly, likely in fact 17:06:09 oerjan: to boot, lack of sunlight depresses me :) 17:06:14 though I preferred the javascript + canvas one 17:06:24 guess i could buy one of those sunlight emulators 17:06:59 ah, I do have the SWF 17:07:13 yay! 17:07:21 Asztal: <3 17:07:40 i should write some stuff when i start uberman's 17:07:52 i end up pretty surrealist after a day with no night's sleep 17:08:00 imagine 3 days 17:08:53 the really cool thing about uberman's is how it rewires your brain to enter REM immediately 17:09:06 Asztal: so uh could you upload it :D 17:09:37 preferably somewhere permanent, the wiki is missing a working link... 17:09:48 yuh, filebin.ca would be nice 17:10:09 -!- jix has quit ("Lost terminal"). 17:11:09 that goes for the .exe too 17:11:16 oerjan: btw if i do uberman's for 70 years (= 83, a bit optimistic life expectancy but the march of technology etc) straight, i will gain an extra 14 and a half years awake :D 17:11:25 oerjan: the .exe is just a compiled .swf, so it's rather useless 17:12:28 of course the disadvantage is: if it does physiological damage, i'll be worse off than if I tried uberman's later, due to being younger and still growing 17:12:33 but meh! 17:13:22 the exe is 3MB, too 17:13:24 http://filebin.ca/hevveq/pain.swf 17:13:46 I'd upload to my own website, but that looks rather unpermanent at the minute :( 17:14:03 Somebody put it in the files archive. 17:14:25 * pikhq seems to be somewhat likely to hit 80... 17:14:49 Given that my relatives tend to die in their 80s or 90s. 17:15:01 pikhq: i think that's pretty much a given if we all avoid being killed. with the accelerating rate of science and the possibility of the singularity, 80 is a weak, weak estimate :) 17:15:14 ehird: Right, right. 17:15:34 also cryonics; if it works, there's people like 150 years old alive :) 17:15:38 Speaking of: We are fucking *growing organs* and *putting them in people*. 17:15:41 ;) 17:15:43 well, in a solid state coma 17:15:44 but alive 17:15:56 pikhq: a performance artist got himself an ear grown and put it on his arm 17:15:58 and i just thought 17:16:04 why the fuck do you want a grown ear on your arm 17:16:10 WHAT IS THE POINT OF THAT IT DOESN'T EVEN DO ANYTHING 17:16:16 IT JUST HEARS AND RELAYS THE HEARING ONTO NOTHING 17:16:18 "solid state coma" 17:16:29 GregorR: Yuh-huh? 17:16:38 I just like that expression :P 17:16:49 Well, 'strue :P 17:16:57 ehird: at this rate you could well end up getting pregnant... 17:17:07 singularity babies 17:17:34 * ehird installs standalone flash player 17:18:54 -!- pikhq_ has joined. 17:19:10 -!- pikhq has quit (Nick collision from services.). 17:19:16 -!- pikhq_ has changed nick to pikhq. 17:21:38 yay 17:21:40 it loads 17:21:43 now to play with it! 17:21:57 paintfuck is fun :) 17:22:49 05:55:14 pgimeno: whtspc: *[[se*nwnw*se*se]*[ne*swsw*ne*ne]*] 17:22:51 okay i love how that bounces around. 17:25:41 ahhh it's so nice to watch the pseudoturing automata. 17:26:10 ehird: http://codu.org/music/auto/Ridiculously%20Absent%20Toccata.mid (or .ogg) 17:26:39 GregorR: it's good, but the tunes as of late have been a bit too dramatic imo 17:26:59 lawl 17:27:20 GregorR: wow, my midi is way better than yours 17:27:25 the .ogg sounds like shit 17:28:17 What's your soundfont? 17:28:29 GregorR: OS X's/ 17:28:30 *. 17:28:35 Argh 17:28:43 Since they acquired eMagic's Logic, I guess they put a lot of stock into it 17:29:06 GregorR: I could try and record the .mids if you want. 17:29:17 Yeah, I'd like to give one a listen. 17:29:39 GregorR: Sure. Name a track. 17:29:42 That one? 17:29:46 It sounds great. 17:29:49 That or Onerously, sure. 17:30:07 GregorR: Render Cake-Eating on your box, I bet it sounds like crap because your midi doesn't jive with it :P 17:32:20 No chance that it sounds like crap because, oh, it sounds like crap? X-P 17:32:39 Absolutely not. 17:33:01 -!- Corun has joined. 17:35:25 GregorR: Recordinng ridiculously absent tccata. 17:35:27 *Recording 17:36:17 -!- BeholdMyGlory has joined. 17:36:22 *Toccata 17:37:06 Sound font oh I want good sound font :( 17:38:04 GregorR: Recordedamated. 17:38:24 sanxiyn: oello 'aven't seen you before here. 17:38:28 GregorR: Uploadingermating. 17:38:47 ehird: Actually I haven't been here at all... 17:38:56 lifthrasiir told me about here. 17:39:08 Well, that would make sense :P 17:39:09 -!- oerjan has quit ("what about a sound mind?"). 17:39:27 Actually I'm now in the same room lifthrasiir lives :) 17:40:29 GregorR: http://filebin.ca/bmdpxh/RidiculouslyAbsentToccata.mp3 17:41:29 Well, it doesn't sound like the difference is any technical innovation, just a better soundfont. 17:41:45 GregorR: Of course. 17:41:50 GregorR: But it does sound an awful lot better. 17:41:54 Your rendering sounds, well, MIDI :P 17:41:59 So does yours. 17:42:01 Just better MIDI. 17:42:14 Meh. I'ma render cake-eating now, since I'm insistent that's a good song. 17:46:50 GregorR: May you know the Lord's true sound... 17:46:53 (upload upload upload) 17:47:08 Don't you mean "the LORD" 17:47:54 GregorR: יהוה 17:47:58 GregorR: http://filebin.ca/wojhum/OnerousCake-EatingFestivalDisallowmentBarricade.mp3 17:48:14 And on the eighth day, God created good MIDI soundfonts. 17:48:22 And he saw what it resulted in; and it was good. 17:48:34 And on the ninth day, he made them expensive and only bundled them with shitty OSes :P 17:48:46 Nobody's perfect :P 17:49:15 -!- MizardX has quit (Connection timed out). 17:50:01 http://nedbatchelder.com/blog/200906/side_project_endgame.html <- so true 17:50:01 GregorR: Anyway, thou shalt now see its true colours. 17:50:09 Yeah, it is vaguely musical here :P 17:50:49 GregorR: I'm curious to how it sounds on your end; totally random notes? :P 17:51:09 No, not that dissimilar, but pretty hectic. 17:51:21 Converting 17:52:40 GregorR: I'll start liking even the worst ones when I Uberman myself up. 17:52:44 Uploading 17:52:54 -!- MigoMipo has quit (Nick collision from services.). 17:52:55 -!- MigoMipo_ has joined. 17:53:00 Because you'll be tired all the time. 17:53:29 GregorR: Well, yeah; it *is* a 10-day sleep deprivation program before you adjust. 17:53:40 -!- MigoMipo_ has quit (Client Quit). 17:53:52 -!- MigoMipo has joined. 17:53:58 Shit can fuck you up; 13 days of no sleep will make you go insane and kill you. With Uberman's you start napping on day two or so, though, so it's more like the effect of 3 days. 17:57:52 http://filebin.ca/ctegd/OnerousCake-EatingFestivalDisallowmentBarricade.ogg 17:58:42 GregorR: Wow, that misses the main melody line. 17:58:54 And a bunch of the hooks. 18:00:11 GregorR: That's really awful to listen to, I keep getting the expectation of melody yet none comes. 18:02:53 -!- kar8nga has quit (Read error: 104 (Connection reset by peer)). 18:08:01 hmm 18:08:08 i should specify my circuit CA 18:13:37 hahaaha someone thinks that the uberman's schedule was made by a guy called uberman 18:13:41 *hahaha 18:15:54 ehird: Beat him with ubermensch. 18:16:01 hmm 18:16:02 [[After sleep deprivation there is a sharp rebound of SWS, suggesting there is a "need" for this stage.]] 18:16:07 uberman's skips that stage 18:16:11 it goes straight from a quick stage 1 to REM 18:16:21 otoh i've never heard anyone doing uberman's properly actually have any problems 18:17:10 I've heard of problems. 18:17:15 All of them social. 18:17:21 well, yes 18:18:22 pikhq: otoh polyphasic sleep doesn't inherently impair social stuff 18:18:34 http://en.wikipedia.org/wiki/Polyphasic_sleep#Comparison_of_sleep_patterns 18:18:39 for instance, biphasic there is trivial 18:18:44 you just reserve some time at noon 18:18:57 It's not inherent, it's just that it's tricky to take a nap every few hours. ;P 18:19:09 pikhq: however... a woman with a kid and everything (the inventor of Uberman) is doing Everyman 18:19:16 Hmm. 18:19:23 (= uberman but 4 naps instead of 6, and one is longer) 18:19:37 lemme dig a link 18:20:14 http://www.puredoxyk.com/ 18:20:25 and http://www.puredoxyk.com/index.php/category/polyphasic/ 18:21:01 pikhq: but i could see, say, spending the day in another town would be difficult 18:21:09 obviously 18:21:24 since you'd have to sleep on a bench somewhere while everyone else you're with goes off and does whatever :P 18:21:31 apart from that though... 18:22:10 pikhq: the guy who thinks "Uberman" invented it says they gave up after four days because they had no idea what to do with 22 hour days 18:22:14 they're barmy! 18:22:19 days are sooooo short 18:22:28 htf do you think that 18:22:33 unless you're mr bored mcboredson 18:23:01 I'm capable of using all 24 hours in a day. 18:23:41 yah. gimme some sunlight and a rested body and i'll never, ever want to stop 18:24:01 despite this i accomplish very little; but that's just adhd-esqueness and perfectionism :) 18:24:22 "Like one day I set my alarm clock, lied down on my bed, laid my head on my pillow, and the alarm clock sounded. I slowly got up and looked at it. Twenty minutes had passed in what felt like one second. It was the fastest I’ve ever gone to sleep in my life." 18:24:30 i wonder if this works for someone who can never sleep :) 18:24:34 my mum likes Ridiculously Absent Toccata 18:25:54 it's very likeable 18:26:16 apparently lucid dreaming is a lot easier w/ uberman's and dream recall is perfect 18:26:20 SimonRC should try it :-) 18:26:36 Uberman's is sounding more fake every minute. 18:27:06 GregorR: howso? 18:27:11 My roommate did polyphasic sleep last semester. 18:27:15 multiple independent sources have tried it and gone through with it 18:27:18 I think it lasted a couple of weeks. 18:27:19 and reported the same effects 18:27:31 He then went back to his 2-4 hours of sleep at night. 18:27:32 and the two who have done it are very avid about it 18:27:37 i don't see why it'd be some prank 18:29:06 GregorR: also, infants sleep polyphasically 18:29:16 80% of their sleep is REM — just like napping schedules. 18:29:23 GregorR: and they sleep sporadically in ~20 minute bursts. 18:30:23 Also, the human norm is biphasic sleep. 18:30:30 yeah 18:30:34 (see: siesta) 18:30:57 if you let it go naturally — which our culture doesn't — you start polyphasic then transition to biphasic, which is a minor change, really 18:31:02 just consolidating one to three naps 18:31:10 so really, uberman's is just tweaking it a little /shrug 18:31:24 -!- inurinternet has joined. 18:32:26 my main problem with uberman's will be giving up caffeine 18:33:04 you could do caffeine on everyman's and biphasic 18:33:22 but unless you have just a small amount right after waking in Uberman's, yer gonna miss your nap 18:33:27 I can play the first 1/2 page of Onerously Uptight Toccata! (Up to the first 8va) 18:33:47 18:26 GregorR: Uberman's is sounding more fake every minute. ← wanna expand on this? 18:33:53 GregorR: cool, that track is really catchy 18:34:10 Nope, I don't care to expand on it :P 18:34:20 then why'd you say it >:| 18:34:29 Because I'm an ass? 18:34:47 Your loss :P 18:35:30 LOL 18:35:38 someone commented saying that dreams happen in non-REM 18:35:43 (Re: OUT) It's tough to learn because it's so distinctly non-human ... rarely do you in normal music have one hand syncopated while the other isn't, and never is one hand off by a 16th note. Also, neither hand sounds particularly musical by itself, but the emergent sound of both is musical, so it's hard to learn one hand at a time. 18:35:44 GregorR, I was wondering if it was a fake too... 18:35:44 while almost all recalled dreams happen in REM... 18:35:52 AnMaster: why? 18:35:58 i don't get how it sounds realistic 18:36:02 it's not some silver bullet 18:36:06 the downsides are obvious 18:36:13 ehird, " i don't get how it sounds realistic" <-- huh? 18:36:15 but it makes perfect sense, sicentifically 18:36:17 AnMaster: unrealistic 18:36:19 ah 18:36:20 a simple typo 18:36:23 yeah 18:36:24 *scientifically 18:36:25 was confusing though 18:36:37 GregorR: yeah, it is rather alien 18:37:17 food is ready :) 18:37:20 bbiab 18:37:21 Also the fact that the first rest of any kind (just not playing very fast) hasn't come yet :P 18:37:53 it's so fun being a crazy child 18:38:04 GregorR: you should assemble a band to play it 18:38:10 on the original instruments 18:38:16 drums, steel drums and guitar 18:38:27 lawl 18:38:40 I don't think that steel drums can actually do that :P 18:38:51 GregorR: I've played steel drums and heard songs made with them 18:38:58 Nothing unrealistic sounding there. 18:39:13 You can only play two notes at once, right? 18:39:15 GregorR: The pitch-changing drums might pose more of a problem; just get a few different-sounding ones. 18:39:19 There are three- and four-note chords. 18:39:25 GregorR: Also, you have multiple steel drums :P 18:39:45 Yes, I know, but you have to use your hands to play them, and you only have two hands :P 18:39:49 OH 18:39:52 Multiple PLAYERS 18:39:56 Yes 18:40:05 That makes sense X-P 18:40:10 Yes, that would be bitchin' sweet. 18:40:28 But finding one steel drum player in West Lafayette, Indiana would be nigh on impossible, finding two? Silly :P 18:40:50 GregorR: I'll find one and we can both fly off there. I will play the instrument person coördinator. :P 18:41:01 Two, rather. 18:41:14 I'll, uh, conduct, as I play none of those instruments. 18:41:20 I'll also do the lyrics. 18:41:27 GregorR: I'm sure you can hit some differently-pitched drums of one kind. 18:41:39 [the drum line :P] 18:41:41 [not steel] 18:41:47 Yuh 18:41:47 GregorR: wow, lyrics would have to be über-weird 18:41:51 what time signature is it in? 18:42:01 well, whatever time signature it's in, it's idiosyncratic even for it :) 18:42:16 4/4 18:42:19 GregorR: Although its title would fit quite well as a lyric at some points in it 18:43:37 -!- sanxiyn has left (?). 18:44:24 AAAAAAAAAAAAAA 18:44:27 I just figured out what "frequent flier" meant 18:44:30 means 18:44:42 ............ amazing :P 18:44:43 *flyer 18:44:46 GregorR: I KNOW. 18:44:51 I had no idea, it just didn't register. 18:45:03 GregorR: I thought it was the, uh, bits of paper you stick up on walls outside and stuff to advertise things at first. 18:45:13 lawl 18:45:15 But that made NO FUCKING SENSE in all the contexts it was used in. 18:54:54 -!- Gracenotes has joined. 18:55:41 it occurs to me that uberman shifts a lot of maintenance on to you 18:55:49 i wouldn't be surprised if excercise requirements increased 18:59:54 foop doop 19:03:35 ehird, isn't it something like "if you travel more than y / month you can get slightly cheaper tickets"? 19:03:50 it's someone who flies frequently. 19:03:59 durp durp 19:04:13 ehird, ah, I was confusing it with http://en.wikipedia.org/wiki/Frequent_flyer_program 19:04:27 which is the context I have seen it in 19:07:40 durp durp your FACE 19:07:52 -!- ais523 has joined. 19:08:04 -!- Hiato has joined. 19:08:20 !swedish Your FACE! 19:08:21 Yuoor FECE! Bork Bork Bork! 19:08:45 Your FECES! Bork Bork Bork! 19:09:01 ̂_ ̂ 19:09:07 ^____________________________^ 19:09:11 That ... was weird ... 19:09:16 pikhq: WTF is with that smiley? 19:09:35 GregorR: Combining diacritics were involved. 19:10:43 You're FECES! Bork Bork Bork! 19:11:19 GregorR: Your wrong bitch. 19:13:32 Nuh uh, it's YOUR wrong. 19:14:04 GregorR: PIG DISGUSTING 19:23:31 -!- MizardX has joined. 19:37:00 -!- KingOfKarlsruhe has quit (Remote closed the connection). 19:46:04 * pikhq discovered how getline is implemented. 19:47:21 It reads in a few bytes, then recurses. When it hits the end of what it's been asked to get, it mallocs enough space for the buffer, sticks its few bytes in there, then returns. 19:48:25 Heh, a popular polyphasic forum bans people under 18 because wooo scary dangerous :-) 19:48:51 ok, so I've now implemented bubble sort and insertion sort in Rubicon 19:48:57 -!- Hiato has quit ("Leaving."). 19:49:07 I'd rather like to do an O(n log n) algorithm, but they're probably much harder 19:49:15 -!- kar8nga has joined. 19:49:26 rubicon ay? 19:49:27 rube inspired? 19:49:40 ehird: yes, it's a computer game which is RUBE plus a few extra rules to make it a game 19:50:04 ais523: btw you're probably the most level-headed person in here, if in the next 10 days i get significantly more crazy than usual tell me to stop uberman's please. 19:50:05 : 19:50:06 :p 19:50:09 uberman's? 19:50:30 ais523: polyphasic sleep schedule based around naps consisting of almost entirely REM sleep instead of long sleep 19:50:40 20 hour nap once every 4 hours. 19:50:40 ah 19:50:46 obviously, nigh-on impossible to adjust to. 19:50:49 err, ? 19:50:58 ais523: clarify "?" :P 19:51:00 20 > 4 19:51:06 err 19:51:09 20 minute nap once every 4 hours 19:51:16 lol twenty hour nap :D 19:55:40 I wonder how established polyphasists go back to monophasic sleep 19:55:58 Maybe by attempting to burn out and not using an alarm so that your naps relapse into regular sleep 19:56:39 I was semiphasic for about a week 19:56:42 sleeping once per two days 19:56:57 to get back to monophasic, wake up in the morning a few days in a row deliberately 19:57:08 you get instantaneously rather tired, but everything's back to normal before long 19:57:33 ais523: 0.5-phasic isn't really comparable to >1-phasic :) 19:58:32 ais523: because if you try and go to monophasic from polyphasic, you'll become extremely tired after the 4 hours 19:58:43 ais523: then if you sleep, you'll go through the compact nap schedule and wake up in 20 minutes 19:59:06 so i theorize you have to do that, stay awake for as long as you can, then try and extend the naps as long as possible 19:59:14 probably only take 2-3 cycles to relapse 20:05:23 the polyphasic week: monday, jutfay, tuesday, mantfay, wednesday, tofay, thursday, notefay, friday, tipperfay, saturday, ratafay, sunday, lunnerfay 20:08:31 where the new ones take up 10PM-6AM 20:09:09 polyphasic probably isn't compatible with school/work 20:09:36 ais523: it has been done 20:10:21 ais523: heck, the woman who named it does everyman (uberman except one "core nap" which is a bit longer at night) and she has a kid 20:10:28 but admittedly, probably not the easiest thing. 20:10:44 ais523: still, it's just a matter of finding 20 minutes every 4 hours 20:10:55 personally, if I couldn't find that sort of time anyway, I'd burn out 20:28:12 -!- sebbu2 has joined. 20:40:25 GregorR: what does OUT sound like on your system? I'm curious as to whether i'm hearing it wrong 20:44:02 -!- sebbu has quit (Connection timed out). 21:24:05 brb 21:37:29 ehird: Listen to the .ogg 21:46:06 -!- kar8nga has quit (Remote closed the connection). 22:00:18 GregorR: Which? 22:04:34 -!- coppro has joined. 22:13:55 -!- tombom has quit ("Peace and Protection 4.22.2"). 22:22:30 ehird: http://codu.org/music/auto/Onerously%20Uptight%20Toccata.ogg 22:22:58 -!- bsmntbombdood has joined. 22:23:22 GregorR: wow, it sounds way different on my machine 22:23:27 a lot more hyperactive 22:24:22 GregorR: yours seems less tuneful, but more rhythmical 22:26:27 "Generalizations! I don't understand them!" 22:26:43 GregorR: Fine, then an mp3 you shall have 22:30:41 GregorR: And thusly it was uploading. 22:31:35 GregorR: http://filebin.ca/mpzznt/OnerouslyUptightToccata.mp3 22:32:12 Good ol' filebin. 22:32:18 GregorR: Wat 22:32:20 Is that new, I never saw filebin links until recentlY :P 22:32:27 Just a few months. 22:32:34 Well. 22:32:36 Mid-2008. 22:32:40 WTF 22:32:53 Is there a reason that your version sounds utterly like garbage? 22:33:00 Is this just the worst guitar soundfont ever or what? 22:33:17 GregorR: What? mine sounds great :P 22:33:31 GregorR: Your notes are just too short 22:33:34 Holy crap man, the others sounded better than mine, but this is /awful/ 22:33:44 GregorR: Well, I agree. 22:33:52 Yours is a lot better in this case. 22:34:01 I think it's the guitar. 22:34:04 Mac OS X guitar FAIL 22:34:59 -!- KingOfKarlsruhe has joined. 22:35:13 GregorR: BTW, I highly doubt OUT is actually 4/4. 22:35:20 The rests are just enough to put it out of sync :P 22:35:52 No, it's very 4/4 22:36:08 Dunno. 22:36:24 It has a lot of syncopation, but written on paper it's clear how it all comes together and it's very much 4/4 22:36:31 I s'pose :P 22:36:42 I love the repeating steel drums riff 22:37:09 Dun, dun dun, dwun dwin dwun dwun, dwun dwun dwundwundwun. 22:37:27 Also, there are no rests, so I'm not sure what you mean by that :P 22:37:45 Well, it sounds like there are :P 22:38:35 Did you send all of those messages entirely after I said " Also, there are no rests, so I'm not sure what you mean by that :P", or am I getting ultralag? 22:38:59 GregorR: Starting with which? 22:39:06 Dunno. 22:39:08 14:36:24 It has a lot of syncopation, but written on paper it's clear how it all comes together and it's very much 4/4 22:39:09 14:36:31 I s'pose :P 22:39:10 14:36:42 I love the repeating steel drums riff 22:39:12 14:37:09 Dun, dun dun, dwun dwin dwun dwun, dwun dwun dwundwundwun. 22:39:14 14:37:27 Also, there are no rests, so I'm not sure what you mean by that :P 22:39:16 14:37:45 Well, it sounds like there are :P 22:39:18 14:38:35 Did you send all of those messages entirely after I said " Also, there are no rests, so I'm not sure what you mean by that :P", or am I getting ultralag? 22:39:18 Wow. 22:39:21 14:38:59 GregorR: Starting with which? 22:39:23 from clog 22:39:26 I'm getting supermegaultralag. 22:39:33 GregorR: More lag than my system. 22:39:39 And my packets GO TO ORBIT. 22:40:25 -!- bsmntbombdood has quit (Read error: 110 (Connection timed out)). 22:42:29 -!- whtspc has joined. 22:45:40 -!- bsmntbombdood_ has joined. 22:53:26 -!- MigoMipo has quit ("QuitIRCServerException: MigoMipo disconnected from IRC Server"). 23:07:28 -!- ais523 has quit (Remote closed the connection). 23:10:48 -!- whtspc has quit ("ChatZilla 0.9.84 [Firefox 3.0.11/2009060215]"). 23:17:17 -!- GreaseMonkey has joined. 23:17:36 omg 23:17:41 I found a legit use for "f (a, b, c)" style 23:24:03 orly? 23:24:56 olsner: yep 23:25:09 olsner: when all functions take one argument, and the convention is tuple for multiple arguments 23:25:14 then it's logical 23:26:01 -!- Kolonai has changed nick to Aneu. 23:27:13 In Haskell, at least, f(a, b, c) is perfectly valid notation for that. 23:27:47 And I think ordinary function notation usually allows saying f (a, b, c). 23:28:14 Aneu: Of course, it can be valid. 23:28:28 But if "f x" is the function call syntax, "f (a, b, c)" is a logical convention for multiple arguments. 23:28:33 In other languages, however, this convention is retarded. 23:30:39 * ehird invents a nice new language. 23:30:42 I'd say haskell completely lacks multiple-argument functions, but you can simulate them by either sticking stuff in a tuple or by currying 23:30:52 It's like Haskell without some awkward syntax and with some nice stuff. 23:30:55 olsner: yah 23:31:01 but if the convention was to use tuples, 23:31:08 and "f x" was still how one argument calls were accepted, 23:31:12 "f (a, b, c)" makes sense 23:40:09 -!- akiross has joined.