When your language is nowhere near turing - complete , syntactic sugar can be your friend 当你的语言没有严谨到接近图灵完整性的时候,最好采用平易的语法。
This means that given sufficient memory , xslt can calculate anything any other turing - complete language such as c can calculate 也就是说,如果有足够的内存,那么xslt可以完成其他任何图灵完成语言(如c + + )所能完成的计算。
And rexx is certainly turing - complete , enables modules and structured programming , and has libraries for tasks such as gui interfaces , network programming , and database access 并且, rexx当然是完全turing的,支持模块和结构化编程,有面向专门任务的库,例如gui接口、网络编程和数据库访问。
These languages are not necessarily turing - complete if it has a computational power equivalent to a universal turing machine - in other words , the system and the universal turing machine can emulate each other 这些语言不必是图灵完全的(如果它具有与通用图灵机等同的计算能力换句话说,系统和通用图灵机可以相互模拟) 。