图灵完全 meaning in English
turing completeness
Examples
- 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
这些语言不必是图灵完全的（如果它具有与通用图灵机等同的计算能力换句话说，系统和通用图灵机可以相互模拟） 。