Kurt Godel's Theory Of Unprovable Statements In 1931, logician Kurt Godel developed a proof. It stated that to prove every conceivable statement about numbers within a system by going outside the system in order to come up with new rules and axioms...by doing so you’ll only create a larger system with its own unprovable statements. Godel’s results also imply that arithmetic can never be fully axiomized. The proof has also help to demonstrate the gap between humans and computers. Computers can only be programmed so many things. Mostly all computers have to go through a certai....

Number Of Words: 463

Number Of Pages: 2

Join today and get unlimited access to our vast database of student-written essays and term papers. This paper along with over 45,000 other papers are available in our member's area right now. Full instant access is just seconds away! Membership Options Price 1 month  subscription $18.95 recurring        3 months subscription $34.95 recurring        6 months subscription $59.95 non-recurring