00:09:24 -!- goban has joined. 00:30:39 -!- goban has quit (Remote closed the connection). 00:34:51 -!- goban has joined. 00:36:34 -!- sebbu has quit ("@+"). 00:52:25 har har! 00:52:32 that map is public record and denying me access to it is punishable by 90 days in jail 00:52:37 according to the colorado revised statutes, title 24, section 72, part 2 00:52:45 i win :) 01:20:22 zzzzzzzzzzzzz 01:20:30 yay! 01:20:31 zzzzzzzzzzzzz 01:26:28 -!- jix__ has quit ("This computer has gone to sleep"). 02:07:04 -!- UnrelatedToQaz has joined. 02:07:20 hey 02:08:36 Baz-wha? 02:13:09 -!- UnrelatedToQaz has quit ("ChatZilla 0.9.78.1 [Firefox 2.0.0.6/2007072518]"). 02:18:47 baz-quux 02:20:04 bsmntbombdood: what map? 02:20:15 ihope: of storm sewers 02:25:33 Here, have a law: if an emergency vehicle is approaching, pull over and stop. 02:26:06 Apparently no exception is made for freeways. 02:26:29 so? 02:29:18 Oh, I was wondering and... apparently I felt like saying that. 02:33:50 i hate how in a torrent with many files, all the files are 50% done instead of half of them all done 02:34:21 s/, all/, often all/ 02:36:36 Seems that if you're on a freeway and there's an emergency vehicle in the thing connecting the two roads, you're supposed to move one lane "apart" from the vehicle if possible. 02:36:52 yes 02:37:14 What does "one lane apart" mean, exactly? 02:37:23 one lane away 02:37:29 With one lane between the vehicles, or one lane over? 02:37:39 what? 02:37:42 That is, not in the same lane? 02:37:50 one lane between 02:37:58 * ihope nods 02:38:05 learning to drive? 02:38:25 Yup. 02:38:45 Pollution-loving wimps :( 02:39:00 That describes most of the US. 02:39:16 Especially our fondness for urban sprawl and a lack of decent public transportation. 02:39:26 i have knowledge, so i'm a pollution-loving wimp? 02:43:47 If you have knowledge and don't use it, you're a hippy. 02:44:19 I guess the government's decided that 120 MPH is the fastest relative we want to have in a head-on collision. 02:44:28 s/relative/relative speed/ 02:44:55 wrong, if you're talking about the federal government 02:45:08 I said just "the government" for a reason :-P 02:45:28 Are there higher speed limits than 55 for two-way traffic elsewhere? 02:45:32 75mph is the fastest speed limit allowed if you want to receive highway funding 02:45:36 Heck, are there higher speed limits here? 02:46:03 Freeways... there's nothing for a while, and then suddenly there's an on-ramp and you find yourself between two cars when there are only two lanes. :-) 02:46:10 that is, a state must have a maximum speed limit <= 75mph to get highway funding 02:46:35 Can states have a speed limit of 75 on a two-way road? 02:47:03 i think states can have whatever speed limits they like 02:47:35 Well, yeah, but if they want highway funding. 02:47:39 "In 1865, the revised Locomotive Act reduced the speed limit to 4 mph in the country and 2 mph in towns." http://en.wikipedia.org/wiki/Speed_limit 02:48:18 that is of dubious constitutionality, in my opinion 02:57:52 http://www.isbc.com/business/mistakes.cfm 02:58:23 i can has 640k? 03:16:09 -!- ihope_ has joined. 03:16:46 There. Now that everything's upgraded and I have my wireless connection working again, I can actually start work on that Unlambda interpreter. 03:18:52 how are you going to do it? 03:19:21 Haskell, monads... 03:21:30 and the call/cc? 03:22:47 i wonder if you can implement call/cc with tree-rewriting 03:25:23 Continuation monads. 03:25:28 Rather, a continuation monad. 03:25:55 so you're compiling to haskell or what? 03:27:34 Parsing into a Haskell data structure and then running. 03:29:48 write an unlambda to brainfuck compiler in unlambda 03:32:52 Why not a Haskell-to-Unlambda compiler? 03:33:06 because that's too large 03:33:16 Pff. 03:33:34 although simplified haskell to unlambda might be interesting 03:33:36 * ihope_ decides that adding a useful combinator to Unlambda is worth removing its comment functionality 03:34:08 haskell is just too complicated to write a compiler for fun for 03:34:22 Mm, gotta go. 03:34:29 Bye. 03:34:33 -!- ihope_ has quit ("Lost terminal"). 03:36:34 i have no idea how to compile a functional language to bf 03:38:43 PEBBLE functions. :p 03:40:07 are they first order? 03:40:15 er, first class 03:42:40 -!- poiuy_qwert has joined. 03:43:57 No, I mean "functions" as in "they work". 03:44:02 Err. 03:44:04 "it works". 03:45:14 Hahaha 03:45:27 oh 05:29:47 g'night everyone 05:29:59 -!- RodgerTheGreat has quit. 06:54:44 -!- olsner has joined. 07:16:23 -!- cherez has quit (Read error: 110 (Connection timed out)). 07:41:09 (bsmntbombdood) i hate how in a torrent with many files, all the files are 50% done instead of half of them all done <<< get a good torrent program... 07:41:22 like? 07:41:28 or make one 07:44:01 ľtorrent for one 07:44:18 you have to manually tell it to dl them one by one though 07:44:43 you can assign separate dl speeds for individual files 07:45:19 isn't that windows only? 07:46:40 i have no idea... but perhaps. 07:46:57 i have a feeling there are decent programs for unix as well... 07:47:49 actually, the reason i'm doing my torrenting on this machine is that i can use ľtorrent 07:47:54 bittorrent sucks ass 07:59:59 -!- clog has quit (ended). 08:00:00 -!- clog has joined. 08:09:44 -!- olsner has quit. 08:28:52 -!- GreaseMonkey has joined. 08:38:06 Deluge is the equivalent for *nix, bsmntbombdood. 08:38:18 Once I found Deluge, I pretty much abandoned my own torrent client. 08:38:25 (Even though I had most of it done.) 08:38:42 hmm 08:39:06 I'm going to start hacking at Deluge though. First thing I want to do is add stuff from BitTyrant's new BT paper. 08:39:22 what stuff? 08:39:51 They have a new piece obtaining and queueing algorithm to speed up a torrent. 08:43:22 azureus' peer dht is pretty nice 08:53:43 -!- poiuy_qwert has quit. 09:03:49 -!- GreaseMonkey has quit (Success). 09:06:30 -!- GreaseMonkey has joined. 10:38:03 night all 10:38:23 -!- GreaseMonkey has quit ("guess what that button did"). 11:09:56 -!- jix__ has joined. 11:43:29 -!- ehird` has joined. 12:11:59 -!- jix__ has changed nick to jix. 12:32:16 -!- UnrelatedToQaz has joined. 12:33:52 !info ololobot 12:34:00 Wrong channel... 12:34:02 hang on. 12:34:13 There. 12:34:22 -!- UnrelatedToQaz has left (?). 12:37:07 :D 14:37:21 -!- wellons has joined. 15:17:55 -!- goban has quit (Remote closed the connection). 15:40:28 -!- puzzlet has quit (Remote closed the connection). 15:40:38 -!- puzzlet has joined. 15:44:49 Does anyone know about a brainfuck implementation that can multithread several programs working on the same memory array? 15:46:02 ? 15:46:12 like a boring brainfork? 15:46:25 seveninchbread did something like that 15:53:44 hmm... i see, thanks 15:54:58 i do not know where 15:55:00 you can get it. 15:55:21 (i had to split to multiple lines for obvious reasons) 15:56:19 if sib comes here, you can ask him, though it isn't exactly that hard making it yourselfidy helfity 15:56:21 skdjgf 15:57:21 i wrote something similar yesterday 16:01:49 and, i don't see the reason for splitting to multiple lines... :-( 16:09:27 whut? 16:09:35 can i lick your source? 16:10:50 -!- sebbu has joined. 16:14:58 you need subversion, use this command: svn checkout https://opensvn.csie.org/wbf2c/trunk wbf2c 16:15:36 i have a website that explains things a bit here: http://www.cse.psu.edu/~wellons/bf/ 16:43:17 !bf_gen oklopol 17:31:57 -!- jix has quit (Read error: 104 (Connection reset by peer)). 17:33:52 -!- jix has joined. 17:35:14 -!- cherez has joined. 17:57:12 -!- jix has quit (Nick collision from services.). 17:57:26 -!- jix has joined. 18:05:31 -!- Arrogant has joined. 18:14:41 -!- ihope has quit (Nick collision from services.). 18:15:09 -!- ihope_ has joined. 18:19:45 http://www.piepalace.ca/blog/asperger-test-aq-test/ 18:19:51 36 !! 18:24:34 "When I talk, it isn't always easy for others to get a word in edgeways. " like... it's hard to get to say something when i'm saying something? 18:24:56 i actually cannot translate "edgeways" there... 18:25:38 That's partially because the phrase is "can't get a word in edge-WISE" 18:25:51 i do know. 18:25:58 And it means nobody will shut up for long enough to let you talk :) 18:26:02 i still don't know what it means there :< 18:26:05 ah 18:26:12 so i totally failed what it mean 18:26:13 *means 18:26:19 So when this guy talks, he just babbles on and on and on and nobody else can talk. 18:26:28 so i totally got it right 18:26:33 Yeah. 18:26:47 i just wasn't sure 18:26:51 And it means nobody will shut up for long enough to let you talk :) << Was referring to the normal phrase, not his variation :) 18:26:52 now i am 18:26:59 ah 18:27:29 "I would rather go to the theatre than a museum. " you'd have to pay me a lot to get me to either... 18:29:32 -!- pikhq has quit ("leaving"). 18:30:57 I'd rather go to the moon than a theater 18:30:59 hmm... i can remember any phone number easily, for just about as long as i like... then again there's no way for me to remember a birthday... so i prolly get "average" on that just for having a weird memory 18:31:27 well, i can remember any number as long as it doesn't mean anything to me 18:31:43 when it gets a meaning, i remember the meaning 18:31:53 * SimonRC has dinner 18:32:23 SimonRC: you got 36? 18:32:30 i'm a mere 28 :\ 18:32:32 yes 18:32:42 * SimonRC is geekier than oklokok! 18:32:44 * SimonRC has dinner 18:32:44 i have a feeling i'd get a better score if i actually talked to a doctor :P 18:33:01 better == bigger 18:34:16 -!- poiuy_qwert has joined. 18:34:58 -!- ihope has joined. 18:44:28 You need javascript for it to work... 18:44:51 44, it says. 18:44:59 Not that I answered all the questions honestly. 18:47:16 oooh, aspies test 18:47:21 * sp3tt tries 18:47:33 I got like 120/140 on one once :( 18:48:48 well, i'm pretty good at getting friends, but people usually think of me as "the weird guy" 18:50:00 i really can't believe any of you is less geek than me 18:50:21 ... 18:50:22 morte 18:50:23 *more 18:50:24 38! 18:50:45 the test must be crooked! 18:52:07 I got it up to 49. 18:53:06 actually, i can easily think of any of those options suiting me 18:53:51 those are general big-picture questions, so i basically just pick a random situation i've been in and answer based on that 18:56:12 "I enjoy doing thing spontaneously." <<< thing is a character in addam's family 18:56:19 it's a hand 18:56:24 does this refer to masturbation? 18:56:43 like... hold on a min, i'll do some quick masturbation 18:59:17 i guess i'd have the same answer were it either 19:00:35 doing thing is a bit different than masturbation 19:01:52 well, i'm deriving it from the fact "masturbation" means "desecrating the hand" 19:03:29 Doing Thing. 19:04:14 "bbl guys, gotta do some thing ->" 19:04:29 "i hope you mean something" 19:04:33 "err... yes, sure" 19:04:45 'something' 19:04:58 i hate how i always fail quoting 19:26:00 -!- GregorR has changed nick to GreorR. 19:32:47 Actually I think it is "The Thing". 19:33:27 The Thing is a movie, Thing is the hand from The Adams Family 19:33:39 ah, ok 19:34:06 the thing is something by King? 19:34:53 no i dont think so 20:17:30 -!- GreorR has changed nick to GregorR. 20:18:42 random idea for some snippit of code: 20:19:03 accepts mouse-written drawings, then using some kind of OCR, converts it into mathematical notation in real time 20:19:30 so you could e.g. draw 231, a line beneath it, then 500 beneath that, it'd convert it correctly, then display a latexified (or whatever) version at the same size, replacing the drawing 20:19:44 once you've drawn the whole thing, it'll be converted to latex + displayed as an image 20:19:53 and, presumably, you could evaluate it or whatever 20:20:08 -!- oerjan has joined. 20:20:38 ehird`: like maple? 20:20:57 hmm.. i'm not sure if it does that though... i just know it has something like that 20:21:07 prolly something ridiculously simple 20:21:08 well, i'll show a sort-of-example 20:21:15 i write "1 +" using my mouse 20:21:45 within some very short space of time (hopefully <1 second), it'll disappear and be replaced by whatever latex looks like when rendering the equivilent equation, at roughly the same size 20:21:46 have you seen the video where the guy draws a cart on a blackboard then draws a play button and makes it move? 20:21:50 same as i carry on with the expression 20:22:03 and no 20:22:06 a touchpad that looks like a blackboard that was 20:22:08 cool vid 20:22:42 but anyway 20:22:43 you could draw strings and solid objects and make them move realistically in 2d 20:22:48 uh i wan tthat 20:22:52 it'd be pretty nice to be able to, e.g., get a tablet 20:22:56 start up an app 20:23:08 write some mathematical notation, look up at the app and see it in rendered latex form 20:23:09 also, your thing would be fun if you have a touchpad 20:23:15 and be able to evaluate it and stuff 20:23:54 like maybe if you wrote = and left it for a second it would evaluate :) 20:24:20 might be good for code too... 20:24:22 hmm... an ski parser that did that would be fun :P 20:24:33 * SimonRC thinks 20:24:35 i know there's a flash thingie, but you don't draw anything in that 20:24:47 IWBNI you could draw decision trees and tables and turn them into programs 20:25:06 I am sure this has actually been done before, but not, I suspect, with handwriting recognition. 20:25:24 Now there is a nice PhD topic 20:25:24 SimonRC: sounds good 20:25:41 -!- Arrogant has quit ("Leaving"). 20:25:41 SimonRC: but i think mathematical notation lends itself to being written more than, e.g. a decision tree 20:25:53 How about Haskell? 20:25:56 anything mathematical is simplest when you write it 20:25:59 thus.. 20:26:14 however, programming languages and decision trees and stuff - maybe not, they were designed for keyboard entry 20:26:28 maybe lisp. 20:26:40 Have you seen a Haskell paper? 20:26:46 nope 20:27:02 Haskell as programmed in is a mere shadow of the notation that the programmers have in their heads 20:27:22 in papers, the ASCII-art becomes nice math notations 20:28:01 when i program haskell i see haskell code... not mathematical notation 20:28:40 (<- => -> become arrows, | bceomes a proper bar, ++ join together, <+> <*> become symbol-in-diamond, etc) 20:28:56 i don't see that =p 20:29:48 they use a preprocessor called lhs2tex 20:30:11 I know 20:30:43 I feel that that notation is the "real" Haskell, and the programmed format is an approximation to it. 20:31:01 i think haskell is what the haskell report defines it as. 20:31:18 the programmed format may be older. 20:32:18 show me an example of the notation 20:34:09 <.< 20:34:22 heh 20:35:24 a big sample 20:35:26 where it's used lots 20:35:29 so i can see what it looks like 20:36:45 aaah, SimonRC beat me on the aspergers test 20:36:50 i got a 30 20:37:19 aspergers test? 20:37:39 would this be a scientific, based-in-reality test or a quiz test 20:37:46 quiz 20:38:14 link 20:38:44 http://www.piepalace.ca/blog/asperger-test-aq-test/ 20:39:22 it might as well be called a "social ability test" 20:40:00 except for the bits about dates and telephones and obsession 20:41:07 i'll probably do shite on it 20:41:09 and i have no idea why 20:41:25 quiz/test-type things just always give the opposite of what i really am :p 20:42:54 um 20:42:57 you are in denial! 20:42:57 WHERE is the submit button 20:43:07 you fill it in, then you get an answer at the bottom 20:43:11 THERE is none 20:43:15 hm wtf 20:43:17 49/50 20:43:17 it has some javascript fail 20:43:20 which did i miss 20:43:31 ah there 20:43:33 lots of scheme stuff replaces the word 'lambda' with the symbol lambda 20:43:39 i hate that 20:43:43 " Scores over 32 are generally taken to indicate Asperger's Syndrome or high-functioning autism, with more than 34 an "extreme" score." 20:43:45 i scored 35... 20:44:17 well; that fits considering i do have aspergers 20:44:23 the letter lambda looks terrible in a sexp 20:44:38 it only looks good in church's notation 20:45:36 at any rate, "texed" haskell certainly looks pretty 20:45:52 but ascii is not too shabby either 20:46:12 i think i got some of the questions wrong; anyway 20:46:15 yeah, the tex haskell does look nice 20:46:22 i protrayed myself to be a bit more sociable than i am :p 20:47:20 i think the whole point of that test is that it examines your opinion of yourself, rather than what you actually are 20:47:30 for example, the first question "I prefer to do things with others rather than on my own." 20:47:35 that doesn't even mean anything 20:47:39 what kind of "things"? 20:47:54 sex is the only thing i like doing with other people 20:48:14 i took it to mean any personal contact 20:48:52 -!- wellons has quit ("ERC Version 5.1.2 $Revision: 1.796.2.4 $ (IRC client for Emacs)"). 20:49:10 i certainly prefer to do foo, bar and baz with others, while qux and quux i will gladly do on my own. 20:50:39 "I am fascinated by numbers." - does this belong in a test on aspergers? 20:50:42 sure 20:50:59 i hate numbers 20:51:18 i love numbers 20:51:19 :p 20:51:23 sure to the first statement 20:51:49 if there's any numbers in it, it's not abstracted enough 20:52:29 helios24 has always been a bit primitive to me 20:53:04 bsmntbombdood: just think of numbers as the skeleton category of Set 20:54:44 it's still a number, whether it's 2 or {{}, {{}}} 20:55:27 wee, i got 26 on the test 20:55:44 barely beating a math contest winner 20:58:28 but of course it's useless without some sort of an indication of possible error size/probability 20:58:50 which i suspect to be around +- 10... 20:59:00 or at least +-5 21:00:59 Âą <-- is that a +- sign? 21:01:32 -!- olsner has joined. 21:01:47 SimonRC: yes 21:03:47 irc needs some sort of unicode macro system 21:03:55 \+- transforms into Âą or something 21:04:07 ...no 21:04:15 unicode is evil 21:05:09 unicode is not evil 21:05:33 -!- RodgerTheGreat has joined. 21:05:47 * ehird` finds a joined ++ in unicode so he can say "unicode is ++good" 21:11:04 â 21:11:07 âĄ 21:12:12 someone should modify nethack and make it abuse unicode and control characters to hell 21:12:15 i bet you could get it looking really good 21:13:59 & 21:14:24 heh 21:14:30 UNICODE SMILEY âş 21:14:41 âžâ˝ 21:14:53 â˛ 21:15:42 ooh 21:15:45 what about a unicode befunge 21:15:50 â instead of ^, etc 21:16:58 INTRODUCING THE â˝âŻ PROGRAMMING LANGUAGE 21:17:06 Designed to be the first name solely in unicode. 21:17:20 oh jesus 21:17:22 my friend made unicode print quite cool mazes 21:17:44 ...yes, he programmed a maze generator in unicode 21:17:59 is unicode turing complete? 21:18:16 a maze generator *generating* unicode is a different matter entirely 21:20:43 turing complete unicode... that makes my mouth water 21:20:45 that's just crazy 21:20:48 a turing complete CHARACTER SET 21:21:39 that would be rather fun 21:21:53 just add some control characters that can do branching.... oooh... 21:21:59 fun 21:22:18 ;-) 21:23:24 the algorithm for bidirectional rendering of text seems quite intricate though - a few carefully inserted extra rules could perhaps make it turing complete 21:24:13 i would love to see 99 bottles of beer in unicode using loops of some sort 21:24:30 this is probably rather like my theory that HTML by itself is *very nearly* TC 21:25:10 umm 21:25:11 no it isn't 21:25:19 it has nothing that would make it close to tc 21:25:28 it is in every way the archetypical markup language 21:25:36 you can do HTTP redirects (looping) 21:25:50 that doesn't really count 21:25:53 form elements and passed parameters via URLs also offer some possibilities 21:25:58 that's not HTML 21:26:01 that's HTML+HTTP 21:26:07 or HTML+some way to handle passed parameters 21:26:08 psh 21:27:11 javascript ;-) 21:27:52 I had an idea a while back for a network protocol in which the packet format represented a TC language that could be used for writing all kinds of networking utilities, games, file-transfer programs and viruses 21:28:17 sounds nicely esoteric 21:28:19 make a spec 21:28:40 RodgerTheGreat: make timing matter too ;-) 21:28:56 the entire language is one big race condition, hehe 21:29:00 and the fun part was that the system itself centered around being p2p- you'd "set up" a network by firing off a worm that would traverse the network and build routing databases on all the computers 21:29:44 that's neat 21:29:44 how do you stop exploits? 21:29:45 seriously 21:29:46 make it 21:30:02 bsmntbombdood: don't allow the interpreter to access HD or just about any unprotected external data, of course 21:30:11 you can still dos 21:30:22 you can ALWAYS do DoS 21:30:36 you can dos much easier if you're given a turing machine... 21:30:39 and yeah, scripts are sandboxed 21:30:54 RodgerTheGreat: "scripts" - it's just binary data, right? 21:30:55 not a HLL 21:31:04 kinda... 21:31:24 i think it should be low-level simple binary data... more like a protocol :) 21:31:33 make a simple assembler or something 21:31:43 yeah 21:31:45 it resembled Redcode a bit, actually 21:32:02 obviously you want the data actually transmitted as compact as humanly possible 21:32:11 self-modification and spawning new packets was a common practice, and the loopback device becomes really handy 21:32:13 otherwise the latency for something like, say the WWW, would be staggering 21:32:32 unicode could be tc if you added regexes natively and expanded them with a macro system 21:32:51 anyway, i'm gonna eat a food -> 21:35:18 I really love the idea of unicode macros 21:35:34 http://bash.org/?754254 21:35:34 RodgerTheGreat: how many opcodes do you think you could squeeze it down to? 21:35:39 8? 16? 21:35:43 16, surely 21:35:46 i wonder if there's an implementation alreday 21:35:49 16 would be good 21:35:53 yes 21:36:08 you could name them 0-F for obvious reasons :P 21:36:23 though for actually using the assembler maybe you could think of some better mnemonics, hehe 21:36:31 allow asm macros, though, that act just like an opcode 21:36:39 using only 16 opcodes all the time would be teeeedious 21:37:06 why 16? 21:37:14 bsmntbombdood: 4 bits 21:37:29 the more opcodes, the less you need, and it's easier to program 21:37:32 the spec was never finished, but I was also considering a high-level version that could be like "code"@AA.45.17.BB# to send a chunk of data off to the next machine 21:37:44 bsmntbombdood: this is a >network protocol< 21:37:52 compactness is more important than anything 21:38:04 you would have to make everything memory-mapped, and you use more space anyway for the addresses 21:38:19 there's plenty of tricks you could do 21:38:26 * SimonRC reads up... 21:38:45 using a full char would allow for a wide range of opcodes with the added benefit of being able to punch in code in a normal text editor 21:39:23 i'd assume you would use an assembler.. 21:39:26 sure, but it uses more space 21:39:33 and yeah, assembler is a must 21:39:36 otherwise, hex editor 21:39:37 you use less opcodes 21:39:45 how about 5 bits :D 21:39:53 32 opcodes should be enough for everyone! 21:39:58 lament: i was just thinking something like kinda like bnf for the macro system... and have tc regexes inbuilt in unicode format. just out of curiosity is that was you had in mind too? 21:40:04 like like like 21:40:10 1 is also a power of 2 21:40:21 0 bits ;-) 21:40:30 heh 21:40:36