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.
In reply to Re^2: perl not omnipotent? let's see!
by spiritway
in thread perl not omnipotent? let's see!
by Moron
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |