Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re: The shortest distance between my keyboard and the Monastery is:

by Anonymous Monk
on Aug 04, 2005 at 23:16 UTC ( #481040=note: print w/ replies, xml ) Need Help??


in reply to The shortest distance between my keyboard and the Monastery is:

Zeno's paradox becomes all the more perplexing in the world of Perl. The infinite number of infinitesimally small distances converges to 1. (I used the ratio test to figure that out. I couldn't use the root test too effectively since there weren't any exponents involved.) So I voted for that, and so far I'm with the majority. A quantum leap makes some sense, but I don't know the wavefunction of Perl, let alone its Hamiltonian. The product of the position and momentum changes when I click on this site happens to be MUCH larger than h-bar. Maybe Perl exists in infinite-dimensional Hilbert space... I'd add something about that to our voting options. Or better yet, the shortest distance might only be found by using the Kronecker delta. -100104


Comment on Re: The shortest distance between my keyboard and the Monastery is:

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://481040]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (4)
As of 2015-07-05 04:00 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (60 votes), past polls