首页 新闻 赞助 找找看

怎么证明一个编程语言是图灵完全的

0
[待解决问题]

如题,例如c#是,c++ template是,c++是.xml不是,这些是怎么证明的.

geniushuai的主页 geniushuai | 初学一级 | 园豆:145
提问于:2011-04-12 14:42
< >
分享
所有回答(1)
0

http://c2.com/cgi/wiki?TuringComplete

Typically, one proves a given language is Turing-complete by providing a recipe for translating any given Turing machine program into an equivalent program in the language in question. Alternately, one can provide a translation scheme from another language, one that has already been proven to be Turing-complete.

Jerry Chou | 园豆:2642 (老鸟四级) | 2011-04-12 15:44
清除回答草稿
   您需要登录以后才能回答,未注册用户请先注册