passage ... famous test—and showed how... is broken by will oremus
18 whether machines could actually think, turing believed, was a question oo meaningless to deserve discussion.\ nonetheless, the uring test\ became a benchmark for machine intelligence. over the decades, various computer programs vied to pass it using cheap conversational tricks, with some success.
19 in recent years, wealthy tech firms including google, facebook and openai have developed a new class of computer programs known as \large language models,\ with conversational capabilities far beyond the rudimentary chatbots of yore. one of those models—google’s lamda—has convinced google engineer blake lemoine that it is not only intelligent but conscious and sentient.
20 if lemoine was taken in by lamda’s lifelike responses, it seems plausible that many other people with far less understanding of artificial...
17 hossain, syed \over the decades, various computer programs vied to pass it using cheap conversational tricks, with some success.\ (paragraph 18) which sentence from passage 1 provides evidence that supports this claim?
a “turing debuted his game idea in a 1950 paper in the journal mind.” (paragraph 3)
b “a computer passes the test if it can convince people that it’s a human 30 percent of the times it plays the game.” (paragraph 9)
c “to seem more human, they instead try to make mistakes—like spelling or math errors.” (paragraph 12)
d “researchers train these computer programs to use language by feeding them enormous amounts of data.” (paragraph 13)

Question

passage ... famous test—and showed how... is broken by will oremus
18  whether machines could actually think, turing believed, was a question 	oo meaningless to deserve discussion.\ nonetheless, the 	uring test\ became a benchmark for machine intelligence. over the decades, various computer programs vied to pass it using cheap conversational tricks, with some success.
19  in recent years, wealthy tech firms including google, facebook and openai have developed a new class of computer programs known as \large language models,\ with conversational capabilities far beyond the rudimentary chatbots of yore. one of those models—google’s lamda—has convinced google engineer blake lemoine that it is not only intelligent but conscious and sentient.
20  if lemoine was taken in by lamda’s lifelike responses, it seems plausible that many other people with far less understanding of artificial...
17 hossain, syed \over the decades, various computer programs vied to pass it using cheap conversational tricks, with some success.\ (paragraph 18) which sentence from passage 1 provides evidence that supports this claim?
a “turing debuted his game idea in a 1950 paper in the journal mind.” (paragraph 3)
b “a computer passes the test if it can convince people that it’s a human 30 percent of the times it plays the game.” (paragraph 9)
c “to seem more human, they instead try to make mistakes—like spelling or math errors.” (paragraph 12)
d “researchers train these computer programs to use language by feeding them enormous amounts of data.” (paragraph 13)

Accepted Answer

# Brief Explanations:
To solve this, we analyze each option:
- Option A: Talks about Turing debuting his idea, not about programs using conversational tricks. Eliminate.
- Option B: Defines the Turing test passing criteria, not about tricks. Eliminate.
- Option C: Mentions programs making mistakes (like spelling/math errors) to seem human, which are "cheap conversational tricks" to pass the test. This supports the claim.
- Option D: Discusses training programs with data, not about tricks to pass the test. Eliminate.

# Answer:
C. "To seem more human, they instead try to make mistakes—like spelling or math errors." (paragraph 12)

Sovi.AI - AI Math Tutor

QUESTION IMAGE

Question

Explanation:

Answer: