Yes. These things include:

• Solving the Halting Problem
• Parsing natural languages (yet)
• Solving the Napsack Problem in polynomial-order time (or can it??? :-D )

I mean, come on... Perl is Turing Complete (standard boilerplate regarding assumptions about sufficient storage room, as Turing Machines, technically, have unlimitted memory), and thus can do anything that a Turing Machine is capable of. Every other programming language that currently exists (bearing in mind that there aren't any programming languages yet developed for quantum computers, which could, possibly be something beyond a Deterministic Turing Machine) is no more capable than a Turing Machine. Therefore, I can safely state that there is nothing which Perl "simply cannot do", but which other programming languages can do.

To paraphrase: Perl can do anything that can be done on a computer, and no programming language can make a computer do more than a computer is capable of doing.

Of course, you could have been trying to use hyperbole, or being figurative...