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.
17:47:18 -!- sp3tt has joined.
18:18:17 -!- nooga has joined.
18:49:39 -!- nooga has quit ("Leaving").
18:49:55 -!- nooga has joined.
18:53:46 -!- wildhalcyon has joined.
19:08:25 -!- nooga has quit ("Leaving").
19:19:44 <jix> i want to write a cool brainfuck program...
19:24:06 <jix> calculating pi would be a cool task
19:24:12 <jix> but it's a bit too difficult
19:25:03 <jix> MUD is a bit problematic without sockets or more than 1 IO
19:25:33 <wildhalcyon> you could get around thaat with an interpreter
19:25:50 <wildhalcyon> my language lacks graphics support, but I hope to implement a tiled game sometime
19:27:27 <jix> how to calculate pi without division...
19:27:53 <kipple> you can do division. it's just a bit hard
19:28:27 <kipple> since when did speed become important for vf progs? ;)
19:28:38 <jix> well i have to use arbitrary precision anyway...
19:28:53 <jix> kipple: since i want to get 10 digits in under 2 days
19:29:00 <wildhalcyon> Hmmm... Im trying to remember how much math was involved in the digit-extractor
19:29:14 <jix> decimal is stupid...
19:29:31 <jix> it's really cpu intensive to convert binary to decimal
19:29:44 <wildhalcyon> or trit. I have a dream of someday implementing a balanced ternary international character code
19:30:40 <jix> there is no 10^n==2^m (where n and m are natural)
19:31:15 <jix> that's why we need to use FFTs or complex recursive algorithms for fast binary=>decimal conversion
19:33:07 <wildhalcyon> http://mathworld.wolfram.com/PiFormulas.html has a digit-extration algorithm
19:33:35 <jix> yes i know it but its hex
19:36:33 <wildhalcyon> arbitrary precision division in bf. That should be your first step. At least you could get the gregory workin'
19:38:44 <jix> hmm i think i'll write something easier
19:39:34 <kipple> how about a befunge interpreter? has that been done yet? ;)
19:39:52 <kipple> oh, wait. did you say easier?
19:39:54 <jix> kipple: hmm befunge 93 should be not too hard
19:40:15 <kipple> true. it has a very limited code-space
19:40:24 <jix> and limited precision
19:42:24 <jix> a mtf algorithm
19:53:01 <Aardwolf> FFT as in fast fourier transform or am I missing something?
19:55:11 <Aardwolf> does anyone know a good way to FFT non-power-of-two images by the way
19:55:33 <jix> i don't know FFT
19:55:46 <jix> do you want to compress images?
19:56:22 <Aardwolf> no, but experiment with their frequency domain
19:56:42 <Aardwolf> I wrote some C++ stuff to calculate the FFT and edit it and such
19:56:50 <Aardwolf> it's kinda fun what you can do :)
19:56:55 <jix> i don't know much about FFTs
19:57:17 <jix> i just know that they do something similar but not equal to wavelet transformations
19:57:48 <Aardwolf> I think the FT is the best known transformation, and wavelet is some much more complex modern thing :)
19:58:06 <jix> wavelet is simpler than FFT
19:58:26 <jix> it's just hard to find good informations about it
19:59:36 <jix> 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 <jix> repeat the process on the avarage signal as often as you want
20:00:47 <jix> 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 <Aardwolf> 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 <jix> i tried to find informations about wavelet transforms
20:15:24 <jix> but everything i found was too mathematical and too much theory at the beginning instead of simple examples
20:15:40 <jix> 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.
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 (?).