The first area is represented by the " halting problem " in computer science 第一个领域的代表是计算机科学中的“停机问题” 。
It turns out that proving programs correct is equivalent to solving the halting problem 证明程序是正确的等价于解决停机问题。
Alan turing proved in 1936 that a general algorithm to solve the halting problem for all possible inputs cannot exist Alan turing在1936年证明了对所有可能输入解决停机问题的通用算法是不存在的。
From a theoretical point of view , the separation of data and code in von neumann machines is equivalent to the halting problem ; hence , a complete static translation is not possible 从理论上说,分离von neumann上的数据和代码就好象停机问题,因此完全的静态翻译是不可能的。
停机: halt; closing down; machine ...问题: question; problem框图模式停机问题: halting problem of flowchart schema图灵机停机问题: halting problem of turing machine计算机问题: computerproblem人机问题: man-machine problem随机问题: stochastic problem人机问题求解: man machine problem solving线性界限自动机问题: lba problem停机: [自动化] halt; closing down; machine halt; stop calculation内罗毕二委员会大湖区危机问题首脑会议: summit of the nairobi ii committee on the crisis in the great lakes region飞机问答机: rooster开机问候语: welcome note联机问答系统: on-line question and answer system调停机: arbiter全停机: dead halt停机,中止: halt停机场: aprk; hardstand; lapangan parkir pesawat停机的: idle停机点: break point停机阀: shutdown valve停机钩: arrester hook; arresting hook停机号: halt number停机痕: machine stomark; stomark停机键: break key; off switch; stop key