Date: Sun, 2 Nov 2003 10:28:43 +0800 From: Greg Lehey <grog@FreeBSD.org> To: Terry Lambert <tlambert2@mindspring.com> Cc: Bill Moran <wmoran@potentialtech.com> Subject: Re: How do hackers drive? Message-ID: <20031102022843.GB3275@adelaide.lemis.com> In-Reply-To: <3FA423B7.D4F10C29@mindspring.com> References: <20031031190847.GA13529@online.fr> <3FA423B7.D4F10C29@mindspring.com>
next in thread | previous in thread | raw e-mail | index | archive | help
On Saturday, 1 November 2003 at 13:20:55 -0800, Terry Lambert wrote: > Rahul Siddharthan wrote: >> I do plan out my trips, including short walks to the water fountain. >> But I probably don't calculate in detail: I tend to take the nearest >> turn each way, so in a situation like this >> >> --------W-- >> | | >> | | >> | | >> --O-------- >> >> to go from office (O) to water (W) and back, I do a clockwise circuit >> rather than judge which route is shorter and retrace the same route >> back > > That's totally insane!!!! > > How do you retract the invisible string that you leave behind > you everywhere you go, if you don't use an exact reverse route?!?! > > You do know you have a limited supply of invisible string on a > spool inside of you, and once you run out of string, you simply > fall over dead, apparently of natural causes, right??? Never heard of garbage collection? Greg -- Finger grog@lemis.com for PGP public key See complete headers for address and phone numbers
Want to link to this message? Use this URL: <https://mail-archive.FreeBSD.org/cgi/mid.cgi?20031102022843.GB3275>