computationally universal/Turing complete

英文computationally universal/Turing complete

中文 (征集中)

英文释义

Turing complete is a term given to a system that is able to recognize or decide specific other data-manipulation rule sets (the ones used by Turing Machines); Turing complete is a label used to express the power of such a data-manipulation rule set; the large majority of modern programming languages are Turing complete

中文释义

(征集中)

词条来源 网络

Entries个相关