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
Turing completeness one instruction set computer) and the ability to change an arbitrary amount of memory ("e.g.", the ability to maintain an arbitrary number of data items). Of course, no physical system can have infinite memory; but if the limitation of finite memory is ignored, most programming languages are otherwise Turing complete. In colloquial usage, the terms "Turing complete" or "Turing equivalent" are used to mean that any real-world general-purpose computer or computer language can approximately simulate the computational aspects of any other real-world general-purpose computer or computer language. Real computers constructed so far can be functionally analyzed like a single-tape Turing