00:03:25 -!- GreaseMonkey has quit ("I'm a thaasophobic."). 00:08:42 pgimeno: i'm gonna make a counter that outputs in binary 00:08:43 :o 00:09:06 ehird: cool, go ahead 00:09:59 hmm 00:10:03 which is kinda hard. 00:11:32 ehird: do you mean dec-to-bin? 00:12:01 JUST 00:12:05 err 00:12:05 just 00:12:09 a counter that goes like this 00:12:12 .................... 00:12:14 ...................* 00:12:17 ..................*. 00:12:18 ..................** 00:12:22 .................*.. 00:12:24 .................*.* 00:12:27 .................**. 00:12:28 enough :) 00:12:28 .................*** 00:12:30 etc 00:12:31 :P 00:12:35 wait 00:12:39 isn't that already done? 00:12:50 it is but you can try for yourself 00:13:09 that's why I asked if you were going to implement a dec-to-bin 00:16:21 it would be funny to see division&remainder code... 00:16:43 actually just multiply-by-ten 00:18:16 -!- puzzlet has quit (Remote closed the connection). 00:18:18 anyway, I might either implement Fredkin's automaton or just give up on 00:18:20 -!- puzzlet has joined. 00:18:38 + paintfuck programming 00:20:02 yeah maybe someone should make underpaint next. 00:20:10 take one down and pass it around, 00:20:10 You are in a small hut by a dirt road. 00:20:10 75 bottles of beer on the wall! 00:20:13 pgimeno: why? :( it's fun 00:20:35 ehird: it takes too many resources 00:20:40 -!- decipher has quit (Read error: 54 (Connection reset by peer)). 00:20:41 true :P 00:21:15 I mean in brain CPU %, not in computer CPU % 00:21:32 yeah 00:21:34 :) 00:23:09 -!- decipher has joined. 00:27:48 o 00:43:08 -!- psygnisfive has quit ("Leaving..."). 00:54:26 -!- GreaseMonkey has joined. 00:58:49 -!- puzzlet has quit (Remote closed the connection). 00:58:54 -!- puzzlet has joined. 01:02:48 -!- GreaseMonkey has quit (Remote closed the connection). 01:03:18 -!- GreaseMonkey has joined. 01:21:49 thread[:jumps] = Hash.new if $jumpfuck 01:25:13 ooooo 01:27:42 have a kitchen sink i can cram into this thing? 01:35:02 you can't have a sink without a source 01:35:08 except if it's a circulation 01:35:17 but even then it's not satisfiable 01:35:40 hehe, ackermann as type templates as a c++ exercise 01:35:42 for uni 01:36:45 wait, no it's not that, i'm dissappointed :< 01:37:51 C++ templates have a limited stack depth. Was it 7, 17, 27 or 127...? I can't remember. 01:38:18 -!- Sgeo has joined. 01:38:46 sure. 01:39:09 But if you implement your own stack with e.g. a linked list, you could stay within the stack limit. 01:39:11 i'd go with 16, but anyway 01:39:28 (if it was 16, i would probably remember it, though) 01:39:39 yes, sure, but that's so cheating 01:40:17 Yeah, I think it's 17, but nobody actually enforces it, it's usually much higher. 01:40:45 -!- Corun has quit (Remote closed the connection). 01:40:59 -!- Corun has joined. 01:45:24 * oklopol is a supporter of 0/1/inf 01:46:59 likewise 01:47:07 nan? 01:47:25 although in C++'s case, things are already difficult enough for implementors :) 01:48:07 MizardX: i definitely do not like any kinds of exceptions. 01:48:15 exceptions are exceptional, i only case about the general 01:48:38 (there are exceptions to that, but oerjan would probably emerge from somewhere and make a pun) 01:48:43 (so i'll keep quiet) 01:53:26 -!- GreaseMonkey has quit ("I'm a thaasophobic."). 02:13:40 -!- psygnisfive has joined. 02:15:22 -!- psygnisfive has quit (Remote closed the connection). 02:43:21 strcpy works perfectly. Except when it's run by nethack, which magically makes it not work. 02:46:27 what does it do instead? 02:47:02 Fail in obscure ways. 02:47:12 It sorta-kinda copies. 02:47:21 With random chunks of the strings fegged up. 03:05:40 ..why? 03:36:13 so an idea is 03:36:35 using the shared tape of weave.rb 03:36:48 certain programs could monitor certain spots 03:36:59 analogous to /etc/service port assignments 03:37:28 so any other thread could load subroutines on deman 03:37:32 d 03:37:50 nobody wants this, why am i compelled to connect this to an irc bot? 04:04:56 Aha! Figured out the problem with strcpy on nethack! 04:05:06 Now I just need to figure out the solution X-P 04:06:18 -!- Corun has quit ("This computer has gone to sleep"). 04:11:00 -!- GreaseMonkey has joined. 04:23:09 Shall I pick a character's racÿ, role, genþer and aliîmet foz(yoÿ [ÿnq]þ 04:23:12 Well that's just not right. 04:26:39 ÿþîÿÿþ are all close to 255 (in unicode, anyway) 04:26:49 which is also odd 04:27:14 not to mention, how did alignment lose a character? 04:40:39 What's even stranger is that neither that string nor the (presumable) original string appear anywhere in the nethack dir D-8 04:45:58 -!- jayCampbell has set topic: http://tunes.org/~nef/logs/esoteric | Shall I pick a character's racA?, role, genA3er and aliARmet foz(yoA?. 05:03:00 Note to self: MIPS' swl and swr instructions are SO EFFING CONFUSING 05:09:43 swill and sewer 05:28:25 DAMN YOU MIPS UNALIGNED MEMORY ACCESS INSTRUCTIONS 05:28:35 Bane of my existence. 05:36:55 Whootsynth! 05:39:41 OH BLOODY EFFING DEATH 05:40:08 Nethack writes out its data in the host's endian format X_X 05:40:16 Erm, the COMPILING host that is. 05:40:20 I have to compile this on a big-endian machine. 05:40:25 Piece o' crap. 05:48:11 :( 05:48:34 time to get gcc working on mips :D 05:50:55 * GregorR is debootstrapping a mips system now 8-D 06:15:44 -!- Slereah_ has joined. 06:17:23 -!- Sgeo has quit ("Ex-Chat"). 06:57:36 -!- puzzlet has quit (Remote closed the connection). 06:57:40 -!- puzzlet has joined. 07:10:30 for jsmips? :D 07:22:34 -!- oerjan has joined. 07:38:55 oklopol: generally speaking exceptions are exceptional, except in exceptional cases where the general case does not hold 07:48:32 * jayCampbell revives EsoAPI 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:07:42 morning 08:12:57 evening 08:13:11 did the world even know it needed a brainfuck with embedded ruby interpreter? 08:14:15 debug breakpoint dumps are soooo last century 08:21:35 -!- oerjan has quit ("leaving"). 08:23:06 >+++++++++++++++++++++++ # ruby print "hi " 08:23:06 ++++++++++++++++++++++++ # ruby print "there\n" 08:23:06 ++++++++++++++++++++++++< # ruby7 puts "tape size: #{thread[:tape].size}" 08:23:06 >>++++++++++<< .>>.<< >..........< .>>.<< 08:23:06 >>+++++++<< .>>.<< >>-------<< .>>.<< 08:23:17 ./weave.rb -R rubytest.b -E 08:23:17 hi there 08:23:17 GGGGGGGGGGhi there 08:23:17 tape size: 3 08:23:17 hi there 08:24:01 ruby via EsoAPI calls above number 9 08:24:30 in all seriousness, please, someone stop me 08:36:09 hello mister silly-bob 08:39:14 * oklopol realizes he's already taken the best courses @ uni, will be a downslope in funnity from this point on :< 08:40:41 hmm right, there's math department... 08:47:12 -!- olsner has quit ("Leaving"). 08:54:29 -!- ineiros has joined. 09:30:00 -!- GreaseMonkey has quit ("I'm a thaasophobic."). 10:01:38 -!- Judofyr has joined. 10:45:49 oklopol: Me too. Sad feeling. 11:23:09 Not me :D 11:23:22 I get quantum electrodynamic next year :D 11:23:27 Also general relativity :D 11:23:32 Quantum chromodynamics! 11:23:35 Yaaaaay! 11:23:38 Hurray me! 11:23:50 Sucks to be you :D 11:31:01 -!- moozilla has joined. 11:41:25 -!- at_deckards_hous has joined. 11:41:25 -!- moozilla has quit (Read error: 54 (Connection reset by peer)). 11:41:35 -!- at_deckards_hous has changed nick to moozilla. 11:45:03 -!- moozilla has quit (Read error: 104 (Connection reset by peer)). 11:49:29 -!- Corun has joined. 11:52:47 -!- Corun has quit (Client Quit). 12:08:02 Slereah_: You'll get there... 12:09:00 OR WILL I? 12:09:10 I mean, I don't really have classes after next year. 12:09:17 After that it's my thesis and shit 12:21:32 I don't want to study anything in particular at college. 12:24:05 The stereotypical make-a-lot-of-money profession seems to be a lawyer. 12:27:33 Can you be a lawyer with a degree in nothing-in-particular? 12:29:52 I think so. 12:30:25 You go to college, get a degree in nothing-in-particular, and take that to law school. 12:31:27 Oh, so you need a degree for a degree? 12:31:50 I'm glad I'm getting physics :o 12:31:54 Something like that, yeah. 12:32:08 Did you even look at law or medicine? 12:32:21 Why would I? 12:32:29 I wanted to do that shit since I was 9! 12:35:11 -!- GregorR has quit (Remote closed the connection). 12:53:53 -!- GregorR has joined. 13:12:03 -!- moozilla has joined. 13:12:07 GregorR: so your cross-compiler doesn't deal with big-endianess? that's weird 13:12:25 pgimeno: Nononono, that's not the problem at all. 13:12:45 oh, that's what I understood 13:12:53 pgimeno: The problem is that it generates data files using a program for the compiling system. 13:13:16 oh, so you need to generate the data files in the emulator, right? 13:13:30 Egg-zactly. 13:13:38 'k 13:25:58 -!- Azstal has joined. 13:26:05 -!- moozilla has quit (Read error: 104 (Connection reset by peer)). 13:31:26 -!- Asztal^_^ has joined. 13:32:13 -!- Asztal^_^ has quit (Read error: 104 (Connection reset by peer)). 13:32:39 -!- Asztal^_^ has joined. 13:41:31 -!- Asztal has quit (Read error: 110 (Connection timed out)). 13:50:35 -!- Azstal has quit (Read error: 110 (Connection timed out)). 14:10:04 Slereah_: I wanted to do that shit since I was 9! <<< i decided i wanted to be a programmer when i was 5 14:10:40 although i guess i've slowly inclined towards math / theoretical algorithmics since, but probably only because i didn't know much about things back then. 14:10:46 need to leave ----> 14:27:11 I think I got interested in programming around 7-8 years old. A friend showed some graphics in QBasic. Could have been earlier, but I don't remember much from that time. 14:43:47 Around 8 for me I think, maybe a little earlier or later. 14:43:51 I got my first computer at 3. :-P 14:46:04 -!- Judofyr has quit. 14:46:47 hi ju 14:46:50 hi Jud 14:46:55 fucking tab complete 14:48:08 -!- moozilla has joined. 14:55:33 -!- at_deckards_hous has joined. 14:55:33 -!- moozilla has quit (Read error: 104 (Connection reset by peer)). 14:55:41 -!- at_deckards_hous has changed nick to moozilla. 14:58:09 -!- moozilla has quit (Read error: 131 (Connection reset by peer)). 14:58:15 -!- moozilla has joined. 15:12:40 -!- moozilla has quit (Read error: 104 (Connection reset by peer)). 16:10:57 is User:Mattwescott here? 16:15:13 dunno. 16:15:25 most newbz don't come here, is he a newb? 16:15:33 i see no User:Mattwescott 16:15:35 on the esolang wiki 16:16:15 ehird: I saw it on Special:Recentchanges 16:16:18 *him 16:16:31 http://esolangs.org/wiki/Special:Recentchanges I don't. 16:16:35 oh 16:16:39 mattwesTcott 16:16:44 err, misspelled: User:Mattwestcott 16:16:45 then no 16:16:47 i don't think so 16:16:57 http://esolangs.org/wiki/Nil a joke language. neat. 16:17:01 16:17:50 just too easy the humour, but the interpreter is a bit more elaborate than that 16:18:24 umm, true(1) is not very elaborate 16:18:31 unless you mean GNU true :-P 16:18:49 no, I mean the JS interpreter 16:18:57 ah 16:19:10 * ehird reads. 16:19:12 heh. 16:29:52 -!- Judofyr has joined. 17:20:28 ^bf ++++++++++ 17:20:31 -!- kar8nga has joined. 17:20:32 ^bf ++++++++++. 17:20:33 . 17:20:35 hrrm 17:21:48 -!- Asztal has joined. 17:33:31 -!- Sgeo has joined. 17:38:36 -!- Asztal^_^ has quit (Read error: 110 (Connection timed out)). 18:11:03 -!- oerjan has joined. 18:26:19 cc1: out of memory allocating 33554432 bytes after a total of 20123648 bytes 18:26:20 wow 18:26:53 AnMaster: what were you doing? 18:27:00 to make gcc run out of memory so dramatically? 18:27:04 ais523, trying to compile lost kingdom 18:27:14 since I do the "turn into polynom" bit now 18:27:20 ( ulimit -v $((1024 * 800)); gcc -O0 -o LostKng LostKng.c; ) 18:27:20 cc1: out of memory allocating 134217728 bytes after a total of 20148224 bytes 18:27:35 maybe splitting it into multiple methods would work 18:27:53 but that would be tricky due to loops and such 18:27:54 AnMaster: do the same trick I did for OIL, split the function into separate functions in separate source files, then compile them separately 18:28:15 I learnt that tip from the Debian developers who were trying to port C-INTERCAL, apparently it's happened to them before on other projects 18:28:18 I fixed the problem referred to in the topic btw :P 18:28:31 ais523, not easy since it would most of the time need to split across two different while loops 18:28:33 or such 18:28:40 AnMaster: split the loop into a separate function 18:28:45 hm 18:28:48 and have it called by the other one 18:28:51 ais523, need to know how big it is 18:28:56 which I don't most of the time 18:29:01 AnMaster: good thing computers are good at counting, then 18:29:08 Hah 18:29:15 you're generating the code, no reason you can't count lines in your generated code 18:29:20 ais523, yeah need to run O(n) search on every tree or something 18:29:31 AnMaster: that's in the compile, it's O(n), do you really care? 18:29:38 hm 18:29:45 or are you trying to make the compiler insanely fast too 18:29:55 ais523, it is currently rather fast 18:29:58 but true 18:30:06 Actually, that would be O(n^2) as there are O(n) many nodes, each of which may contain O(n) many nodes. 18:30:26 (Assuming you have to do the search for O(n) many nodes) 18:30:26 GregorR: no, just maintain a stack of subtotals and you can do it in one pass 18:30:27 GregorR, each [ cause a subtree 18:30:31 it is like a linked list 18:30:35 with down nodes for [ 18:30:45 that is the internal format at that point 18:30:48 you can use the totals for the lower levels when calculating the totals from the upper levels 18:30:51 ais523: But doing it the stupid naïve way is more fun D-8 18:31:23 I guess that I could create some kind of weight count in a pass after the optimizer 18:31:24 or such 18:31:39 and add yet another field to the nodes 18:31:56 AnMaster: you're saying this as if it's a bad thing 18:32:12 ais523, since each node is 88 bytes on x86_64 it isn't totally small 18:32:19 I do use union tricks and so on already yes 18:32:25 why use union tricks? 18:32:43 ais523, why would I need loop specific data for > or > specific data for loops? 18:32:43 extreme memory optimisation in the compiler isn't going to gain you anything in execution speed 18:32:58 ais523, true, I just don't want to run out in the compiler either 18:32:59 AnMaster: you don't, not using union tricks therefore makes it easier to debug 18:33:18 AnMaster: your compiler's already more memory-efficient than gcc 18:33:23 ais523, I haven't had any such bugs yet at least. 18:33:24 therefore making it more memory-efficient is irrelevant 18:33:35 as you're going to be using more memory later in the process anyway 18:34:06 ais523, true, but the issue is that likely the libc won't give the now freed ram back 18:34:17 AnMaster: it will when the program ends! 18:34:32 ais523, yes but I can system() to invoke cc, like ick does 18:36:29 also I need to add a generic reorder pass that can move stuff around, current code can only do that in simple balanced loops 18:36:32 ais523, that reminds me 18:36:46 how does one turn this into a polynomial: 18:36:53 [>+++<--] 18:37:11 my current code only handles a +1/-1 atm 18:37:14 AnMaster: if it's even, that's +1.5x. If it's odd, infinite loop 18:37:26 you need to condition on each possible value of the input modulo the number of -s 18:37:36 ais523, hm 18:37:52 easier said than done with current design 18:38:05 I wouldn't be surprised if gcc was cleaner than this 18:38:14 on the other hand I never coded anything like this before 18:38:25 usually only one value will _not_ be an infinite loop, i think... 18:38:26 probably something for tdwtf 18:38:51 ais523, consider: +++[>+++<--] 18:38:56 as the full program 18:38:56 oerjan: no, it's just evenness/divisibility by 4/divisibility by 8, etc 18:39:05 ais523, that will wrap once 18:39:09 as 256 is a power of 2 18:39:14 AnMaster: that will wrap forevor 18:39:16 ais523, err 255 18:39:19 ais523: one modulus value, i mean 18:39:29 er remainder value 18:39:31 ^bf +++[>+++<--] ++++++. 18:39:36 hm ok 18:39:36 ...out of time! 18:39:37 true 18:39:43 oerjan: if the modulus is odd, then it'll wrap n times and then finish 18:39:52 ^bf ++[>+++<--] ++++++. 18:39:53 due to odd numbers not dividing into 256 18:40:01 fungot, ? 18:40:02 AnMaster: not at all, don't let the bed bugs byte)." what kinda procedure could that be because of extensions too. 18:40:05 wtf 18:40:08 ^bf ++[>+++<--] +++++++++++++++++++++++++++. 18:40:15 that was odd 18:40:28 yep 18:40:44 ^bf ++[>+++<--]+++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++. 18:40:44 = 18:40:48 ^bf ++[>+++<--] +++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++. 18:40:49 = 18:40:51 hm 18:40:55 ok 18:40:57 very strange 18:41:06 AnMaster: maybe you got it to ouptut a space 18:41:14 who knows, you might have hit exactly the right number of + 18:41:21 ais523, I tried with two values 18:41:25 ^bf +++[>+++<--] ++++++. 18:41:27 ^bf ++[>+++<--] +++++++++++++++++++++++++++. 18:41:32 ais523: odd modulus is thus uninteresting 18:41:34 ^bf ++[>+++<--] +++++++++. 18:41:34 18:41:37 ^bf ++[>+++<--] ++++++. 18:41:38 AnMaster: the first one is an infiniloop 18:41:49 ais523, and the two last ones? 18:41:54 ^bf ++[>+++<--] +. 18:41:54 18:42:01 ouch 18:42:02 ^bf ++[>+++<--] ++. 18:42:10 hm 18:42:15 ok strange 18:42:54 ais523, in any case this should really be done with something like oil for bf, it is a pain to write it in C 18:43:14 also nested loops mess it up a lot 18:43:29 AnMaster: the Brainfuck Constants page on the wiki contains many examples of such loops 18:43:49 oerjan, yes nested loops are important I know 18:43:59 the issue is, they don't yet work 18:44:15 AnMaster: i wasn't responding to your comment 18:44:17 for example if the nested loop change the index, not very easy to detect always 18:44:29 or rather quite a pain 18:44:32 i was speaking about the loops you tested above 18:44:47 oerjan, hm? 18:45:09 [>+++etc<---etc] loops 18:45:21 ah right 18:45:47 -!- kar8nga has left (?). 18:46:29 i imagine unbalanced loops are almost impossible to optimize unless you have meta-information about memory contents 18:47:10 oerjan: yes, I have a crazy plan to deduce the meta-information 18:47:29 O_O 18:55:15 so, anyone here know a nice program for composing stuff? 18:55:33 i've used guitar pro, but it's total crap so was just thinking 18:55:33 oklopol: you mean like music? 18:55:35 yes 18:55:45 someone invite lament here 18:56:02 i'll try his pm, he'll be sooooo surprised 18:56:29 oklopol: I've used Rosegarden, it's pretty good for writing down tunes you've composed elsewhere 18:56:36 which is what I normally do 18:57:30 hmm, rosegarden. 18:57:34 i've heard about that 18:57:45 lament is on freenode but not on this channel? did we scare him away? :( 18:58:14 oklopol: obviously we cannot promise you that 18:58:15 what i'd really like is a sensible electric guitar sound for this project. 18:58:15 does anyone have a copy of brainfuck OS? 18:58:32 the googles fail me 18:59:00 ais523, mandelbrot is down to 7.3 seconds 18:59:11 there is of course a lot more that could be done 18:59:31 oerjan: he's always on freenode, but rarely here 19:00:15 has anyone here used bf-os? 19:00:32 guitar pro has a pretty cool bug if you try adding a ninth track, pans of tracks 8 and 9 can't be made different :D 19:00:51 i really can't imagine how there could be a bug that only appears on a certain track 19:01:07 is it open source? 19:01:15 if not: no clue, if yes, look at the source 19:01:39 oklopol: I've used Rosegarden, it's pretty good for writing down tunes you've composed elsewhere 19:01:39 which is what I normally do 19:01:41 indeed 19:01:45 I have used it too 19:01:46 very nice 19:03:01 um, look at the source why exactly? 19:03:03 hm considering the name contains "pro" it is probably *not* open source 19:03:12 oklopol, of the program with the bug 19:04:38 yeah it's not os 19:31:35 jayCampbell: No, but I've been tempted to write one from time to time... 19:31:47 (Def-BF would actually work *well* for that...) 19:33:19 do you know the spec? 19:33:36 Don't happen to have the details handy... 19:33:36 i have a framework 19:33:43 One could ask RodgerTheGreat for it. 19:34:52 wanna help write brainfucklets that interact? 19:38:05 basically comes down to deciding what functions map to what cell addresses or EsoAPI slot 19:39:38 * oerjan thinks that sounds like something that would be illegal in most countries 19:39:54 Def-BF != EsoAPI or PSOX or whatever you're wanting to do... 19:40:11 Def-BF is basically Brainfuck + labels & jump. 19:40:27 jayCampbell, EsoAPI is dead. Long live PSOX, which is dead! 19:40:49 Which matches *very* cleanly to assembly, and makes for a really nice systems programming language. 19:40:56 i put esoapi and jumpfuck into weave.rb 19:41:00 so it's very much alive 19:41:07 psox i couldn't find a speck of info about either 19:41:29 http://esolangs.org/wiki/PSOX 19:41:41 lol, psox 19:41:43 jayCampbell: ignore Sgeo 19:41:46 PSOX is his vaporware 19:41:48 And if you need more info than what you can find in http://trac2.assembla.com/psox/browser/trunk , ask me 19:41:48 and is awfully dseigned 19:41:51 although esoapi is awful too 19:41:53 ehird, it's NOT vaporware 19:41:54 http://lwn.net/Articles/104185/ 19:41:56 where is def-bf 19:42:00 Sgeo: just keep telling yourself that 19:42:09 sgeo send me your spec? 19:42:17 ehird, if you want me to finish it up and call it a beta, I'll do that 19:42:29 Sgeo: no, I'd rather you never mentioned it again 19:42:31 lest I commit suicide :D 19:42:33 jayCampbell, http://trac2.assembla.com/psox/browser/trunk/spec 19:42:41 jayCampbell: turn back 19:42:41 ehird, jayCampbell's the one asking about it 19:42:44 turn back while you still have your insanity 19:42:56 ehird: I'd hesitate to call PSOX vaporware... 19:43:03 Sgeo *did* actually get it implemented. 19:43:05 pikhq: ok, more like HORRORWARE 19:43:09 Better. 19:43:17 -!- nooga has joined. 19:43:19 aaaaaaaaaaaaah 19:43:21 i forgot C 19:43:23 jesus f 19:43:44 Though it wasn't necessarily *bad* for the most part; just poor choices on some details, really. 19:43:50 What details? 19:43:52 pikhq: details such as EVERYTHING 19:43:52 >_< 19:43:54 Not bad for a hack. 19:44:05 Sgeo: The type system, IMHO. 19:44:13 wtf is that scanf("%s") returns "" after scanf("%c") 19:44:20 Sgeo: DON'T FORGET SAFETY 19:44:45 ehird, safety's kind of dead, thanks to you 19:44:56 Well, deader than PSOX itself, at any rate 19:45:55 psox isn't impossible 19:46:20 psox is more awful than impossible 19:46:22 it's a little more .. robust than i expected 19:58:04 nooga: what text are you trying to read? 20:21:44 http://blog.wolfram.com/2008/12/01/the-incredible-convenience-of-mathematica-image-processing/ wish there was like a mathematica thta didn't suck 20:30:55 wow, that's pretty neat 20:31:54 woah http://smoaktalk.com/st/071808/ 20:32:07 oklopol thinks its neat, wow 20:32:08 it must be really neat 20:32:14 jayCampbell: neat 20:32:17 i saw a smalltalk in JS before 20:32:21 vista smalltalk it was called iirc 20:32:26 had a lisp-based syntax for core stuff 20:32:40 ehird: what's sucky about that? 20:32:46 oklopol: ? 20:32:49 oh 20:32:51 just mathematica in general? 20:32:56 ask ais523, I've heard horror stories from him 20:32:59 -!- sebbu2 has joined. 20:33:34 oh, you didn't meant that looked absolutely horrible? 20:33:38 no 20:33:51 i just meant i wish there was a system with stuff that awesome 20:33:53 here's the js one: http://www.cs.ucla.edu/~awarth/ometa/ometa-js/ 20:33:54 that wasn't as sucky as mathemtaica 20:33:57 jayCampbell: no, not ometa 20:34:12 http://en.wikipedia.org/wiki/Vista_Smalltalk huh, it's just for IE7 20:34:13 weird 20:34:16 i mean, i'd probably want the graphs and the pictures to be much smaller, but i'm sure that's possible. 20:34:18 ehird: yeah okay 20:34:22 i misunderstood you then 20:34:33 yeah i know it sucks too, heard the same horror stories. 20:34:52 but that looked pretty neat, in fact looks like something i might scrap python for. 20:35:03 yeah, that totally fits how I program 20:35:09 I just get data and play with it and shove it into other data 20:35:23 * ehird is tempted to write a mathematica minus the stuck now but realises it's probably not easy :P 20:35:49 [[Request a Free Trial » 20:35:50 Send us your request and you can experience Mathematica yourself with a fully functional 15-day license.]] 20:35:53 i hate how you have to manually contact them 20:37:21 mmm, trial licenses in a VM.. 20:37:35 Sgeo: also known as bittorrent? 20:37:48 also, you can't even get a trial license without someone manually respondign to your request 20:38:09 ehird, I was talking in general. Wouldn't work for Mathematica, due to that contact stuff 20:38:18 Sgeo: well... bittorrent 20:38:18 yo. 20:38:58 I wouldn't want to run anything that might even have a risk of malware outside a VM, and if I'm going to be running it in a VM anyway, why even bother with BitTorrent? 20:39:15 Sgeo: Malware? Ah, you must be a windows user! 20:39:21 And use public trackers. 20:41:41 -!- sebbu has quit (Read error: 113 (No route to host)). 20:41:42 -!- sebbu2 has changed nick to sebbu. 20:45:44 jayCampbell: that smalltalk seems a bit castrated 20:45:46 -!- Sgeo has quit (Read error: 104 (Connection reset by peer)). 20:45:48 it seems to have a lot of primitives 20:49:21 -!- Sgeo has joined. 20:55:41 -!- nooga_ has joined. 21:00:28 . 21:03:48 -!- nooga has quit (Read error: 145 (Connection timed out)). 21:32:13 -!- olsner has joined. 21:34:47 -!- Judofyr has quit. 22:35:43 -!- GreaseMonkey has joined. 22:42:15 -!- oerjan has quit ("Good night"). 23:01:15 I've decided that a Turing machine's initial state must be the output of a push-down automaton. 23:01:56 -!- Asztal has quit (Read error: 104 (Connection reset by peer)). 23:13:09 this is awesome http://jarrett.cs.ucla.edu/ometa-js/ 23:33:17 -!- Asztal has joined. 23:40:05 -!- psygnisfive has joined. 23:46:28 -!- lament has joined. 23:46:38 i should stop listening to non-solo-piano music. 23:46:56 cause when i do, there's a risk that i will want to play it 23:47:14 and that would involve arranging it, which is not always feasible 23:55:19 What broken LZW algorithm produced that topic? 23:57:40 I want a flash-card-like program that plays notes and asks me to identify them. 23:59:01 i almost wrote that once 23:59:10 you think you have absolute pitch? 23:59:31 <3 Time-loop logic