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 rules to get answers. Thus projecting the gap between humans and computers because computers are unable to make adjustments to logic as a human brain can. It is also thoug....

Number Of Pages: 2

Number Of Words: 463

Got a term paper due soon and need some help quick? You have come to the right place. Essay Galaxy has over 50,000 essays, papers, and reports available for download right now! Get ideas from thousands students just like you to help make that essay perfect. Don't hesitate. Join today and get instant access to our enormous database.

Membership Options Price Savings   1 month subscription    $19.95 recurring * 3 months subscription    $39.95 recurring $19.90 6 months subscription    $69.95 non-recurring $49.75