The Turing Test and the Frame Problem AI

Both the Turing test and the frame problem have been significant items of discussion since the 1970s in the philosophy of artificial intelligence (AI) and the philisophy of mind. However, there has been little effort during that time to distill how the frame problem bears on the Turing test. If it proves not to be solvable, then not only will the test not be passed, but it will call into question the assumption of classical AI that intelligence is the manipluation of formal constituens under the control of a program. This text explains why there has been less progress in artificial intelligence research than AI proponents would have believed in the mid-1970s. As a first pass, the difficulty of the frame problem would account for some of the lack of progress. An alternative interpretation is that the research paradigm itself is destined to be less productive than might have been hoped. In general termns, the view advanced here is that the future of AI depends on whether the frame problem eventually falls to computational techniques. If it turns out that the frame problem is computationally irreducible, of there is no way to solve it computationally by means of a program operating on formally defined constituents, then an increasing number of experts in the field will reach the conclusion that AI embodies a fundamental misunderstanding of intelligence.