Press Release 1

 Home Feedback Contents Search  
















Is strong AI in danger?

Recent research indicates that the Platonist Philosophy underlying current thought, which provides the basis for strong AI, may be founded on quicksand.

Mumbai 9th April 2001 -- In a novel experiment, Alix_Comsi Associates publishing division has released on the Internet, for public pre-viewing, chapters from their forthcoming electronic book 'Re-visiting Gdel's Proof of Undecidability'.

This recently completed research (definitely not for the faint-hearted) brings to light a hidden meta-assumption implicitly accepted by philosophers, mathematicians and logicians for the last 60 years in an arcane area of mathematical logic.

This meta-assumtion allows the famous 2000-year old 'Liar' paradox, loosely ascribed to the Greek Epimenides, to be constructed in all currently accepted formal systems of Arithmetic.

(The paradox : If we define the 'Liar' sentence as 'The 'Liar' sentence is a lie', then is the 'Liar' sentence true or false?)

According to experts, formal systems of Arithmetic are basic to our understanding of the way we use language to communicate precisely in the digital world of computers. This result thus has the potential to radically influence, and alter, our ways of thought at a fundamental level.

The current work indicates that some of the ways in which we define infinite, never-ending processes in Arithmetic, technically termed recursive definitions, cannot be completely translated into any computer code.

This appears to attack the basis of strong Artificial Intelligence efforts, which are based on the premise that such infinite definitions can always be mechanically coded.

This belief stems from the profoundly influential work of the Austrian mathematician and logician, Kurt Gdel, whose reasoning was strongly influenced by Plato's philosophy.

Gdel startled the scientific community in 1931 by constructing Arithmetical relations that were indisputably true, but which he reasoned could never be proven true by any of the possible processes of reasoning allowed in Arithmetic.

Although Gdel's Theorems were developed in the rather unfamiliar area of mathematical logic, the philosophical implications and influence of Gdel's work and thought have been increasingly felt in entirely un-related disciplines over the years.

The significance and impact of Gdel's reasoning was made familiar to a wider public in 1982 by the best-selling book 'G