00:00:24 ? is easier to type on a de keyboard 00:00:35 right 00:00:45 * int-e is using an US keyboard ;) 00:01:05 us keyboard is better for programming 00:01:10 mainly because that makes typing []{} and \ so much easier. 00:01:11 :) 00:01:15 but i'm fast enough on a de keyboard 00:01:52 and i alwazs make tzpos if i use the us lazout ;) 00:02:21 that happens to me, too - but when I'm using a de layout keyboard :) 00:02:38 yeah but i learned typing on a de keyboard years ago... 00:02:59 i started using a keyboard before i was able to read and write 00:03:17 we had an old typewrite in my kindergarden 00:04:04 the first word i was able to type was klo 00:04:39 hmm, did you copy a sign from somewhere? 00:04:49 hm? 00:05:18 what sign? 00:05:42 a sign with the word 'klo' on it. 00:06:02 hm? 00:06:15 ah no 00:07:17 i just pressed some keys and my erzieherin bin zu faul das wort nachzuschlagen... was reading it and i heard klo... and k,l,o are in a triangle 00:07:54 hrm. dict.leo.org suggests 'governess' but I don't like that. 00:08:19 irgndwie komisch englisch zu reden wenn beide deutsch können 00:09:24 Not really. There are other people around who can't read English. 00:09:36 yes 00:10:20 who can't read >>English< well they have a problem 00:10:36 Heh. I meant German. 00:10:46 hrhr 00:10:54 int-e: how old are you? 00:11:10 old. 27. 00:11:18 i'm just interested which people are interested in esolangs 00:12:13 crazy people 00:12:14 hehe 00:12:41 *g* 00:12:55 ok you can count me to crazy peoples... 00:13:16 I count myself among them 00:14:50 heh.. other people in my age play computer games or do sports... but i figure out lambda terms at 1am... ;) 00:15:27 half-life? 00:16:01 * int-e likes to think of that sort of entertainment as computer games ;) 00:16:10 esolangs, that is. 00:16:23 heh. 00:16:35 searching on p2p networks for a song with "love" in the name is hard. 00:16:48 jix: that makes you a stupid dork 00:17:21 lament: why stupid? 00:18:53 ok, there are so many ways to be stupid. 00:18:55 * int-e shrugs 00:19:00 people are stupid. 00:19:01 hehe 00:19:26 :) 00:19:37 stupid + and - signs 00:19:51 brought to me by irssi proxy 00:19:58 puzzlet: use base -2 00:20:04 in base -2 there's no need for signs 00:20:05 puzzlet: use telnet. 00:20:28 Hmm, -2 is interesting. 00:20:32 -2 in base -2 is 10 1 is 01 -1 is 11 00:20:42 yes, I understand perfectly what that means 00:20:57 in base n overflow is 10... but in base -2 its 110 00:21:09 0 1 110 111 ... 00:21:10 but isn't 2 in base -1 -10? 00:21:19 s/-1/-2/ 00:21:34 yes but 2 is 110 too 00:21:35 I also like base 3 with digits -1, 0, 1. 00:21:47 so no need for the sign 00:21:52 I find that sitting at home doing esoteric stuff at 1am when others played sports was altogether a bad thing for my overall development :) 00:21:56 and uhhh 00:22:01 (written as -0+. +, +-, +0, ++, +--, +-0, etc.) 00:22:17 lament, who plays sports at 1 am? 00:22:20 i'm searching for "The man I love", why do i find "Sexy Babe Posing In The Park.wmv"? 00:22:29 lament: haha 00:22:32 i'm going to write my next math test in base -9 00:22:35 int-e: well, no, i should have slept instead :) 00:22:45 no one ever said i have to write math tests using base 10 00:22:54 lament: there's an 'I' in both your search term and the file name. 00:23:23 :) 00:23:33 fuzzy search, maybe? 00:23:49 int-e: yeah :( 00:24:15 and there's a "The" in "Teen Peeing In The Wood Movies.wmv"... 00:24:18 jix hmm, are you sure that confusing your teacher is the best way to get a good grade? 00:24:27 int-e: no 00:24:45 but a 2 is ok too 00:25:06 you mean, B? 00:25:10 yes 00:25:16 (grades in Germany are 1 to 6, 1 is best, 6 is worst) 00:25:30 round((5*1 + 1*6)/2) => 2 00:25:55 and my teacher knows i'm smarter than him.. so he gives me a 1 anyway... 00:26:24 pff 00:26:33 that happened to me once 00:26:57 I got a 1 in computer science class, for a program that I had never written. 00:27:06 oh computer science 00:27:08 (that is, the program didn't exist) 00:27:18 hehe yes same teacher... 00:27:20 1 too 00:27:27 did uhm nothing?... 1 00:27:49 i did some perl coding on my server... but nothing more... 00:27:55 like, for the MS Office? 00:28:02 yes 00:28:12 i did a bit more than nothing 00:28:17 i mean, to int-e 00:28:21 I was lucky, we learned Turbo Pascal at school. 00:28:44 this was ... hmm ... about 10 years ago. 00:28:47 in exel my teacher had a awfull IF ELSE (IF ELSE (IF ELSE END) END ) END construct 00:28:56 and i told him there's something like CHOOSE in exel.. 00:29:55 We even had an introduction to Scheme. That was fun. 00:30:04 we learned a bit javascript (not real javascript but programming a little robot let him walk in a maze) 00:30:19 mh 00:30:25 we haven't had nothing in school 00:30:39 the coolest test i've ever written is the 6+ in french 00:30:49 6+? 00:30:53 it's not a 6 .. it's a 6+ its a good 6 00:31:00 I know 00:31:12 but it's news to me that this grade exists. 00:31:35 yes it's stupid a 6 can't be good... 00:32:21 well, i'm off to read.. ~2:30 am.. 00:32:31 nite 00:32:35 -!- Keymaker has quit ("I've seen this déjà vu before.."). 00:32:38 my hard-drive was broken and i had no time to learn... was busy backing up all my projects etc... 00:33:30 and french is _not_ my favorite language.. 00:33:43 I believe that should scare me. But it doesn't. 01:03:41 ok is done 01:04:27 rmul? 01:04:35 rational multiply 01:04:46 as lambda term 01:10:54 something like ... \a b.a (b (\s a b t c d.\f ( s t) ( a c) ( b d))) ... except for canceling common factors. 01:11:41 canceling common factors is an extra function 01:13:04 oh. \f -> \f.f 01:14:10 but yours doesn't work 01:14:28 how do you encode the sign? 01:14:34 as bool 01:14:39 (?a b. (?r.r 01:14:39 ( (a ) (b )) 01:14:39 ( (a ) (b )) 01:14:39 ( (a ) (b )) 01:14:39 )); 01:14:59 evaluates to the looong: (?a b r.r (a (?x y z.x) (?x t f.x f t) (?x.x) (b (?x y z.x))) (?x.a (?x y z.y) (b (?x y z.y) x)) (?x.a (?x y z.z) (b (?x y z.z) x))) 01:15:11 and i think it could be shorter 01:15:47 (\a b.a (b (\s a b t c d.\f.f ( s t) ( a c) ( b d)))) (\f.f 2 2) (\f.f 1 3) 01:15:52 --> (?f.f (?x y.x) (?x y.x (x y)) (?x y.x (x (x (x (x (x y))))))) 01:15:56 seems good to me 01:16:26 (== (\f.f 2 6) 01:17:14 outch.. i corrected your typo and made a mistake^^ 01:18:08 that's ok 01:21:54 i've ( sign numerator denominator) ( rational) ( rational) ( [s n d]) and 01:25:44 hmm. next and 01:25:54 no 01:26:01 hmm, probably it's better to do an 01:26:21 canceling of common factors 01:26:27 uh-oh. 01:26:44 n m. 01:26:51 yep... 01:27:04 is there a gcd in the std lib? 01:27:18 not that I know of 01:28:10 there isn't even a mod although that would be quite simple using the ideas of listop. 01:29:36 i saw a mod free gcd algorithm 01:29:59 yes, you can do it with comparisons and subtractions alone 01:31:01 and with a linear running time for the division that's not even such a bad idea. 01:31:51 (?a b. ( a b) ( a b)); seems to be slow 01:32:16 use the listop.la 01:32:41 and its or ops 01:32:52 (the first 'n' is for 'new' - ignore it) 01:33:02 ah 01:33:14 i thought nne? not-not-equal? 01:36:23 wow, slow. 01:36:39 = (\x.x x) (\f a b. a b ( a b (f f b a) (f f ( a b) b))) 01:38:42 actually nsub can be replaced by lsub there hmm makes me wonder 01:40:33 hah 01:40:45 (?a b t f. (a (K t)) (b (K f))) is a<=b 01:41:01 stolen from prelude.scm of lazier stolen from unlambda page 01:41:13 uff 01:44:28 is ultra slow 01:44:38 is slow 01:44:52 unlambdas is ultra fast 01:57:22 new lsub: (\a b.\g x.(a I (b (K x))) ((\x.x x) (\f x.g (x (f f))))) 01:58:07 cool ist abs(a-b) 01:58:10 its 01:58:21 no, it's b-a 01:58:23 ah no 01:58:26 its b-a 01:58:40 sorry, just swap the arguments 02:16:09 slooooow 02:16:10 ... 02:23:03 yes 02:25:32 rcancle done 02:26:57 * jix has to sleep now 02:28:02 http://www.inf.tu-dresden.de/~bf3/stdlib.la has improved lsub and comparisons and a ggt function 02:28:07 ggt is still slow though 02:28:14 good night 02:31:35 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 03:17:10 -!- calamari has joined. 03:54:28 g'night 03:54:38 night 03:54:47 Here it's noon 03:54:48 cya int-e 03:55:15 uh it's 5 am here 03:55:16 hehe 03:55:32 -!- int-e has quit ("Bye!"). 07:02:28 -!- calamari_ has joined. 07:03:17 -!- CXI has quit (Connection timed out). 07:11:23 -!- heatsink has quit ("Leaving"). 07:24:12 -!- calamari has quit (Read error: 110 (Connection timed out)). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 10:15:20 -!- calamari_ has quit ("Leaving"). 10:16:34 -!- Gs30ng_ has joined. 10:23:32 -!- Gs30ng has quit (Nick collision from services.). 10:24:28 -!- Gs30ng_ has changed nick to Gs30ng. 12:28:31 -!- jix has joined. 12:29:17 moin 12:29:27 moin 12:29:43 well it's not moin here 12:30:04 it's always moin time 12:30:33 then moin 12:32:03 * jix plays guitar 12:40:25 * Gs30ng can't here anything 12:40:29 oops typo 12:44:12 -!- int-e has joined. 12:50:44 moin int-e 12:50:59 Hi 12:54:59 http://www.inf.tu-dresden.de/~bf3/lambda/listop.la contains a gcd function (nggt) that's still slow but quite a bit faster than my previous versions. to get really fast one has to get away from Church numerals though; a list representation (for the bits of the number, say) would perform much better for bigger numbers. 13:08:55 -!- Gs30ng has quit ("to boot in ubuntu"). 14:10:14 -!- Gs30ng has joined. 14:10:15 -!- tokigun has quit (Read error: 104 (Connection reset by peer)). 14:18:58 -!- Gs30ng has quit (Remote closed the connection). 14:36:01 -!- Gs30ng has joined. 15:40:29 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 15:45:20 -!- jix has joined. 15:46:00 -!- Gs30ng has quit ("to reboot in windows"). 15:56:13 -!- Gs30ng has joined. 18:43:19 -!- calamari has joined. 19:16:27 -!- pgimeno has quit (Read error: 60 (Operation timed out)). 20:29:05 -!- pgimeno has joined. 22:05:02 -!- calamari_ has joined. 22:05:36 re's 22:27:50 -!- calamari has quit (Connection timed out). 23:26:43 -!- heatsink has joined.