In this essay we’ll prove Gödel’s incompleteness theorems twice. First, we’ll prove them the good old-fashioned way. Then we’ll repeat the feat in the setting of computation. In the process we’ll discover that Gödel’s work, rightly viewed, needs to be split into two parts: the transport of computation into the arena of arithmetic on the one hand and the actual incompleteness theorems on the other. After we’re done there will be cake.
SOberhoff/incompleteness_ex_machina
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
Folders and files
Name | Name | Last commit message | Last commit date | |
---|---|---|---|---|
Repository files navigation
About
No description, website, or topics provided.
Resources
Stars
Watchers
Forks
Packages 0
No packages published