Turing test identification" by correctly identifying the machine as being just that. If however a machine remains silent during a conversation, i.e. takes the fifth, then it is not possible for an interrogator to accurately identify the machine other than by means of a calculated guess. Even taking into account a parallel/hidden human as part of the test may not help the situation as humans can often be misidentified as being a machine. Mainstream AI researchers argue that trying to pass the Turing test is merely a distraction from more fruitful research. Indeed, the Turing test is not an active focus of
Turing machine for which the action table has at most one entry for each combination of symbol and state. Read-only, right-moving Turing machines are equivalent to NDFAs (as well as DFAs by conversion using the NDFA to DFA conversion algorithm). For practical and didactical intentions the equivalent register machine can be used as a usual assembly programming language. An interesting question is whether the computation model represented by concrete programming languages is Turing equivalent. While the computation of a real computer is based on finite states and thus not capable to simulate a Turing machine, programming languages themselves do not necessarily have