搜题请搜索小程序“爱下问搜题”
问题 单项选择题

女性，26岁，10天来全身皮肤出血点伴牙龈出血来诊，化验PLT 35×109/L，临床诊断为慢性特发性血小板减少性紫癜 (ITP)。

下列支持ITP诊断的实验室检查是

A．凝血时间延长，凝血酶原时间延长

B．血块收缩良好，血小板功能正常

C．抗核抗体阳性，免疫球蛋白增高

D．骨髓巨核细胞增多，产板型增多

E．骨髓巨核细胞增多，幼稚、颗粒型增多

答案

参考答案：E

单项选择题

采取印模时作主动肌功能修整的方法是在印模末凝固之前（）

A.轻轻拉上唇向上内数次

B.轻轻拉下唇向上内数次

C.轻轻拉颊部向前下内、下颊部向前上内数次

D.嘱患者相继发出"喔"、"嘿"等音

E.以上均不对
查看答案
单项选择题

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.

（74）处填（）。

A．fixed

B．steady

C．variational

D．changeable
查看答案