01:33:56 -!- shapr has joined. 01:52:08 -!- kipple_ has quit (Read error: 110 (Connection timed out)). 02:15:44 -!- pgimeno has quit (brown.freenode.net irc.freenode.net). 02:15:44 -!- ChanServ has quit (brown.freenode.net irc.freenode.net). 02:15:45 -!- CXI has quit (brown.freenode.net irc.freenode.net). 02:15:45 -!- lament has quit (brown.freenode.net irc.freenode.net). 02:15:46 -!- {^Raven^} has quit (brown.freenode.net irc.freenode.net). 02:15:46 -!- cpressey has quit (brown.freenode.net irc.freenode.net). 02:15:46 -!- mtve has quit (brown.freenode.net irc.freenode.net). 02:15:47 -!- rot1 has quit (brown.freenode.net irc.freenode.net). 02:15:49 -!- shapr has quit (brown.freenode.net irc.freenode.net). 02:15:49 -!- heatsink has quit (brown.freenode.net irc.freenode.net). 02:15:49 -!- puzzlet has quit (brown.freenode.net irc.freenode.net). 02:15:51 -!- lindi- has quit (brown.freenode.net irc.freenode.net). 02:15:51 -!- yrz\werk has quit (brown.freenode.net irc.freenode.net). 02:15:51 -!- fungebob-out has quit (brown.freenode.net irc.freenode.net). 02:15:53 -!- cmeme has quit (brown.freenode.net irc.freenode.net). 02:15:53 -!- ZeroOne has quit (brown.freenode.net irc.freenode.net). 02:29:22 -!- ChanServ has joined. 02:29:22 -!- pgimeno has joined. 02:29:22 -!- shapr has joined. 02:29:22 -!- heatsink has joined. 02:29:22 -!- puzzlet has joined. 02:29:22 -!- rot1 has joined. 02:29:22 -!- yrz\werk has joined. 02:29:22 -!- {^Raven^} has joined. 02:29:22 -!- fungebob-out has joined. 02:29:22 -!- CXI has joined. 02:29:22 -!- cmeme has joined. 02:29:22 -!- lament has joined. 02:29:22 -!- cpressey has joined. 02:29:22 -!- mtve has joined. 02:29:22 -!- ZeroOne has joined. 02:29:22 -!- lindi- has joined. 02:29:22 -!- irc.freenode.net has set channel mode: +o ChanServ. 03:25:05 I've nearly finished pnmtorxml :) 03:46:16 Done! Now on to rxmltopnm :) 03:59:25 -!- jimbo000 has joined. 04:18:20 I can now convert RXML to a raw framebuffer :) 04:29:05 * heatsink can now get the Nth element of a cons list in unlambda 04:29:33 * heatsink has scheme code to generate the unlambda code 04:29:43 * heatsink which is then compiled into scheme code to execute 04:35:33 -!- fungebob-out has quit (Ping timeout: 14400 seconds). 04:45:02 Either rxmltopnm doesn't work, or 35MB is a lot of XML :P 04:46:24 35mb is a lot of xml. 05:03:13 -!- malaprop has quit ("quit"). 05:16:52 Actually, rxmltopnm was broken *shrugs* 05:17:10 libxml2 is quite fast. 05:18:55 YAY!!!! 05:18:56 It works! 05:53:12 -!- heatsink has quit ("Leaving"). 06:40:01 -!- BigZaphod has joined. 06:43:14 -!- jimbo000 has quit (Read error: 110 (Connection timed out)). 07:12:11 Wow, RXML compresses quite well XD 07:12:18 35MB -> 844K 07:12:56 how big is the source bmp, jpg, whatever? 07:23:55 It's a 36K jpeg 07:24:01 477x498 07:31:26 http://www.codu.org/rxml.php 07:33:20 I'm debating whether to post that in #xml XD 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:41:47 -!- tokigun has joined. 08:41:57 hello 08:47:30 -!- rot1 has quit (Read error: 145 (Connection timed out)). 08:48:31 GregorR: RXML looks good, except that it's very large :p 08:51:13 i suggest or element for palette. 09:57:49 -!- jix has joined. 10:00:19 jix: hello 10:09:27 moin 10:28:40 -!- kipple_ has joined. 10:29:46 i hope someday my (nameless) =>whirl lang will work perfectly too 10:29:47 oh 10:31:21 i have no code atm 10:31:30 hmm 10:31:36 still thinking about stack/variable/array/temp memory layout 10:31:56 you mean c(or whatever) to whirl compiler? 10:32:47 yes but not c ..a new language 10:32:48 oops, c? hmm it's very hard. 10:33:01 jix: then intermediate language? 10:33:14 yes but a highlevel language 10:33:20 a bit like BF-BASIC 10:33:26 i see... 10:33:50 i planed to make whirl assembler but didn't start :) 10:34:51 i need a whirl debugger.. 10:35:13 with a clean ui and breakpoints 10:38:26 i used my python implementation to debug 99 bob in whirl. 10:38:47 ...but doesn't have good ui 10:39:53 i'm going to use ruby for the compiler 10:41:31 ah my friend has made aheui interpreter in ruby. 10:41:45 http://dittos.dnip.net/aheui.rb 10:42:03 python is faster but i don't like the syntax.. 10:42:26 jix: yes i think so... 10:42:58 some syntax looks weird... especially decorators 10:43:26 hmm i have to learn ruby again :p 10:44:34 ruby 2.0 is going to be faster (i hope.. it's a complete rewrite and it will use a vm afaik) 10:44:58 oh 10:45:14 i heard yarv... 10:47:04 yarv is for ruby 1.9 (ruby 1.8 with 2.0 features, not a rewrite) 10:48:47 tokigun: what os do you use? 10:49:18 windows xp 10:49:33 ah 10:49:38 i want to use ubuntu linux but i doesn't have enough space 10:49:52 harddisk? 10:49:55 yes 10:50:04 buy a bigger one ^^ 10:50:37 :) 10:51:13 i'm reading Programming Ruby again 10:56:05 "I need a harder disk" (actually heard from a client) 10:58:06 pgimeno: did you hear "hardest disk"? :) 10:59:31 i named my hard disk harder-disk on my old computer 10:59:39 (my family name is harder) 11:00:00 good naming! 12:22:10 -!- yrz\werk has quit (Remote closed the connection). 12:22:42 -!- yrz\werk has joined. 13:10:24 tokigun: i'm writing a whirl debugger with a tk gui 13:10:31 oh 13:10:35 in ruby? 13:10:38 yes 13:10:59 i didn't use tk in python; i used wxPython for gui. 13:11:20 but ruby/tk comes with ruby 13:11:50 yes tkinter comes with python too. :) 13:12:13 i had some problems with wxwidgets under osx 13:12:27 hmm.... 13:13:53 wxwdigets looks nicer(more native widgets.. more translating between carbon or cocoa and wx) but on osx tk is faster 13:14:42 i felt tk on windows is slower... :( 13:15:43 and tk comes with osx wx doesn't 13:16:53 anyway... i have to think about whirl quine :) 13:17:01 it seems easy, relatively 13:18:26 oh and tk is easy 13:26:19 :) 13:26:41 phew! 13:26:50 pgimeno: ? 13:26:56 * pgimeno just finished his Malbolge programming article 13:28:51 http://www.esolangs.org/wiki/Malbolge_programming 13:44:12 -!- yrz\werk_ has joined. 13:44:51 finished it just in time since I have to go now 13:54:40 -!- yrz\werk has quit (Read error: 110 (Connection timed out)). 15:30:33 jix: i finished reading Programming Ruby and (to practice) made Whirl interpreter in Ruby :) 15:32:38 hmm tktext sucks 15:33:31 wxmac and wxruby isn't stable enough 15:33:33 -!- yrz\werk has joined. 15:33:43 ruby-cocoa isn't platform independent 15:44:23 oops. 15:44:27 not good... 15:48:49 i hate gui toolkits 15:49:05 but i love gui 15:51:01 -!- yrz\werk_ has quit (Read error: 110 (Connection timed out)). 16:13:52 -!- sp3tt has joined. 16:18:06 BigZaphod: I've made Whirl interpreter in Ruby. :) 16:18:34 See http://dev.tokigun.net/esolang/index_en.php#whirl . 16:20:27 ah .. now i understand tktext 16:21:03 tokigun: why a hash as memory? 16:21:32 and the cell size isn't limited to 32-bit signed 16:21:48 jix: hmm 16:21:51 for instance... eh 16:22:08 an array is faster than an hash 16:22:13 if reading index -4 of memory? 16:22:21 yes i know 16:22:28 what does the reference implementation does? 16:22:39 jix: hmm 16:23:55 it uses STL vector... maybe it cannot handle negative index 16:24:30 but i implemented it for safety (yes. it can be changed) 16:25:02 jix: "and the cell size isn't limited to 32-bit signed" what do you mean? 16:25:18 the reference implementatoin uses int as cell data type.. right? 16:25:19 do you mean "the cell size should be limited to 32-bit signed int"? 16:25:21 yes 16:25:31 yes 16:25:39 wait a minute... 16:26:49 aint=int&0x7F_FF_FF_FF;sign=(int>>31)&1;(sign ? -1-aint : aint) should work (untestet) 16:27:04 but it doesnt 16:27:23 jix: C++ specification says 16:27:40 "Plain ints have the natural size suggested by the architecture of the execution environment" 16:27:51 it can be 16-bit, 32-bit, 64-bit, even 36-bit and so on... 16:27:56 ok 16:28:03 but there should be a minimum limit 16:28:31 maybe it can be 32-bit int 16:28:36 ok 16:28:46 16 bits is the minimum; IIRC some Cray compiler have 42-bit-or-so ints 16:28:57 pgimeno: 42-bit? 16:28:59 oops. 16:29:07 anyway.. so i didn't think about Fixnum and Bignum 16:29:31 I'm not sure, I'm only sure it was neither a power of 2 nor a multiple of 8 and that sounded very weird 16:29:44 if i want to implement Malbolge interpreter, type of int is very important issue :) 16:29:56 there were computers with 9bit bytes.. or? 16:30:40 well, it's relatively easy to limit size 16:30:41 jix: not x86, but there're some architectures that has 6bit, 9bit, 12bit byte 16:30:59 (12bit is not sure... but i heard 6bit/9bit byte) 16:31:33 tokigun: of course not x86.. because the instruction set isn't for 9bit bytes 16:31:39 yes 16:32:05 wasn't the eniac decimal? 16:32:29 i don't know 16:32:29 and the snes(super nintendo entertainment system)'s cpu had a decimal mode too 16:32:39 how about precision? 16:32:51 4-digits? 16:33:31 hmm 16:33:41 tokigun: i don't know the sens cpu in normal mode: 0x05 + 0x05 == 0x0A in decimal mode 0x05 + 0x05 == 0x10 16:33:55 i think it depends on the registers used 16:34:00 hmm 16:34:34 and i think only the accumulator register was set to decimal in decimal mode.. the adress registers in decimal would be a stupid idea 16:35:02 address registers in decimal is... crazy. 16:35:09 anyway it resembles BCD 16:35:20 base -2 numbers are cool 16:35:26 no need for a sign bit 16:35:35 decimal computers were popular around the 60's I think 16:35:45 There is phi base too :) 16:35:56 (phi = golden ratio) 16:36:00 tokigun: base 2i muhahahahahaha 16:36:05 * jix knows 16:36:06 that's roughly the justification that Knuth gives for making the MIX language support decimal 16:36:06 hahahahaha 16:36:32 it's impossible to represent all numbers with base 2i afaik 16:36:44 you can represent some complex numbers but not all 16:37:13 uhm phi base? with digits 0 == 0 and 1 == phi^position ? 16:37:25 jix: wait... i'm searching wikipedia article 16:37:26 because you can't have phi digits 16:37:55 oh, i found: 16:37:56 http://en.wikipedia.org/wiki/Golden_mean_base 16:38:09 it is called "phinary" 16:39:24 what about base i! where 123456 would mean 1*6! + 2*5! + 3*4! + 4*3! + 5*2! + 6*1! ? ;) 16:39:43 lindi-: special case of mixed radix... :) 16:39:52 there is "fibonacci representation" too. 16:39:56 oh 16:40:05 gotta google that up 16:41:52 http://en.wikipedia.org/wiki/Moon_Hee_Jun 16:42:06 He looks good... except eyes 16:42:40 tokigun: that fibonacci representation seems to avoid non-unique representation by restricting what numbers can be used 16:42:56 lindi-: yes it is also universal code. 16:42:58 tokigun: factorial presentation does not have that limit, i think 16:43:23 or hmm 16:43:51 lindi-: factorial representation... i think it cannot be used for general purpose 16:43:52 123456 would actually be illegal :P 16:43:55 :) 16:44:31 many months ago i designed simple machine language uses fibonacci coding 16:44:49 because then 6 = 6*1! would equal 100 = 1*3! 16:46:17 -!- yrz\werk has quit (Read error: 104 (Connection reset by peer)). 16:47:01 -!- yrz\werk has joined. 17:14:03 -!- sp3tt has quit ("Chatzilla 0.9.68a [Firefox 1.0.4/20050511]"). 17:49:41 get to sleep... 17:49:42 -!- tokigun has quit ("Chatzilla 0.9.68.5 [Firefox 1.0.3/20050414]"). 18:24:22 -!- calamari has joined. 18:30:33 -!- calamari has quit ("Leaving"). 18:39:58 -!- jimbo000 has joined. 19:33:46 -!- yrz\werk_ has joined. 19:43:21 -!- yrz\werk has quit (Read error: 110 (Connection timed out)). 20:06:09 -!- J|x has joined. 20:15:07 -!- jix has quit (Read error: 110 (Connection timed out)). 20:15:15 -!- J|x has changed nick to jix. 20:57:44 -!- jimbo000 has quit (Read error: 110 (Connection timed out)). 22:23:00 -!- Lizzy_K has joined. 22:23:09 -!- Lizzy_K has left (?). 22:38:05 -!- jimbo000 has joined. 22:42:40 -!- GS30NG has joined. 22:43:24 -!- GS30NG has quit (Remote closed the connection). 23:45:43 the number base lindi- was talking about is called factoradic. 23:46:34 it has a name? interesting 23:46:39 yep 23:46:40 http://en.wikipedia.org/wiki/Factoradic 23:47:36 was that page already there when we spoke about this on some math lesson? 23:49:49 very fascinating indeed 23:50:40 base -2 is still the best one 23:50:41 no, it wasn't. that article was created on October 29, 2004. however, I this http://en.wikipedia.org/w/index.php?title=Mixed_radix&diff=6471719&oldid=6471554 edit on October 10, 2004 23:50:55 s/I this/I made this 23:51:38 the program i wrote to convert decimal to factoradic presentation is dated November 9, 2004 23:52:10 ok 23:52:25 you still have that one? :) cool. 23:54:09 someone have edited those articles to state that the least significant number would stand for 0!... I can't see, why. :P 23:54:37 huh 23:54:59 and isn't 0! == 1 23:55:11 yeah. 0! == 1! == 1 23:55:17 yes it is the the article is wrong with 0! 23:55:33 if you see my original contribution, there was no 0! 23:55:56 fix it :) 23:57:13 I should do that, but I don't understand if that change would affect all that stuff about Lehmer codes and permutations. :P 23:57:45 hmm 23:59:20 "In this numbering system, the rightmost digit may be 0, the next 0 or 1, the next 0, 1, or 2, and so on." 23:59:37 ZeroOne: so it doesn't really matter whether there is 0! or not because the multiplier will always be 0