00:34:41 -!- hagb4rd has quit (Quit: hagb4rd). 00:36:22 -!- NihilistDandy has quit (Quit: leaving). 00:41:47 -!- carado has quit (Remote host closed the connection). 00:42:56 Hmm, I guess REBEL's compose is effectively quasiquoting? 00:43:07 and with a rebol yell 00:44:04 -!- carado has joined. 00:49:54 -!- Bike has quit (Ping timeout: 264 seconds). 00:50:09 -!- Bike has joined. 00:54:47 -!- SirCmpwn has quit (Excess Flood). 00:55:05 -!- SirCmpwn has joined. 01:07:33 I think I really like the refinements thing 01:07:46 Although it bears some similarities to keyword arguments in Racket or CL 01:07:48 jsvine: Oh, you're good. Well -- I used to, but I'm not currently near a beach. I do enjoy long walks, though. 01:07:50 it is, uh 01:07:57 not easy to be far from a beach in cornwall 01:11:04 "When I try to run REBOL on my Mac68K, it says I don't have enough memory. Why?" 01:13:42 -!- FreeFull has quit (Read error: Operation timed out). 01:15:44 Found a bug in REBOL 3 01:15:49 Unfortunately, I can't access chat 01:16:53 Sgeo 01:16:58 you're writing a deadfish interpreter 01:17:06 why do you even need an implementation of rebol 01:17:16 what kind of uncreative question is that 01:17:27 Phantom_Hoover, I didn't start writing a deadfish interpreter yet 01:17:45 stop trying to learn every fucking language on the planet! 01:17:59 -!- FreeFull has joined. 01:18:15 for what values of learn are we talking 01:18:59 i mean learn in the biblical sense 01:19:10 language tourism 01:19:21 oh that biblical sense 01:19:36 hm i dont think sgeo actually learns his languages that much? 01:19:51 are there other biblical senses of learn 01:19:56 does looking at a language constitute learning 01:20:02 Sgeo: btw you missed the thingy 01:20:16 see i had a good thing written up but then ph said a thing and i shortened it so i could respond quicker 01:20:19 if you mean looking in the biblical sense, then yes 01:20:25 "eg im sure sgeos written a line of haskell but has he truly learned it? i put forward the claim that sgeo is merely practicing language tourism" 01:20:49 elliott, I saw in the logs 01:20:59 is the biblical sense of looking getting burned alive by a fire tornado? 01:21:15 i'll be frank with you, i don't actually know 01:21:22 i haven't read the bible 01:23:29 does anyone, truly 01:24:54 I have read the Bible, but it doesn't seem to help to answer your question. 01:25:19 do you even know what know means in the biblical sense 01:25:36 Fucking 01:27:33 -!- Frooxius_ has quit (Quit: ChatZilla 0.9.90-rdmsoft [XULRunner 1.9.0.17/2009122204]). 01:27:49 -!- Frooxius has joined. 01:33:15 -!- hagb4rd has joined. 01:34:53 Coq abuse of the day: let's add axioms stating that every Type is a probability distribution! 01:38:40 And then, uhh... no, don't do that at all. 01:38:52 Instead, just add axioms stating that every Prop has a probability, and they obey the laws of probability theory. 01:39:16 :) 01:39:18 I ... think REBOL answers one of the things I dislike about Tcl. 01:39:31 Sgeo: go on 01:40:11 I wonder if you could do anything interesting with that. I would think that there would exist no (Prop, real number) pair, with the real number strictly between 0 and 1, such that you can prove that the probability of Prop is that number. 01:40:16 Simply because that would be weird. 01:40:24 youre not sgeo 01:40:35 Good thing I'm not talking about REBOL and Tcl, then. 01:40:46 mnoqy, the compose function effectively acts as a quasiquoting mechanism 01:41:18 how so 01:41:46 So if you have a function that's accepting a block of literal values, you can use compose to easily dynamically make the data to be passed into it 01:42:03 mnoqy, by having absolutely nothing to do with what a sane functional programmer would consider composing. The name does suck. 01:42:08 http://www.rebol.com/r3/docs/functions/compose.html 01:42:29 ah 01:43:18 yeah i was thinking function composition 01:43:40 Hmm, it's not quite adequate, though. I think. It does an automatic splicing thing, but automatic splicing skeeves me out. But disabling it leaves you with no form of splicing 01:43:49 wow what does that have to do with composition at all 01:44:15 What does composing a letter have to do with composition at all? 01:44:30 (I still think the name sucks, despite my retort) 01:44:32 ok fair 01:44:41 it still looks weirdly used in these docs 01:45:27 "If the result of an expression is a block, then the elements of that block are inserted into the output block:" 01:45:30 That fact hurts a little bit. 01:45:56 tswett, that can be disabled by using compose/only. But then you lose splicing altogether, I think. 01:45:56 Okay, /only changes that. Whew. 01:48:20 Sgeo: hey, lemme tell you about ultrafilters! 01:48:46 Sgeo: suppose you have a set X. Then an ultrafilter on X is a collection U of subsets of X with all of the following properties: 01:49:04 Hey, lexande was telling me about ultrafilters the other day. 01:49:31 The empty set is not a subset of U; given an element of U, all of its supersets are also in U; given two elements of U, their intersection is in U; and given a subset A of X, either A or the complement of A must be an element of U. 01:49:31 And Arrow's theorem. 01:50:25 Now, the obvious ultrafilters are the ones of the form { A : x is an element of A, A is a subset of X }, for elements x of X. 01:50:40 All supersets of every element of U is in U? Does this include those supersets that contain elements that are not in X? 01:50:46 No. 01:51:36 Also "The empty set is not a subset of U" seems ... weird 01:51:45 Actually, it seems impossible, come to think of it. 01:51:46 Er, whoops. The empty set is not an *element* of U. 01:52:00 Thinking about it for a while, it seems like these obvious ultrafilters (called "trivial ultrafilters") are probably the only ultrafilters that exist. If there are any other ultrafilters, something really weird must be going on. 01:53:08 REBOL reduce also has nothing to do with functional reduce, but the name does make more sense than compose 01:53:13 Indeed, I think it's possible to prove that it is impossible to define a non-trivial ultrafilter. 01:53:42 However: in ZFC, every infinite set has non-trivial ultrafilters. 01:53:55 It says there is also free ultrafilters, according to Wikipedia, but not on finite sets. 01:54:24 Right. Finite sets don't have non-trivial ultrafilters. 01:54:40 ("Free" is a synonym of "non-trivial".) 01:55:58 ultrafilter : ((x : A) -> Dec (P x)) -> (xs : [A]) -> ... 01:56:00 REBOL has ... issues with mutability 01:56:12 The copy function is essential to understand well, I think 01:57:14 Come to think of it, maybe I can define a non-trivial ultrafilter on the integers? 01:58:13 How about this: a set A is in U if and only if for every alternating string of 1s and 0s that ends with 1 (like "1010101"), there is an integer in A whose binary expansion ends with that string. 01:58:35 shachaf: have you seen the Tao post 01:58:40 Whike 01:58:55 Which bike? 01:58:57 Mm, no, that doesn't work. Consider the set A = {11, 1101, 110101, 11010101, ...} and the set B = {111, 11101, 1110101, 111010101, ...}. A and B are disjoint, but they are both elements of U. 01:58:59 @where Tao 01:58:59 I know nothing about tao. 01:59:05 That's the spirit! 01:59:35 shachaf: http://terrytao.wordpress.com/2007/06/25/ultrafilters-nonstandard-analysis-and-epsilon-management/ 01:59:51 Oh, that Tao. 01:59:57 The Tao that *can* be spoken of. 02:00:03 quite so. 02:00:34 No, I haven't seen it. 02:00:59 It defines ultrafilters, and relates them to voting (and so arrow's theorem) 02:02:19 do does [print "This is silly"] 02:02:34 Hm. If you have an infinite set of voters, you can say that a bill passes if and only if the set of all yeas is an element of the ultrafilter. 02:02:54 Static analysis of a bunch of REBOL code is probably harder than TCL 02:03:10 Which has the curious property that no vote matters individually, under any circumstances. 02:03:33 just like real voting 02:03:39 tswett, can a pair of votes matter? 02:03:43 Sgeo: nope. 02:03:52 No finite set of votes matters. 02:04:13 I guess that's easily seeable from no single vote ever mattering 02:04:34 If a finite set mattered, it's possible that that finite set depends on 1 vote... unless the finite set is constrained in what it could look like 02:04:44 i hear bachman is courting the Vitali set's vote, i wonder how that'll work out 02:04:47 I guess that's true. 02:05:44 Like if you have three people, and the bill passes only if those three people all vote for it, but then it also happens that (for some reason) the three voters can't possibly all vote the same way. 02:07:49 Not sure if I prefer REBOL refinements or keyword arguments. (Note that Smalltalk does not count as having keyword arguments) 02:17:20 -!- Bike_ has joined. 02:18:02 Bike_: has anyone used "take a hike, Bike" on you yet 02:18:47 I wish the whole 'so many datatypes that the parser just knows' wasn't considered such a maor selling point. Unless I can easily define my own, I'm not especially interested. 02:18:50 *major 02:19:15 there must be 50 ways to leave your bicycle 02:19:43 i left my bicycle in washington :'( 02:19:46 is Bike my bicycle 02:20:30 -!- Bike has quit (Ping timeout: 264 seconds). 02:22:03 wow what a waste 02:22:04 -!- Bike_ has quit (Ping timeout: 276 seconds). 02:22:08 wow what a waste_ 02:22:33 -!- Phantom_Hoover has quit (Read error: Connection reset by peer). 02:23:05 "Type secure [debug allow] or put it in your rebol.r file. 02:23:05 Type secure none (but don't put it in your rebol.r file.)" 02:23:15 -!- Bike has joined. 02:23:23 Has anyone asked to ride Bike 02:26:44 * Sgeo wants to think through the differences between Factor and a hypothetical post-fixed REBOL 02:27:23 but you can't, because you're ritually forbidden from thinking about computers on wednesdays 02:27:38 Bike: did you even see all the bicycle talk we had here while you were timing out 02:28:40 yes:no 02:28:57 Actually, I don't think there's a difference 02:29:05 elliott: no 02:30:59 Sgeo: when will you stop caring about languages 02:31:14 shachaf, probably when I die. 02:31:31 Or earlier is possible. 02:31:44 i feel that sgeo should become a rebbe 02:32:00 whats a rebbe 02:32:13 hardcore rabbi. 02:45:12 Found an asymmetry: Can't have a function in REBOL return multiple values 02:45:20 I think 02:47:41 tswett, I may have found a use for compose without /only 02:54:10 From a page on REBOL, this is valid code 02:54:11 head insert tail block select list name 02:54:52 :/ that's not really code to show people imo 02:56:16 -!- elieser224 has joined. 02:57:17 -!- elieser224 has left. 02:58:08 it's just a bunch of words 03:01:26 -!- Bike_ has joined. 03:01:53 -!- Bike has quit (Disconnected by services). 03:01:58 -!- Bike_ has changed nick to Bike. 03:03:57 hey elliott weren't you going to set up a bouncer for me or something 03:04:16 no i just wanted to steal your password 03:04:23 god dammit 03:11:15 >> $5 / $1 03:11:15 == $5.0000000000000000000000000 03:11:18 le sigh 03:12:30 floats are the future 03:12:44 * Sgeo was more concerned with the unit mangling 03:13:31 "If I have $5 and see a bunch of $1 items, how many can I buy?" "FIVE DOLLARS!" 03:13:54 I suck at examples 03:16:29 -!- Bike_ has joined. 03:16:54 -!- Bike_ has quit (Client Quit). 03:17:10 -!- Bike_ has joined. 03:17:22 ok so: sgeo does this thing use floats for currency 03:17:39 -!- Bike has quit (Disconnected by services). 03:17:44 -!- Bike_ has changed nick to Bike. 03:17:49 does my connection use floats for currency? MAYBE 03:18:07 yes :( 03:18:09 "The money! datatype uses standard IEEE floating point numbers allowing up to 15 digits of precision including cents." 03:18:10 maybe it uses floats for concurrency 03:18:12 Fuck you REBOL 03:18:25 the money! datatype 03:18:45 All datatype names are suffixed with ! 03:18:56 i wonder what comes next after rebol 03:19:01 so what's the point of money! 03:19:02 doubleplusbol 03:19:04 -!- Bike_ has joined. 03:19:20 hey kmc landed a few minutes ago 03:19:24 welkeegan tosfo 03:19:49 dumbest cant ever 03:19:52 -!- Bike has quit (Disconnected by services). 03:19:53 -!- Bike_ has changed nick to Bike. 03:22:49 Oh hey Rebol3 wasn't upgraded since 2011 03:22:52 :/ 03:30:45 -!- Tritonio has quit (Ping timeout: 248 seconds). 03:31:50 It's possible that the "we're using floating-point for money" thing is obsolete 03:32:12 http://www.rebol.net/wiki/Money 03:32:45 oh man 03:32:49 we totally need a bitcoin-based language 03:32:51 money for scientific applications 03:34:39 "Trembmax, unlike in R2, which you clearly used, in R3 is money! datatype BCD internally." 03:37:07 what does that mean 03:38:12 mnoey! 03:38:21 hi shachaf 03:38:22 hey mnoqy mind if i call you mnoqy! 03:38:30 that's fine 03:38:33 you look like a data type to me 03:38:38 i get that a lot 03:38:47 a data type interpreted as a proposition.......a true proposition 03:39:03 yeah 03:39:11 mnoqy are you inhabited 03:39:19 by demons 03:39:20 who isn't, these days? 03:40:53 mnoqy, binary-coded decimal, according to someone in another channel 03:41:34 kick it like it's 1989 03:41:43 or whenever x86 had that idk. 03:42:03 binary-coded decimal. cute. 03:44:54 -!- sprocklem has joined. 03:48:09 I... don't know what to think of the way apply interacts with refinements 03:48:19 They're simply positional arguments 03:50:23 "A scheme specifies a type of port. Schemes are defined for files, networking, sound, and many other functions. Users can define their own schemes or modify the existing schemes." 03:50:31 So I heard once that accountants and whatnot actually need to use arbitrary-precision arithmetic. 03:50:31 That last sentence makes me happy 03:51:00 mnoqy: Are you happy? 03:51:10 Ok, I misunderstood what schemes are 03:51:27 They're lisp dialects. There's a report for each one. 03:52:10 So if someone has $10,000 in an account with 12% interest compounded monthly, then one year later, the balance on the account must be exactly $11,268.25030131969720661201. 03:52:59 So, Rebol is still a bad idea in finance. 03:53:00 Got it. 03:53:12 i assume they meed computable numbers for continuously compounded interest 03:53:23 all numbers are computable 03:53:28 thx 03:53:36 classicalist scum 03:53:50 THOSE REBOL SCUM 03:53:51 Bike: I think computable numbers are sort of overkill there. 03:54:26 Do they actually use continuous compounding somewhere? 03:56:24 I like how this advocacy section lumps Lisp, Scheme, Haskell, and Caml together, and then proceeds to talk about Lisp 03:56:35 Calculus student loans. 03:56:37 http://www.rebol.net/wiki/Advocacy#Lisp.2C_Scheme.2C_Haskell.2C_Caml 03:57:36 well look at all those other section things though 03:58:07 -!- Bike has quit (Ping timeout: 264 seconds). 03:58:33 like inverses????????? 04:00:30 I feel like I've mostly been mocking REBOL, despite being genuinely interested in it 04:03:25 -!- Bike has joined. 04:03:26 -!- Bike has left. 04:09:25 -!- hagb4rd has quit (Quit: hagb4rd). 04:12:07 Unfair question: 04:12:12 Continue this sequence: 1, 1, 1, 1, 1, 1, 1, 2, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 7, 8, 8, 9, 9, 10, 10, 11, 11, 12, 12, 13, 13, 14, 14, 15, 15, 16, 16, 17, 17, 18, 18, 81, ... 04:12:17 Or, rather, unfair problem. 04:12:24 -2834198237481273409 04:12:34 sdksdkh[pntn/.yj;rslg,. 04:12:34 Nope. It's a strictly increasing sequence. 04:12:43 And all of its elements are integers. 04:13:20 I'm not actually sure that that part of the sequence is correct. Pretty sure, but not completely sure. 04:13:21 ERR COUNTABLY INFINITE NUMBER OF CONTINUATIONS 04:13:29 Uncountably, in fact. 04:13:43 You said integers... oh, I meant for just the next number 04:13:54 * tswett nods. 04:14:01 I'm pretty sure the next number is 81. 04:14:24 Are there more infinite sequences of real numbers than there are real numbers? 04:14:31 Not strictly, strictly speaking. 04:14:31 No. 04:15:34 The numbers after that... probably 256 and 256. Then probably 1024 and 1024. Then probably 4096 and 4096. Then probably 16,384 and 16,384, then probably 78,125 and 78,125. 04:15:42 But I'm getting less and less sure with each number I name. 04:17:28 I could write this sequence as a Haskell function, but that would probably take hours. 04:18:41 I could implement Conway's chained arrow notation in Haskell, and that would only take a couple of minutes. 04:19:25 But this sequence grows faster than any sequence concisely expressible using Conway's notation. Indeed, writing any sequence that grows as quickly as this one would also take me hours. 04:21:36 Is your lack of certainty reflective of your own personal lack of certainty only, or of the lack of certainty of the mathematical community in general? 04:21:54 My personal lack of certainty. The mathematical community could probably figure it out reasonably easily. 04:22:34 Pretty sure this sequence isn't in OEIS. 04:23:00 Yet 04:23:21 -!- comex has quit (Remote host closed the connection). 04:23:24 Anyway: 04:24:14 The nth term is the largest integer that can be written as a Church numeral in the calculus of constructions using at most n+9 symbols. 04:24:14 (http://oeis.org/A182369) 04:26:04 Where a Church numeral is a term of the type forall o : T, (o -> o) -> (o -> o). 04:26:45 oooo 04:27:36 The number 1 can be written in 10 symbols, so the first few terms are just 1. Any number n can be written in 13 + 2n symbols, so it stutters all the way through 18. 04:28:40 The number a^b can always be written using (13 + 2a) + (13 + 2b) + 11 symbols, which explains the following few terms. 04:28:54 -!- Bike has joined. 04:30:36 Presumably, as n increases, the "winning expression" will become nested exponentiation, then tetration, then pentation, then the Ackermann function, then Conway's chains, then variations on those, and eventually something we haven't imagined yet. 04:30:47 It's kind of like a busy beaver. A... colossal coq. 04:31:00 Yeah. It's just the busy beaver sequence for the calculus of constructions. 04:31:00 you talking about me again? 04:31:11 Which, unlike the busy beaver sequence for Turing machines, is computable. 04:31:19 coqumqkin 04:34:08 I guess after a while, it seems likely that the sequence would just use the fast-growing hierarchy directly. 04:35:01 -!- carado has quit (Ping timeout: 240 seconds). 04:36:07 We can probably figure out where the sequence falls on the fast-growing hierarchy. 04:37:27 Perhaps it corresponds to the proof theoretic ordinal of the calculus of constructions. 04:44:58 I have discovered the identity of the biggest pervert in the world 04:45:05 http://csclub.uwaterloo.ca/~scshunt/pervert.png 04:48:57 Man, f_epsilon_0 on the fast-growing hierarchy grows pretty quickly. 04:50:25 Let's just call it fe0. fe0(1) = 2, fe0(2) = 4, and fe0(3) is too large to have an upper bound concisely expressible using Conway chains. 04:51:04 f_epsilon_0? 04:51:07 how is that defined? 04:52:54 -!- DHeadshot has quit (Ping timeout: 264 seconds). 04:54:07 -!- DHeadshot has joined. 04:54:14 http://en.wikipedia.org/wiki/Fast-growing_hierarchy, and see http://en.wikipedia.org/wiki/Large_numbers#Systematically_creating_ever_faster_increasing_sequences for how to evaluate functions up to f_(omega^2). 05:03:12 Huh. Apparently the Esperanto Wikipedia claims that "Lasero" comes from the phrase "Lum-Amplifo per Stimulata Eligo de Radioj". 05:06:54 Language architecture by stealing english rendition 05:09:40 -!- comex has joined. 05:13:06 shachaf: btw you should smlist hth 05:13:17 `smlist 05:13:19 smlist: shachaf monqy elliott mnoqy 05:13:23 mnoqy: Thanks! 05:13:44 Rebol is worse than Tcl in a way: Given a block of Rebol code, you can't tell where one expression ends and the next begins. With Tcl, you can do that much, even if you can't proceed to interpret code blocks inside of that block 05:15:46 which is smlist again? 05:16:09 super mega 05:16:10 lsit 05:18:26 * Sgeo isn't entirely sure why either exists 05:18:30 if/else is equivalent 05:20:10 mnoqy: 22:19 -!- ifeellikeabadperson whenitalkbynicking Nick change too fast. Please wait 20 seconds. 05:20:25 have you tried waiting 20 seconds 05:20:33 mnoqy: no 05:20:39 fuck birsd 05:20:41 where did you get that idea 05:20:52 are you some "kind of computer genius"......... 05:21:01 :☺) 05:23:56 -!- hagb4rd has joined. 05:45:05 -!- zzo38 has quit (Quit: zzo38). 05:52:51 hichaf 05:53:18 -!- sprocklem has quit (Remote host closed the connection). 05:53:37 yogan 05:54:00 kmc: it happened 05:54:41 how did it go 05:54:43 elliott: first pubic hair? 05:54:49 what 05:54:53 hi 05:54:55 thanks hagb4rd 05:55:47 * hagb4rd trolls aside 05:56:24 it's generally considered bad to troll 05:56:59 kmc: welcome to california 05:57:00 you're right. i'm sorry. please go ahead 05:57:04 have you been to a california welcome center yet 05:57:11 thaxchaf 05:57:17 oh you were done 05:57:24 shachaf: that's the building that says "In-n-Out Burger" right 05:57:26 in that case, yes 05:57:41 I suppose I can't argue with that. 05:58:10 Everyone said I should go there, so I went there. But there isn't much point to it when you're vegetarian. 05:58:39 oops 05:58:57 mnoqy: are you expert in "In-n-Out Burger" 05:59:05 i wouldn't call myself an expert 05:59:14 but i know a few techs 05:59:21 expert means you went there in your life ever 05:59:25 or have thought about it 05:59:37 tell me about the techs 05:59:54 if you ask for "animal style" fries they put their goop on it, just like with their burger's 06:00:01 we say 2 experts ~ 3 opinions 06:00:05 hm what other techs are there 06:00:09 locally 06:00:44 mnoqy: teach me 06:00:54 kmc: Are you in SF or MV? 06:01:10 shachaf: that's the tech you just say "animal style" when ordering and that's the magic words 06:01:22 mnoqy: yes i meant teach me other techs 06:01:26 ah 06:01:33 mnoqy.beaky.moed++ 06:01:34 i wonder if you can get an "animal style" shake that'd be hm 06:01:50 that doesn't sound delicious 06:01:53 but what do i know 06:02:12 gosh im having trouble remembering techs 06:02:16 oh i remember a tech 06:02:36 i think if you ask for "grilled cheese" you get bread with cheese on it 06:02:46 i've never done it myself but i have memories of witnessing it 06:02:55 how often do you go 06:03:02 not often at all 06:03:03 are we talking, like, untoasted bread here 06:03:15 it's hamberger bun elliott 06:03:18 oh 06:03:18 im pretty sure they "toast" it 06:03:19 that makes more sense 06:03:28 i was really confused about california for a minute 06:03:41 elliott: we're talking a hamburger with cheese and without the meat 06:04:00 it's just a hamburger bun with cheese and maybe some vegetables 06:04:06 that's what i had 06:04:43 A grassburger is what you can get if you be vegetarian. It's like where you put some freshly-mowed lawn in place of the meat. 06:05:25 are you sure you don't put drugz instead 06:05:34 shachaf: I'm in a hotel in MV 06:05:35 i've seen lots of vegetarian burger alternatives 06:05:46 veggy burger, soy berger 06:05:47 shachaf: in-n-out Animal Style fries are good 06:05:49 as are the shakes 06:05:56 and they will make a 'grilled cheese' which is like a burger minus meat 06:06:11 07:02:36 i think if you ask for "grilled cheese" you get bread with cheese on it 06:06:17 EARLIER 06:06:19 06:59:54 if you ask for "animal style" fries they put their goop on it, just like with their burger's 06:06:23 i got scoop'd 06:06:23 way behind kmc, way behind 06:07:52 scoop'd'd 06:08:24 kscoopd 06:08:40 so how did the interview go 06:09:17 it was "alr" ight 06:09:48 interview? 06:09:55 oh, that interview 06:10:00 yeah it went swimmingly 06:10:06 kmc has some interviews this weekend....... 06:10:08 he even left us a gift 06:10:13 or maybe tomorrow "who knows" 06:11:40 but is it for wsj!! 06:12:14 no its for the csc(CASTRO STREET COMPANIES) 06:13:40 kmc: Were we going to meet in SF on Fri or something like that? 06:14:27 shachaf: sounds good to me 06:14:52 -!- `^_^v has quit (Ping timeout: 256 seconds). 06:19:27 can somebody pick me please explain in few words whats that reporter-interview-wsj thing is about? i somehow missed the kickoff and it seems to keep you all excited these days 06:19:42 *pick me up 06:20:21 link to sth? 06:20:45 shachaf: help how do i prepare for job interview 06:20:53 hagb4rd: http://catseye.tc/wsj.html <- good link 06:21:01 kmc: how about... drugz 06:21:04 (If slightly outdated.) 06:21:04 this answer was personalised to you 06:21:10 thx fizzie 06:21:13 elliott: thx 06:21:23 Was the extent of the personalization that "z"? 06:21:28 elliott: they do say memory is state dependent so maybe if i have some bong hits I will remember some of the CS i learned while stoned 06:21:42 they say memory is state dependent b/c we rely on the govt for everything 06:22:03 kmc: i don't know :'( 06:22:32 kmc: teach me when you find out plz thx 06:22:43 kmc: who are you interview'sin'g with first 06:22:54 elliott: hey that was goin g to be my question 06:26:30 mozilla 06:28:14 -!- comex has changed nick to iamthewolf. 06:31:33 -!- iamthewolf has changed nick to comex. 06:32:29 who s interviewing you 06:32:40 you could blackmail them or kidnap their children/pets 06:32:40 flew into SFO today. got as far as Milbrae station before I smelled someone smoking pot and heard someone use the word "hella" 06:32:43 god bless SF 06:36:20 Sgeo, shachaf: I finished _The Tangled Web_ 06:36:26 good stuff 06:36:32 yay 06:36:34 should i read it 06:36:37 yes!! 06:36:51 two exclamation marks? ok i m in 06:37:36 i like that you can convince the user to manually change the character encoding of a page, which also changes the encoding used for a hidden iframe of an unrelated site, defeating escaping mechanisms on that site 06:37:58 Hah. 06:39:14 kmc: What are your plans on Fri if any? 06:39:55 no plans, you? 06:40:32 Ideally I'll get there sometime before 13:00 and try to do the passport thing. I might also meet $people but I'm not sure. 06:40:54 also there's discussion in that book of a mechanism that's kind of like the NX bit for the web, and a workaround exploit strategy that's like ROP for the web 06:41:11 Which? 06:41:29 some HTTP header that says which URLs can be used for