Beefy Boxes and Bandwidth Generously Provided by pair Networks
Pathologically Eclectic Rubbish Lister
 
PerlMonks  

The road to wisdom (a grook)

by osfameron (Hermit)
on Aug 07, 2000 at 13:24 UTC ( [id://26525]=poem: print w/replies, xml ) Need Help??

Another grook...

Note that this goes beyone the realms of poetry and into a new, and highly interesting mathematical discovery:
the constant .969696 recurring is the largest possible number which can be 'erred less' for the road to wisdom to be attained.
I think that this has far-reaching consequences for Perl, or possibly for the whole history of human endeavour.

Should I post this to the Seekers of Perl Wisdom section too? <grin>

$the_road_to_wisdom = <<GROOK; THE ROAD TO WISDOM by Piet Hein (in Grooks, 1966) translated into Perl by Osfameron (hakim\@earthling.net) v 1.1 The road to wisdom? - Well, it's plain and simple to express: Err and err and err again but less and less and less. GROOK my $error = ord("lots"); use constant less => .9696969696; # # # $to_express {$the_road_to_wisdom} ? Well : ($it = "plain" and "simple"); do { err () and err () and err (again); but: err (less) and err (less) and err (less); } # # # until $on_road_to_wisdom; print $the_road_to_wisdom; sub err { ($err = shift) && ($error *= $err) || ($error++); $on_road_to_wisdom++ if $error < ord (" less"); }
cheerio!
Osfameron

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: poem [id://26525]
Approved by root
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others exploiting the Monastery: (4)
As of 2024-03-29 10:28 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found