题目内容
（请给出正确答案）
[主观题]
______A．rear-lengthB．（rear-length+m)mod mC．（1+rear+m-length)mod mD．m-lengthA．B．C．D．
______
A．rear-length
B．(rear-length+m)mod m
C．(1+rear+m-length)mod m
D．m-length
提问人：网友helsun1984
发布时间：2022-01-06
题目内容
（请给出正确答案）
如搜索结果不匹配，请 您可能会需要：
安装简答题APP，拍照搜题省时又省心！
更多“______A．rear-lengthB．（rear-len…”相关的问题
第1题
Turing machine is regarded as the foundation of artificial intelligence.Turing machine is regarded as the foundation of artificial intelligence.
第3题
The Turing machine is an abstract（71)of computer execution and storage introduced in 1936
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.
A．implement
B．pattern
C．tool
D．model
第5题
The Turing test measures the performance of an intelligent machine against that of a human being.（）
第7题
The Turing test measures the performance of an intelligent machine against that of a human being.（）
第8题
What is the purpose of devising Turing Machine？ A．To calculate. B．To make an experiment. C．To sho
What is the purpose of devising Turing Machine？
A．To calculate.
B．To make an experiment.
C．To show that the machine is part of a test.
D．To specify what should be understood by a mechanical process.
第10题
Turing Test is designed to provide what kind of satisfactory operational definition？ 图灵测试旨在给予哪一种令人满意的操作定义
A、machine intelligence 机器智能
B、human intelligence 人工智能
C、machine action 机器动作
D、human action 人类动作
E、human thinking 人类思考
第11题
In 1637 the French mathematician Rene Descartes predicted that it would never be possible
to make a machine that thinks as humans do. In 1950, the British mathematician and computer pioneer Alan Turing declared that one day there would be a machine that could duplicate human intelligence in every way and prove it by passing a specialized test. In this test, a computer and a human hidden from view would be asked random identical questions. If the computer were successful, the questioner would be unable to distinguish the machine from the per son by the answers.
点击查看答案
Inspired by Turing's theory, the first conference on AI convened at Dartmouth College in New Hampshire in 1956. Soon afterwards and Al laboratory was started at Massachusetts Institute of Technology by John McCarthy and Marvin Minsky, two of the nation's leading Al proponents. McCarthy also invented the Al computer language, Lisp; but by the early 1990s Al itself had not been achieved. However, logic programs called expert systems allow computers to "make decisions" by interpreting data and selecting from among alternatives. Technicians can run programs used in complex medical diagnosis, language translation, mineral exploration, and even computer design.
Machinery can outperform. humans physically. So, too, can computers outperform. mental functions in limited areas--notably in the speed of mathematical calculations. For example, the fastest computers developed are able to perform. roughly 10 billion calculations per second. But making more powerful computers will probably not be the way to create a machine capable of passing the Turing test. Computer programs operate according to set procedures, or logic steps, called algorithms. In addition, most computers do serial processing; operations of recognition and computation are performed one at a time. The brain works in a manner called parallel processing, performing operations simultaneously. To achieve simulated parallel processing, some supercomputers have been made with multiple processors to follow several algorithms at the same time.
Critics of the approach insist that solving a computation does not indicate understanding, something a person who solved a problem would have. Human reasoning is not based solely on rules of logic, It involves perception, awareness, emotional preferences, values, evaluation experience, the ability to generalize and weigh options, and more. Some proponents of Al have, therefore, suggested that computers should be patterned after the human brain, which essentially consists of a network of nerve cells.
By the early 1990s, the closest approximation to Al was a special silicon chip built to behave like a human brain cell. It was modeled after the internal working of neurons in the human cerebral context. Unlike the conventional sillicon chip, which works in digital mode, the new silicon chip works in analog mode, much the way human brain cell works.
According to Turing, a computer can prove to have human-like intelligence in a special test if______.
A．the computer gives better answers
B．the questioner fails to give identical questions
C．the questioner can't tell between the answers of a person and a computer
D．the questioner can't find the person hidden by the computer
