in reply to perl not omnipotent? let's see!

If it is computable then any Turing complete language can compute it. Ook! is Turing Complete (appart from issues of memory size) and I can write an Ook! interpreter in Perl thus Perl (by using the Ook! interpreter) can compute anything computable.

Perl is Huffman encoded by design.

Replies are listed 'Best First'.
Re^2: perl not omnipotent? let's see!
by spiritway (Vicar) on Oct 13, 2005 at 05:07 UTC
    If it is computable then any Turing complete language can compute it.

    ++ to you, GrandFather - when all is said and done, they can all do essentially the same thing. The choice is a matter of practical considerations.

[reply]
    A reply falls below the community's threshold of quality. You may see it by logging in.

In Section Seekers of Perl Wisdom