in reply to Re: perl not omnipotent? let's see!
in thread perl not omnipotent? let's see!
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.
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
| A reply falls below the community's threshold of quality. You may see it by logging in. |