in reply to Re^2: perl not omnipotent? let's see!
in thread perl not omnipotent? let's see!
Some of the replies have already cited examples which suffice to show that just because something is computable doesn't mean it's feasible, for a given Turing-complete language.
-M
Free your mind
In Section
Seekers of Perl Wisdom