>>11
>>7
Just because some languages are Turing-complete doesn't mean that what language you use to program is irrelevant. Look up what a Turing-tarpit is.
>>11
Actually, all you have to do to prove Turing-completeness is to impelement a rudimentary Turing-machine-simulator.