00:01:06 -!- wooby has joined. 00:03:21 -!- jix__ has quit ("Bitte waehlen Sie eine Beerdigungnachricht"). 00:58:41 -!- Figs has joined. 01:19:09 -!- SevenInchBread_ has changed nick to SevenInchBread. 01:52:28 http://theory.stanford.edu/~vganesh/STPdocumentation.html 01:52:34 seems like the kind of thing you guys would enjoy 01:57:02 rofl 01:57:02 http://www.netscrap.com/netscrap_detail.cfm?scrap_id=85 02:05:32 rararar 02:05:49 4 hours till exam \o/ 02:09:10 ahhh... you can have a lot of fun putting a Brit and an American together :P 02:09:56 or by sleeping 02:10:00 that's pretty fun :< 02:10:53 :P 02:10:56 'pissed' 02:10:58 for example 02:11:03 means two very different things 02:11:06 ;) 02:11:11 drunk vs angry, I guess 02:12:11 mm 02:12:19 or the past tense of peeing 02:13:39 :P 02:15:28 i wish i'd wake up to alarm clocks... i could sleep :< 02:16:09 ... O.o 02:16:20 why don't you go to bed Oklopol? 02:16:24 you're always up :P 02:16:41 i slept 8-14 02:17:01 and... the whole monday 02:17:30 if i go to bed i'll never wake up early enough 02:17:40 and there is no other place to sleep here 02:17:50 my floor is full of bottles and books 02:18:55 o.o 02:21:52 well, this armchair of course, but it's too cosy once again 02:22:05 maybe i'll sleep on the bus :| 02:30:55 -!- ShadowHntr has quit ("End of line."). 02:46:11 -!- SevenInchBread has changed nick to SevenInchWizard. 02:49:29 -!- SevenInchWizard has changed nick to SevenInchBread. 02:51:28 http://www.shof.msrcsites.co.uk/sins.jpg 02:51:32 yep 03:03:18 -!- pikhq has joined. 03:03:49 'Lo. 03:03:57 hi. 03:03:59 mid. 03:04:01 :D 03:04:12 :) 03:06:11 hi pikhq 03:06:53 Hey. 03:10:37 -!- ShadowHntr has joined. 03:14:23 http://www.eldtrain.com.au/members/humour/humour11.htm 03:16:51 heh 03:44:38 -!- SevenInchBread has quit (Read error: 145 (Connection timed out)). 03:51:30 -!- calamari has joined. 03:51:42 hi 03:52:07 so this is what it looks like to irc from gaim 03:52:21 haha 03:52:30 /ctcp calamari version 03:52:33 hmm 03:52:43 guess that's not implemented 03:53:25 does it give a ctcp version response for me? 03:53:55 yup. 03:53:57 Gaim IRC 03:54:21 that's it? how lame.. hehe 03:58:03 gaim is laim 03:59:11 Yeah. 04:02:23 ... 04:02:25 @.@ 04:02:27 AHHHH 04:02:29 brainfuck 04:02:35 and not the language 04:02:59 sounds dangerous 04:03:06 Indeed. 04:03:08 * pikhq leaveth 04:03:23 no 04:03:29 more painful 04:03:31 -!- pikhq has quit (Remote closed the connection). 04:03:32 cya pikhq 04:03:33 my brain is saying 04:03:38 "You idiot, what are you doing!" 04:04:07 * calamari looks up brain surgery on wikipedia 04:05:27 -!- Sgeo has joined. 04:07:18 firefox's toolbar customization sucks 04:07:48 hello Sgeo 04:07:54 Hi Figs 04:11:59 bah 04:12:13 we can't we get a good browser? 04:12:16 IE sucks 04:12:19 Firefox is annoying... 04:22:32 http://photos1.blogger.com/x/blogger2/3718/3950/320/503462/card469.jpg 04:22:34 :D 04:29:42 -!- Sgeo has quit ("Leaving"). 04:52:46 -!- Figs has changed nick to Himself. 04:52:53 -!- Himself has changed nick to Figs. 05:16:55 have you guys played this? 05:16:55 http://www.thethinkingblog.com/2007/03/de-activate-bomb-in-15-minutes.html 05:21:24 giong to bed 05:21:26 -!- Figs has left (?). 05:38:07 I solved it first try! 05:38:22 granted, with a mere 2:41 to go... 05:47:47 ? 05:48:07 the third and fourth puzzles are really easy with a good knowledge of binary and a calculator, though 05:48:16 the flash game figs linked to 05:48:28 haha flash 06:06:59 -!- calamari has left (?). 06:08:19 'night, guys 06:08:35 gute nacht 06:09:47 -!- RodgerTheGreat has quit. 06:59:18 -!- xor has changed nick to bsmntbombdood. 07:04:44 -!- bsmntbombdood has changed nick to xor. 07:12:15 -!- xor has quit (zelazny.freenode.net irc.freenode.net). 07:12:15 -!- helios24 has quit (zelazny.freenode.net irc.freenode.net). 07:12:15 -!- GregorR has quit (zelazny.freenode.net irc.freenode.net). 07:12:25 -!- xor has joined. 07:12:25 -!- helios24 has joined. 07:12:25 -!- GregorR has joined. 07:39:47 -!- ShadowHntr has quit (Read error: 110 (Connection timed out)). 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:12:39 -!- Sukoshi has joined. 08:47:18 -!- nazgjunk has joined. 08:53:23 -!- nazgjunk has quit ("Bi-la Kaifa"). 08:53:52 -!- nazgjunk has joined. 09:16:27 -!- nazgjunk has quit (Remote closed the connection). 09:24:07 -!- nazgjunk has joined. 10:37:54 -!- nazgjunk has quit ("Bi-la Kaifa"). 10:48:17 -!- nazgjunk has joined. 11:21:39 -!- jix has joined. 11:39:30 -!- Sukoshi has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- GregorR has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- helios24 has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- xor has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- wooby has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- oklopol has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- bsmnt_bot has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- tokigun has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- nazgjunk has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- lament has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- sp3tt has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- puzzlet has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- oklobot has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- cmeme has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- meatmanek has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- sekhmet has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- SimonRC has quit (zelazny.freenode.net irc.freenode.net). 11:39:51 -!- mtve has quit (zelazny.freenode.net irc.freenode.net). 11:40:20 -!- nazgjunk has joined. 11:40:20 -!- Sukoshi has joined. 11:40:20 -!- GregorR has joined. 11:40:20 -!- helios24 has joined. 11:40:20 -!- xor has joined. 11:40:20 -!- wooby has joined. 11:40:20 -!- lament has joined. 11:40:20 -!- sekhmet has joined. 11:40:20 -!- oklobot has joined. 11:40:20 -!- SimonRC has joined. 11:40:20 -!- oklopol has joined. 11:40:20 -!- bsmnt_bot has joined. 11:40:20 -!- tokigun has joined. 11:40:20 -!- cmeme has joined. 11:40:20 -!- meatmanek has joined. 11:40:20 -!- sp3tt has joined. 11:40:20 -!- puzzlet has joined. 11:40:20 -!- mtve has joined. 12:30:45 -!- nazgjunk has quit (Read error: 104 (Connection reset by peer)). 12:31:00 -!- nazgjunk has joined. 13:30:13 -!- RodgerTheGreat has joined. 13:30:28 hi everybody 14:27:13 "Dear agony aunt. My results for various modules this year at university are very poor. I got 4%, 8%, 15%, 16%, 23%, and 42%. What is going on? Yours, Lost." 14:27:16 hehehehe 14:27:34 ? 14:29:10 IRP:REQUEST:ELABORATE_PREVIOUS_OUTPUT 14:29:22 RUN 14:30:10 * SimonRC uses continuation-passing style: 14:30:55 IRP:REQUEST(GOOGLE):TELL_RODGER_ABOUT:("4 8 15 16 23 42"). 14:50:20 the only thing I watch on TV is "Mythbusters" 14:52:52 you should watch SG-1 14:55:05 oh, good lord 14:55:16 I've seen it before, and it was terrible 14:55:32 it pisses on everything good about the original movie 15:03:31 hmm 15:03:37 Depends which one you saw. 15:03:42 Some are a bit crap. 15:04:06 And several seasons turned into big heaps of galactic politics. 15:04:56 BTW, just a little thing I'd like you to spread around... 15:05:17 http://conworlds.info/cwbb/index.php 15:05:48 It is a worldbuilding forum that I belong to that are trying to get some publicity. 15:08:54 -!- crathman has joined. 15:58:52 crathman: hi 15:59:25 hey, crathman 16:00:39 howdy 16:00:51 * SimonRC plugs it again 16:01:04 http://conworlds.info/cwbb/index.php 16:01:11 it's a worldbuilding forum I'm on 16:01:20 It neds more publicity, so spread it around 16:01:26 if you care 16:10:15 -!- ais523 has joined. 16:11:12 Could someone explain Continuation Passing Style to me? 16:11:49 continuation passign style is where you don't return the value to the caller, but instead you are given another function to pass that value to. 16:12:13 the latter is the "continuation" 16:12:44 I understand what a continuation is, so the explanation helped quite a bit 16:13:01 and the point is that call/cc combined with CPS just gives you a regular return value... 16:13:59 yup 16:14:32 cps is good for avoiding mutation wen doing stuff 16:14:43 e.g. when appending to long lists. 16:15:29 you don't pass a list around, but a function that prepends that list to another. 16:15:34 -!- sebbu has joined. 16:15:43 that's kinda like CPS 16:16:38 * SimonRC plugs a website again: http://conworlds.info/cwbb/index.php It's a worldbuilding forum I'm on. It needs more publicity, so spread it around. 16:16:43 :-S 16:19:12 -!- jix__ has joined. 16:20:01 argle 16:20:23 every time I plug it, someone else comes on who I haven;t told yet 16:21:35 hm? 16:21:37 I suspect many people here read the logs anyway 16:22:06 SimonRC was plugging a website, and got annoyed that jix__ joined just after the plug rather than just before 16:22:16 i was there before 16:22:23 i am jix 16:22:30 i just had a reconnect 16:22:33 and i got the plug 16:23:02 clients probably need to show duplicate names only once, as it would help to avoid this sort of problem 16:27:34 indeed 16:32:50 -!- jix has quit (Read error: 110 (Connection timed out)). 16:59:40 -!- ShadowHntr has joined. 17:16:16 -!- wooby has quit (zelazny.freenode.net irc.freenode.net). 17:56:45 -!- Figs has joined. 18:17:39 hey 18:17:42 opinions? 18:17:46 on what? 18:17:49 Tree = a < ((b<(d I think you smell bad. 18:18:00 that is working C++ coe 18:18:01 *code 18:18:22 that is working code in very many languages. 18:18:25 it's working C code too, probably with a different meaning 18:18:32 and it's definitely working code in HOMESPRING 18:18:40 i would guess it's working code in the majority of languages 18:19:04 (with minor modifications like changing = to something else that means 'equals', or removing the semicolon) 18:19:07 no, in BF it goes off the left-hand end of the tape 18:19:22 the next statement is 18:19:26 okay, maybe not the majority. 18:19:26 print(Tree); 18:19:36 which causes the following to be printed on the screen: 18:19:50 a(b(d(i,j,k),e),c(f,g,h)) 18:20:20 O_o 18:20:33 sorry, didn't copy the whole definition earlier 18:20:34 Tree = a < (((b<(d there you go 18:21:02 why < and + not < and > ? 18:21:19 because the branch is < 18:21:43 you should have redefined the whole nature of trees just so you could get away with using < and > 18:21:54 I thought about it 18:22:09 but I actually want this system to be useful 18:22:19 ;) 18:22:21 -!- oerjan has joined. 18:22:26 it's already pretty hard to understand 18:22:30 Hi oerjan 18:22:40 Tree = a < (((b<(d are a,b,c, etc, existing variables, or does the system just convert them to strings? 18:22:47 output: a(b(d(i,j,k),e),c(f,g,h)) 18:22:53 existing vars 18:22:57 hi all 18:23:18 * ais523 is busy trying to implement CLC-INTERCAL features in C-INTERCAL 18:23:26 Figs: not sure what do you mean by "useful" :) 18:23:40 http://rafb.net/p/dbzV1598.html 18:23:51 like, to be used in an actual project ;) 18:24:54 I'll probably end up writing a project in an esolang some day 18:25:10 I've already ended up hardcoding bits of programs in assembler to work round compiler bugs 18:25:19 :p 18:25:37 and assembler's halfway to being an esolang 18:25:44 ;) 18:25:44 Figs: not sure what kind of "actual project" needs hardcoded definition of trees. 18:26:09 lament: These aren't exactly, "hard" coded ;) 18:26:22 think about it like this: 18:26:25 a b d i j k e c f g h 18:26:30 I have a program that reads a file 18:26:35 (the tree you wrote above in HOMESPRING notation) 18:26:43 tokenizing as it goes 18:26:46 easier to understand and faster to write, isn't it? 18:26:58 and interprets the tokens and reassembles a sequence (tree structure) by parsing it 18:27:00 ais523: .........yeah 18:27:04 which I can then operate on 18:27:18 to dynamically add and remove rules from the parser :D! 18:28:52 O_o 18:28:53 eep 18:29:07 * Figs can think of some weird uses for tree-manip. functions 18:29:34 functions that clone trees and graft the clones on as new branches... 18:31:28 in 5 lines of code, it works! 18:31:29 :D 18:31:41 some languages are better for trees than others 18:31:54 the tree is the easiest data structure to understand in both Unlambda and Underload 18:31:57 (for much the same reasons) 18:32:18 I think the tree is most certainly one of the harder to understand ds's when you try to use it in C++ 18:32:39 really? 18:32:51 that's my opinion on it, at least :P 18:33:26 a tree is almost the same as a linked list 18:33:27 http://rafb.net/p/s9qVJt20.html 18:35:13 * oerjan is reading the logs, and doesn't understand why Figs said bruteforcing the 4444 problem by setting up trees is hard. Figs must not know Haskell. :) 18:35:26 I don't know Haskell :P 18:35:34 We have logs? 18:35:41 look at the topic 18:35:57 What is the bot that logs? 18:36:00 huh 18:36:04 I missed that somehow 18:36:04 :P 18:36:07 the tunes log (http://tunes.org/~nef/logs/esoteric/) loads faster 18:36:10 xor: clog and cmeme 18:36:46 the tunes project did one useful thing, so far. 18:36:50 logging bots. 18:37:19 heh :) 18:37:49 (well no, their list of resources for learning CS was pretty awesome) 18:38:51 although it seems they have removed that 18:39:09 I think I talked to much on 07.03.26 18:39:11 :P 18:39:13 the log is bigger 18:39:15 i really would like to see a completely theorem-proven operating system. It should do wonders for security. 18:39:45 I never understood these "proven correct" programs 18:39:51 oerjan: just wait 50 years for tunes to come out. 18:39:53 I would like to see a programming language in which writing a completely theorem-proven operating system would be reasonable 18:41:23 I don't think it will take 50 years. I think it will be less than 10 years until we have such a programming language. 18:41:54 oerjan: i thought we already did? 18:42:01 oh 18:42:03 "reasonable" 18:42:06 :P 18:42:08 Well if you are a genius you do :) 18:42:18 what language? :P 18:42:19 oerjan: frankly i don't believe it will ever happen 18:42:40 and I don't know what you mean by theorem-proven 18:43:19 oerjan: because 1) it's still run by humans, so worms etc will still be a problem, so security gains are almost non-existent 2) it's too much effort for too little benefit 18:43:23 Any of the new dependently typed languages should be usable if you are smart enough. If your name is Oleg Kiselyov it is rumored even Haskell may do :) 18:44:12 Of course the programming language is just one step. 18:44:41 Actually defining what it means to be secure is just as important, in order to avoid worms and the like. 18:45:21 anything run by humans cannot be secure by their own definition. 18:45:42 Machine take-over! 18:45:47 :P 18:45:51 I don't understand why you say that. 18:45:54 Yes. You cannot browse the web. 18:46:00 lament: Unnecessary is completely secure 18:46:04 I will read your mind, and browse for you. 18:46:04 just not particularly useful 18:46:46 oerjan: well, look at the current generation of worms; for the most part, they don't breach security in any technical sense 18:46:55 Of course you can browse the web if your web browser is proven secure. 18:47:13 oerjan: the user freely and (technically) knowingly permits the malware to run. 18:47:48 oerjan: that's the way it's always gonna be. 18:47:53 No. 18:48:04 oerjan: the alternative is a horribly bureaucratic OS that nobody would want to use. 18:48:16 Windows XP w/ access controls! 18:48:20 for example. 18:48:21 (yes, they are there) 18:48:39 but that's different, because XP still has actual technical security issues 18:48:50 our hypothetical OS wouldn't, but worms would be there just the same. 18:49:05 I don't agree with you. 18:49:31 You get an executable in an email. You run the executable. Bad things happen. No amount on "proof" can prevent this situation. 18:49:50 The point would be to make the operating system so flexible that nearly everything you need to run _can_ contain a proof of its own security. 18:50:04 Alternative: you get an executable in an email. No matter how useful it might be, your OS won't let you run it. 18:50:28 'Security through inability' 18:50:44 Your password is "sex". Bad things happen. No amount of "proof" can prevent this. 18:51:01 Compromise: You _can_ make an exception, but it would be _so_ rare that no one would do it for something that came through email. 18:51:45 the problem is 18:51:49 holy crap 18:51:50 http://www.trnicely.net/misc/vista.html 18:52:03 it is not in any way bad to receive executables, so the OS should allow you to do that. 18:52:19 It is not in any way bad to let user to run their executables, so the OS should allow you to do that. 18:52:35 It is not in any way bad for an executable to DOS microsoft.com, so the OS should allow the executable to do that. 18:52:57 unless you can somehow prove that the latter is bad. 18:53:16 the worm code _will_ be proven "secure" 18:53:25 so you will have no problems running it 18:53:31 but it will still do Bad Stuff 18:53:39 Interesting. 18:53:54 it will not be able to get root or something like that. 18:53:57 you have to but Godlike 2.6 on the computer that analyzes all running code, and grinds your computer to a near halt 18:54:00 *put 18:54:07 It's the same as browsers being allowed to open annoyingly many windows, essentially. 18:54:13 sure. 18:54:14 but makes sure your computer has morals. 18:54:38 ("OMG, you're looking at pr0n? No more Internet Explorer for you!") 18:54:42 :P 18:55:01 Begs the question... if my computer will be forced to have morals... whose morals? 18:55:08 oerjan: despite the lack of theorem-proved systems, there has already been a huge switch from actually exploting holes to exploiting naive users 18:55:32 oerjan: back when people used DOS, there were plenty of actual viruses that actually infected programs and then took over the system. 18:55:44 these days, it's mostly worms that get the attention 18:56:06 these days, I suspect the average computer user is less intelligent 18:56:21 as evidenced by the 'How to open the box the OS comes in' in Windows Vista's FAQ 18:56:25 well, you can't theorem-prove your users, which is my point :) 18:56:28 o.o 18:56:39 I just thought of an awful malware program ;) 18:56:58 but it's been done years ago ;P 18:58:40 Hm... DOS attacks are somewhat difficult because they don't use excessively many resources on the computer where they are running, unlike annoying browser windows. 18:59:14 even annoying browser windows can't exactly be proven to be annoying 18:59:15 So good resource management policy would be insufficient. 18:59:36 the simplest way (and I use it to secure most people's win32) 18:59:45 No but popup managers can do a good job. 18:59:47 is to block registry 19:00:01 oerjan: sure, but that has nothing to do with proof-based security. 19:00:02 and manually allow/deny each change 19:01:26 hm... 19:02:28 proof-based security will always have to prove against a policy. 19:02:58 I thought I said that already? :( 19:03:17 maybe you did 19:03:32 [07:53:02] Figs: Begs the question... if my computer will be forced to have morals... whose morals? 19:04:01 DOS attack may be desired by the user 19:04:04 a better advantage may be that once the proof has gone through, you can drop all checks that have been proved unnecessary. 19:05:16 so in a sense proof-carrying code is just a way to optimize away runtime checks. 19:07:36 of course the user should in principle be able to set the policy. 19:07:54 that might be vunerable to social engineering methods 19:08:27 http://worsethanfailure.com/Articles/Checking_Your_Digits.aspx 19:08:47 perhaps. the policy changer should at least have reasonable warnings. 19:08:49 how about a program that looks like the Chevron logo! 19:08:52 sorta 19:20:38 -!- ais523 has quit. 19:31:14 who can come up with the shortest code to turn a number into a list of digits, base 10? 19:31:37 show 19:31:50 ? 19:31:54 what language? 19:31:59 Haskell 19:32:09 count me out then :P 19:32:20 str 19:32:22 python 19:32:22 any language 19:32:23 i win 19:32:30 darn. 19:32:38 oh damn 19:32:41 didn't think of that 19:32:49 (strings aren't lists in python, but they ARE sequences) 19:33:01 oh 19:33:08 [int(i) for i in str(n)] 19:33:10 will do it 19:33:11 unless by 'digit' you mean number 19:33:14 and not character 19:33:38 do you mean numbers or characters? 19:33:43 numbers 19:33:47 oh. 19:33:59 then in python: map(int,str(n)) 19:34:08 fromEnum . (:[]) . show 19:34:09 lament: map is depreciated 19:34:16 xor: so? 19:34:18 eh, i mean 19:34:27 ok, lets make this base 53 19:34:54 map (read . (:[])) . show 19:35:16 def f(n): 19:35:16 l = [] 19:35:17 while n: 19:35:17 l.append(n%53); n /= 53 19:35:17 return l[::-1] 19:35:23 my crappy python 19:36:25 is the number passed as a string? 19:36:28 no 19:36:42 no srings attached 19:36:59 #include 19:37:05 #include 19:37:07 #include 19:37:11 using namespace std; 19:37:19 using namespace boost::lambda; 19:37:28 for some reason, I really think that C++ fails at this 19:37:32 #include 19:37:39 int main() 19:37:41 xor: really :D 19:37:41 { 19:38:03 string s = boost::lexical_cast(number); 19:38:35 for_each(s.begin(),s.end(),cout<< _1 <<'\n'); 19:38:36 return 0; 19:38:37 } 19:39:12 ok, here is my code as a list comprehension: 19:39:17 def f(n): import math; return [(n/(53**i))%53 for i in range(math.ceil(math.log(n, 53)))] 19:39:20 that's pretty good 19:39:52 actually, tack [::-1] onto the end of that 19:40:03 is _that_ base 10? 19:40:04 well, imagine doing it in C :P 19:40:04 most significant digit first 19:40:08 no, base 53 19:40:19 oh. 19:40:25 in that case, hm. 19:40:32 import Numeric 19:40:35 so you can't do the converting to string copout 19:41:11 f n = showIntAtBase 53 id n 19:41:20 yoohoo! 19:41:29 lame 19:41:39 here's my code 19:41:40 def f(n):return(n>52 and f(n/53)or[])+[n%53] 19:42:30 another way then. 19:42:41 import Data.List 19:43:03 f 0 = [0] 19:43:21 lament: nice 19:46:22 f n = reverse $ unfoldr g n where g 0 = Nothing; g n = Just (n `mod` 53, n `div` 53) 19:46:31 i think 19:47:39 bah, better to copy lament i think 19:48:53 except his code fails at 0 19:48:57 i think 19:49:10 nope 19:49:24 oerjan: doesn't 19:49:26 indeed. 19:49:29 ok 19:49:48 not only that 19:49:53 my code even sort of works for negative numbers :D 19:50:13 it does? 19:50:15 no. 19:50:55 it just returns n%53 19:51:04 but at least it doesn't crash or anything :D 19:51:16 mine crashes 19:51:26 can't take the log of a negative number 19:51:38 f n = (if n > 52 then f(n `div` 53) else []) ++ [n `mod` 53] 19:52:06 what is `x` ? 19:52:29 turning a function into an operator 19:52:49 n `div` 53 = div n 53 19:53:53 it seems haskell loses on slightly less compact syntax 19:56:01 unless, hm... 19:59:20 f n=(if n>52 then f(n`div`53)else[])++[n`mod`53] 19:59:35 ok it's a tie with all unnecessary spaces removed 20:00:39 eh, wait 20:00:47 -!- Figs has left (?). 20:00:59 is not 20:03:14 {53Ntb_} in oklotalk 20:03:27 though i'm of course adding built-ins as needed :) 20:03:43 * oerjan bops oklopol on the head 20:04:38 :D 20:07:36 ok one more try 20:07:44 f n=[a|n>52,a<-f(n`div`53)]++[n`mod`53] 20:07:49 {0->0;_%53:.$_/53} in oklotalk without the built-in function 20:07:56 yes! 20:07:59 :D 20:08:09 well, you won in existing languages... 20:08:49 hmm 20:08:50 conveniently a list comprehension with guard at the beginning gives [] 20:13:25 we should RAID our brains 20:16:05 RAID 5, probably, because no one wants to be dedicated parity 20:53:59 -!- atrapado has joined. 21:22:54 -!- ShadowHntr has quit (Read error: 104 (Connection reset by peer)). 21:22:55 -!- oerjan has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- bsmnt_bot has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- oklopol has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- tokigun has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- crathman has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- nazgjunk has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- lament has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- sp3tt has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- puzzlet has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- oklobot has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- meatmanek has quit (zelazny.freenode.net irc.freenode.net). 21:22:55 -!- cmeme has quit (zelazny.freenode.net irc.freenode.net). 21:22:56 -!- sebbu has quit (zelazny.freenode.net irc.freenode.net). 21:22:56 -!- RodgerTheGreat has quit (zelazny.freenode.net irc.freenode.net). 21:22:56 -!- SimonRC has quit (zelazny.freenode.net irc.freenode.net). 21:22:56 -!- sekhmet has quit (zelazny.freenode.net irc.freenode.net). 21:22:56 -!- oerjan has joined. 21:22:56 -!- sebbu has joined. 21:22:56 -!- crathman has joined. 21:22:56 -!- RodgerTheGreat has joined. 21:22:56 -!- nazgjunk has joined. 21:22:56 -!- lament has joined. 21:22:56 -!- sekhmet has joined. 21:22:56 -!- oklobot has joined. 21:22:56 -!- puzzlet has joined. 21:22:56 -!- SimonRC has joined. 21:22:56 -!- oklopol has joined. 21:22:56 -!- bsmnt_bot has joined. 21:22:56 -!- tokigun has joined. 21:22:56 -!- cmeme has joined. 21:22:56 -!- meatmanek has joined. 21:22:56 -!- sp3tt has joined. 21:46:03 -!- SevenInchBread has joined. 21:46:36 -!- sebbu2 has joined. 21:47:03 yay! I'm finally learning shit about computer architectures. 21:47:19 you eat anal residue? 21:47:20 wtf? 21:47:39 * SevenInchBread is working on a theretical computer system that runs with pentits (or however you call them) 21:48:02 5-valued thingies. 21:48:10 pits 21:48:17 ....PITS 21:49:17 quits i think. 21:49:31 that would be logical anyhow. 21:49:32 That's a sucky name. 21:49:37 pentits and pits 21:49:59 bits, terts, quits from Latin bini, terni, quini. 21:50:35 binary digit, ternary digit i'm pretty sure 21:50:47 you would replace binary NOT with SWISH and DROOP. 21:51:03 ...quarternary digit next if i guessed 4 right :) 21:51:32 *sigh* everybody keeps swapping mindlessly between Latin and Greek. Hexadecimal is even a hybrid. 21:51:50 if you use -15, -5, 0, 5, 15 to represent the possible values - then swish will basically reverse the polarity, -5 become 5 and 5 becomes -5 21:51:53 ....fuck word origins. 21:51:59 quaternary 21:52:03 PENTIT SOUNDS COOLER THAN QUIT... I WILL NOT FOLLOW YOUR CUSTOMS. 21:52:47 i think 'pet' would be nice too 21:53:12 ...and DROOP represents the other dimension - it lowers shifts the value closer to 0 (not sure what 0 will do - might stay the same or it might wrap back around to -15 or 15) 21:53:24 pet sounds cool. :) 21:53:33 binary is the way to go 21:53:40 NOPE 21:55:32 it is interesting to consider the possibilities though... the number of capacitors you'd need would plummet dramatically to represent the same amount of data... you could put 5 interupts per line (or is it 4?)... 21:55:49 and some other nifty things. 21:56:33 SevenInchBread no. 21:56:52 ?? 21:57:23 the thingies are as small as they get with the current technology, more states would require bigger thingies 21:57:47 hmmm... it would? 21:58:12 a bit is low charge or high charge... you couldn't split it into 5 levels without making it bigger? 21:58:19 no 21:58:41 well yeah, I'm not really considering a practical implementation here. 21:58:45 a transistor is binary 21:58:58 you would need an exponential growth in the number of wire thingies in the storage thingie 21:59:21 hmm 21:59:25 no you probably wouldn't 21:59:49 but it's clear even 3 states would make as microscopic stuff as in a pc impossible 22:00:25 ....well, transistors aren't strictly binary... otherwise they wouldn't play nice with analog devices like my guitar amp. 22:01:27 well, binary transfer is faster and safer than analog 22:02:25 >.> 22:02:48 I thought.... the main advantage of analog computers was the increase in speed? 22:02:57 never. 22:03:43 i've no idea what an analog computer is, so i have no say there really 22:03:45 :) 22:04:22 an analog comptuer is a comptuer that isn't... digital 22:04:38 like the hydraulic one the Brits made to simulate economy. 22:04:38 i know 22:05:20 anyway, quantum computers are the way to go 22:05:29 and even so... a 5-value system is still digital. 22:05:30 -!- sebbu has quit (Connection timed out). 22:05:56 yeah, but you are wrong in thinking it can be made smaller 22:06:34 not smaller... just hold more information per unit - I guess. 22:06:45 * SevenInchBread didn't mean to delve into physical properties. 22:07:06 well, that's pretty obvious :=) 22:07:30 you could use a calculator for storing one ...pet 22:11:40 yeah... analog computers are much faster for doing computations that are related to their physical properties. 22:11:57 ...would be cool if we had hybrid computers. 22:12:03 that did a little bit of both. 22:12:57 qubits will do anything 22:13:29 SevenInchBread: that's very easy. 22:13:33 SevenInchBread: you just need analog hardware. 22:13:46 connected to a digital computer. 22:14:11 (same with quantum computers - they're just regular computers equipped with a quantum register) 22:14:46 SevenInchBread: Analog hardware is easy to get - for example, a microphone - but you will need to construct something specialized for solving differential equations or whatnot. 22:18:10 hmmm... guess you could just plug some analog hardware into your computer and feed certain problems through it. 22:18:35 BUT 22:19:05 it's not standardize... so you can't take advantage of having most modern computers having these certain "analog functions". 22:19:18 ....no big deal though. 22:23:02 so? 22:23:08 think of graphics cards 22:23:16 they do magic 22:23:30 they do operations that your computer would otherwise do anyway, but much faster 22:23:37 same with analog stuff 22:23:45 you would plug in a "differential equations card" 22:24:19 as soon as a game comes out that uses differential equations to simulate physics, and it runs fine with the card and poorly without, everybody will buy the card. 22:28:10 -!- oerjan has quit ("leaving"). 22:53:15 hmmm... I didn't actually know what graphics cards did. :) 23:00:53 -!- sebbu2 has quit ("@+"). 23:18:28 -!- atrapado has quit ("min-computable"). 23:20:58 -!- crathman has quit ("Chatzilla 0.9.77 [Firefox 2.0.0.3/2007030919]"). 23:25:27 graphics cards use totally normal digital hardware, but it's very specialized for it's purpose. 23:25:35 more specialized = more efficient. 23:26:11 the heart of a modern GPU is really a vector processor- an ALU built for doing matrix multiplications. 23:44:14 hmmm... are there different ways to run processes in the background on different linux distros. 23:47:53 -!- calamari has joined.