Questions tagged [turing-test]
14 questions
18
votes
4 answers
Did 'Eugene Goostman' really pass the Turing test?
It is being said that 'Eugene Goostman', a computer programme developed to simulate a 13-year-old boy, managed to convince 33 per cent of the judges that it was human, and thus passed the Turing Test.
The computer programme, aka a chatbot, was…
Online User
- 285
- 4
- 10
17
votes
3 answers
Does the Turing test have anything to do with Turing completeness or Turing machines?
I am studying Turing machines and Turing completeness and just remembered I saw something called the Turing test. It seems that the Turing test (from Wikipedia)
is a test of a machine's ability to exhibit intelligent behavior
equivalent to, or…
Hang Chen
- 335
- 2
- 6
5
votes
2 answers
How is a Turing Test defined?
Turing Test definition taken from wikipedia:
The Turing test is a test of a machine's ability to exhibit
intelligent behavior equivalent to, or indistinguishable from, that of
a human. In the original illustrative example, a human judge…
John Demetriou
- 413
- 5
- 14
2
votes
2 answers
What is Turing's main argument in "Computing Machinery and Intelligence"?
I read Alan Turing's paper "Computing Machinery and Intelligence" a few times and it isn't clear what exactly is he arguing for. He proposes the imitation game, but doesn't form a concrete conclusion.
It seems like the current consensus is that…
Leo Jiang
- 161
- 1
- 4
2
votes
0 answers
what is the best practice for turing test
I'm working on a AI project which generates poems in Turkish language like this project: https://github.com/schollz/poetry-generator
It's a successful project but it's a template based poem generator. You can't select a topic for poem generation. It…
zamalek7
- 21
- 1
2
votes
1 answer
How can I do a subtraction with a two tape Turing machine
I have already made a Turing machine with just one tape that solves a subtraction between two numbers, but I trying to do the same but with TWO tapes.
As an example, how can I solve 4-2?
Taking account that 4 can be represented as 0000, 2 as 00 and…
1
vote
2 answers
Can you have simple unit tests for complicated function?
Can you have simple unit tests for complicated function?
For example: Turing test for AI.
Do you always can find simple unit tests for any complicated enough function / algorithm?
Oleg Dats
- 329
- 1
- 7
0
votes
1 answer
How "meaningful" is Turing test? Are there better measures?
How "meaningful" is Turing test?
Because even though it's sometimes presented as a "scientific" way of classifying the goodness of AI, I do view it as a sort of naive, left-handed way for defining or measuring computer intelligence.
Because there…
mavavilj
- 579
- 7
- 23
0
votes
1 answer
Status questionis for whether a machine can or can't "think"
In his paper Computer Machinery and Intelligence, Turing addresses some arguments against the ability of a computer to pass the Turing test, such as the Theological Argument, the Mathematical Objection and the Argument from Consciousness. I wonder…
wox
- 15
- 3
0
votes
1 answer
Turing tests and humans
How are the questions framed in Turing tests? I mean what factors would one consider before framing questionnaire for the Turing Test.How the questions should be framed to make the test unbiased for a machine and humans?
Sharat Ainapur
- 65
- 1
- 1
- 6
0
votes
0 answers
How simple addition operation performed with just one instruction by BitBitJump?
According this:
https://en.m.wikipedia.org/wiki/One-instruction_set_computer
Its instruction has 3 operands, the meaning is: copy the bit addressed by a to the bit addressed by b and jump to the address c.
So, how do addition works by only one…
Muhammad Ikhwan Perwira
- 560
- 4
- 15
0
votes
1 answer
What does "satisfactory definition" mean?
I am reading the book Artificial Intelligence (A modern approach) by Stuart Russell and Peter Norvig. While reading the book, I saw the below sentence in the book.
The Turing Test, proposed by Alan Turing (1950), was designed to provide a…
mmafshari
- 15
- 3
-1
votes
2 answers
How do we say there is A Turing machine when it does not halt
Generally we will say there is A DFA for a language if we give a string to that DFA and after processing it it will reach to DFA and DFA more or less stops at final state,so then we say there is a DFA, and if that string does not reach final state…
cnu
- 1
- 1
-1
votes
1 answer
Determine if the following problem is decidable or not : Does the read–write head of a TM with the input w leave the word w?
Determine if the following problem is decidable or not : Does the read–write head of a TM with the given input w leave the word w on the tape?
Frank
- 147
- 7