rusi <rustompmody at gmail.com> writes: > Propositionally: All languages are equal -- Turing complete As an aside, not all languages are Turing complete. For example Charity is a language with the property that programs are guaranteed to terminate. <http://en.wikipedia.org/wiki/Charity_(programming_language)>