Turing test nothing of the real world." With these techniques, Weizenbaum's program was able to fool some people into believing that they were talking to a real person, with some subjects being "very hard to convince that ELIZA [...] is "not" human." Thus, ELIZA is claimed by some to be one of the programs (perhaps the first) able to pass the Turing test, even though this view is highly contentious (see below). Kenneth Colby created PARRY in 1972, a program described as "ELIZA with attitude". It attempted to model the behaviour of a paranoid schizophrenic, using a similar (if more advanced) approach
Non-deterministic Turing machine Non-deterministic Turing machine In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers. In essence, a Turing machine is imagined to be a simple computer that reads and writes symbols one at a time on an endless tape by strictly following a set of rules. It determines what action it should perform next according to its internal "state" and "what symbol it currently sees". An example of one of a Turing Machine's rules might thus be: "If you are in state 2 and you see