PerlHP (20)

5 Name: !WAHa.06x36 2005-01-24 08:15 ID:FSaFQcCv (Replies) [Del]

Well, in theory, any Turing-complete language can emulate any other. This ignores constraints on memory, time and the ability to interface with the outside of the program, though.

Name: Link:
Leave these fields empty (spam trap):
More options...
Verification: