00:21:42 -!- clog has joined. 00:21:42 -!- clog has joined. 02:20:49 -!- kubient has quit ("running(out)"). 02:29:45 -!- kipple has quit (Read error: 110 (Connection timed out)). 03:34:03 -!- wildhalcyon has joined. 04:21:31 -!- CXII has quit (Read error: 104 (Connection reset by peer)). 04:21:53 -!- CXII has joined. 05:02:58 -!- wildhalcyon has quit (Read error: 104 (Connection reset by peer)). 05:37:20 -!- wildhalcyon has joined. 05:40:19 -!- wildhalcyon has quit (Read error: 104 (Connection reset by peer)). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:34:24 -!- int-e has quit ("Bye!"). 10:41:08 -!- ChanServ has quit (Shutting Down). 11:10:41 -!- puzzlet has quit (Remote closed the connection). 11:12:58 -!- ChanServ has joined. 11:12:58 -!- irc.freenode.net has set channel mode: +o ChanServ. 11:13:25 -!- jix has joined. 11:14:14 -!- int-e has joined. 11:20:33 -!- kipple has joined. 12:06:34 -!- Aardwolf has joined. 12:28:25 -!- puzzlet has joined. 14:01:35 -!- jix has quit ("This computer has gone to sleep"). 14:21:13 -!- xyzz1 has joined. 16:04:03 -!- xyzz1 has left (?). 16:49:56 -!- jix has joined. 16:50:21 re 16:54:48 hail Re, god of sun 16:55:48 ... 17:18:19 lol 17:47:18 -!- sp3tt has joined. 18:18:17 -!- nooga has joined. 18:18:26 hello hello hello 18:39:21 hi hi hi 18:49:37 brb 18:49:39 -!- nooga has quit ("Leaving"). 18:49:55 -!- nooga has joined. 18:53:46 -!- wildhalcyon has joined. 18:53:51 ;> 18:55:30 What I miss? 18:56:34 i dont know 18:57:45 Hmm, alright 18:57:53 Ive been very un-eso lately 19:08:25 -!- nooga has quit ("Leaving"). 19:19:44 i want to write a cool brainfuck program... 19:21:21 how cool? 19:21:26 Got anything in mind? 19:22:41 hmm no 19:24:06 calculating pi would be a cool task 19:24:12 but it's a bit too difficult 19:24:22 hmm.. and here I was thinking a MUD 19:24:24 lol 19:24:47 lol 19:25:03 MUD is a bit problematic without sockets or more than 1 IO 19:25:08 bf lacks sophisticated networking 19:25:33 you could get around thaat with an interpreter 19:25:50 my language lacks graphics support, but I hope to implement a tiled game sometime 19:27:27 how to calculate pi without division... 19:27:53 you can do division. it's just a bit hard 19:28:00 and slow 19:28:27 since when did speed become important for vf progs? ;) 19:28:38 well i have to use arbitrary precision anyway... 19:28:53 kipple: since i want to get 10 digits in under 2 days 19:29:00 Hmmm... Im trying to remember how much math was involved in the digit-extractor 19:29:14 decimal is stupid... 19:29:24 Im a hex man myself 19:29:31 it's really cpu intensive to convert binary to decimal 19:29:44 or trit. I have a dream of someday implementing a balanced ternary international character code 19:30:40 there is no 10^n==2^m (where n and m are natural) 19:31:15 that's why we need to use FFTs or complex recursive algorithms for fast binary=>decimal conversion 19:33:07 http://mathworld.wolfram.com/PiFormulas.html has a digit-extration algorithm 19:33:35 yes i know it but its hex 19:33:58 Right, I forgot about that 19:36:33 arbitrary precision division in bf. That should be your first step. At least you could get the gregory workin' 19:38:44 hmm i think i'll write something easier 19:39:23 good idea 19:39:34 how about a befunge interpreter? has that been done yet? ;) 19:39:52 oh, wait. did you say easier? 19:39:54 kipple: hmm befunge 93 should be not too hard 19:40:15 true. it has a very limited code-space 19:40:24 and limited precision 19:42:24 a mtf algorithm 19:53:01 FFT as in fast fourier transform or am I missing something? 19:54:15 yes 19:55:11 does anyone know a good way to FFT non-power-of-two images by the way 19:55:33 i don't know FFT 19:55:46 do you want to compress images? 19:56:22 no, but experiment with their frequency domain 19:56:42 I wrote some C++ stuff to calculate the FFT and edit it and such 19:56:50 it's kinda fun what you can do :) 19:56:55 i don't know much about FFTs 19:57:17 i just know that they do something similar but not equal to wavelet transformations 19:57:48 I think the FT is the best known transformation, and wavelet is some much more complex modern thing :) 19:58:06 wavelet is simpler than FFT 19:58:26 it's just hard to find good informations about it 19:59:36 the easiest wavelet transformation is..(Haar wavelet a bit simplified) take 2 samples calculate the arithmetic-mean and the difference store the mean into the average signal the difference in the detail signal 19:59:43 repeat the process on the avarage signal as often as you want 20:00:47 other (better) wavelet transformations are as simple as that but you take more than 2 samples and use multiplication with some mysterious values... 20:09:31 -!- wildhalcyon has quit (Read error: 110 (Connection timed out)). 20:10:22 I didn't know the wavelet transform was this simple. I have some courses about signal processing and they're all about fourier transform, DCT, and such, and wavelet was only mentioned a few time as this "mysterious transformation used in jpeg2000 that is so mysterious" 20:12:37 -!- sp3tt has quit (Client Quit). 20:14:48 i tried to find informations about wavelet transforms 20:15:24 but everything i found was too mathematical and too much theory at the beginning instead of simple examples 20:15:40 but my brother has a book about wavelet transformations that is really great 21:42:34 -!- jix has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 22:08:48 -!- int-e has left (?). 22:26:36 -!- calamari has joined. 22:51:10 hi 23:27:33 -!- zauberzebra has joined. 23:42:22 -!- calamari_ has joined. 23:45:07 -!- calamari has quit (Read error: 110 (Connection timed out)). 23:48:42 -!- zauberzebra has left (?).