|
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 a ....
Word count: 443 - Page count: 2
|
|
GotPapers has one of the largest term paper databases online. Join today to view this essay and over 45000 other essays in our members' only section.
Your subsription is activated immediately after payment, which is perfect for those times when you are up late working on an important
paper that is due tomorrow.
| Membership Option |
Price |
PayPal |
| 30 days (recurring) |
$19.95 |
| 90 days (recurring) |
$39.95 |
| 180 days (non-recurring) |
$69.95 |
|
|
|
NAVIGATE
