问题 选择题

下列各句中,标点符号使用正确的一项是                          (  )

A.庄子永远有着我们不懂的地方,山重水复,柳暗花明;永远有着我们不曾涉及的境界,仰之弥高,钻之弥坚。

B.我不知道,在“五一”这个劳动者的神圣节日里,农民工兄弟当中到底能够有多少人享受到法律赋予他们的休息权?

C.《史记·匈奴传》有如此记载:太初四年“汉使光禄徐自为出五原塞数百里,远者千余里,筑城障列亭,至庐朐。”

D.他读的哲学书籍大约有两类:第一类是马克思主义原著,第二类是中外哲学史家的著作。(包括介绍他们哲学思想的读物)

答案

答案:A

题目分析: B项非疑问句,问号应改为句号。C项句末句号应移到引号外。D项括号应移到句号前。

单项选择题
单项选择题

The Turing machine is an abstract (71) of computer execution and storage introduced in 1936 by Alan Turing to give a mathematically precise definition of (72) . or ’mechanical procedure’. As such it is still widely used in theoretical computer science, especially in (73) theory and the theory of computation. The thesis that states that Turing machines indeed capture the informal notion of effective or mechanical method in logic and mathematics is known as Turing’s thesis.

Every Turing machine computes a certain (74) partial function over the strings over its alphabet. In that sense it behaves like a computer with a fixed program. However, as Alan luring already described, we can encode the action table of every Turing machine in a string. Thus we might try to construct a Turing machine that expects on its tape a string describing an action table followed by a string describing the input tape, and then computes the tape that the encoded Turing machine would have computed. As Turing showed, such a luring machine is indeed possible and since it is able to simulate any other Turing machine it is called a (75) Turing machine.

A universal Turing machine is Turing complete. It can calculate any recursive function, decide any recursive language, and accept any recursively enumerable language. According to the Church-Turing thesis, the problems solvable by a universal Turing machine are exactly those problems solvable by an algorithm or an effective method of computation, for any reasonable definition of those terms.

(71)处填()。

A.implement

B.pattern

C.tool

D.model