Godel’ Theorem and Reasoning

From: yu270011@yorku.ca
Date: Wed Dec 08 2004 - 14:28:43 EST

  • Next message: yu254631@yorku.ca: "Discussion 3"

    Any artificial intelligence will be bounded by its programmed system, which is
    bounded by Godel’s Incompleteness Theorem that states it is impossible to
    conceive of an axiomatic system that is true in every case.

    Also, Penrose explains in “Continuation of Truth, Proof, and Insight” that no
    formal system will ever be able to describe all true events. This is the basic
    formulation of Godel’s Incompleteness Theorem, which has disastrous
    implications for artificial intelligence theory.

    However, researchers, scholars, philosophers, computer scientists, science
    fiction writers, and a host of others have attempted to qualify whether or not
    artificial intelligence could exist in the same fashion as does the human
    mind.

    Thank You!
    Studnet Name: Wang, Yu-Pei
    Student Number: 204914362
    ___________________________________________________________________
    This message was sent to the math3500 discussion list by yu270011@yorku.ca .



    This archive was generated by hypermail 2b30 : Wed Dec 08 2004 - 14:28:49 EST