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 certain set of predefined ....

Words In Essay: 463 Approximate Pages: 2

You are just minutes away from instant access to viewing this paper along with over 35,000 other essays and term papers. What are you waiting for? That paper isn't going to write itself. Join today and get a ton of help with that paper! Membership Options Price Recurring 1 month  subscription $17.95 Y 3 months subscription $34.95 Y 6 months subscription $59.95 N