omnis, I usually like to tell people ahead of time because I am a coward about having to deal with it in person, but then again I never really dated before TCG, and with him I let my friend that set us up tell him before we met.

Omnis, fwiw, I would tell her directly pre-date, because if she is the type of person to cut and run for that reason, I would want to know before I showed up.

You could send her one of those pictures, in which you are very cute.

I'm for telling in advance, too.

Even the nicest person may be thrown by new information that they would have to process on top of the normal in-person-meeting jitters.

javachick: omnis_audis "Spikes Bitches 39: Cuppa Tea, Cuppa Tea, Almost Got Shagged, Cuppa Tea..." Feb 15, 2008 1:39:43 pm PST

omnis, I think you have to do what makes you comfortable. Just as you are not AllAboutTheSticks, it's unlikely she is AllAboutTheHiking. Both of you have found something else interesting to recommend yourselves to the other, so you'll talk about those things.

My DH, for instance, plays way too much Ultimate Frisbee. I can't stand it and avoid the Frisbee fields, his tournaments, and his team members. But I enjoy talking to him about how he played, wins, loses, how he felt, what he saw, etc., because his life is interesting to me even if Frisbee isn't. I hope I'm making some sense here, but the point I'm making is that even if hiking is a large part of her life, there would be ways to stay in step with her without taking all those hikes with her.

Meanwhile, my puppy is sleeping blissfully in front of the radiator, having had a most wonderful visit with bonny and Bart this morning. bonny is a wonderful hostess and Bartleby, like the gentledog that he is, shared all his toys.

and Bartleby, like the gentledog that he is, shared all his toys.

Heh. She should maybe never have a playdate with Toto. He's a little overprotective of his toys. And, he also kind of assumes that any dog toy is his. Poor Rachie doesn't "own" any toys when Toto is visiting. Fortunately, Rachie doesn't seem to mind much...unless it's a precious bone.

Hil, what's the solution to that one, using that menu?

Not sure. The point is that it's an NP-complete problem.

Uh, I don't know what an NP-complete problem is. So I guess I missed the point. I was just taking it literally, that it was a math-y scenario that could be solved.

An NP-complete problem is a problem for which there's no known polynomial-time algorithm to solve it. (Simplifying a bit here, partially because the last time I really looked at this stuff was about a year ago, and I don't remember all of it.) A problem that can be solved in polynomial time would be something where, if there are n variables, then the problem can be solved in n^x steps, for some fixed value of x. If a problem is NP-complete, on the other hand, the number of steps required increases more quickly than that. The classic example of an NP-complete problem is the traveling salesman problem: you've got a bunch of cities, and you know the distances between each pair of them, and you want to figure out how to travel to all the cities while going the shortest distance. The brute-force way to solve it is to just look at all the possible orders you can travel the cites, calculate the distances for each one, and check which one is the smallest distance. That makes n! different paths to check if there are n cities, which is more than polynomial time. There isn't a known way to improve significantly on that to get it down to polynomial time.

(Sorry, this is kind of sketchy. I thought I understood this stuff, then a class I took last year convinced me I didn't understand it and taught me what all of this actually meant, which was way more complicated than I'd originally thought, and I've forgotten a bunch of it since then.)

Ah, that's what I thought....

The comic did mention the "traveling salesman" problem, right?

The comic did mention the "traveling salesman" problem, right?

Yep, when the waiter has to get away to get to all the other tables. In the shortest possible amount of time.