/explore
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
jeremykun.wordpress.com
We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... |
|
| | | | | ||
| | | | |
m-phi.blogspot.com
The recent discussion of Edward Nelson's claim to have a found a proof that Peano arithmetic, $PA$, is inconsistent has been very interestin... |
|
| | | | | ||
| | | | |
xorshammer.com
Let $latex \mathrm{PA}$ be Peano Arithmetic. Gödel's Second Incompleteness Theorem says that no consistent theory $latex T$ extending $latex \mathrm{PA}$ can prove its own consistency. (I'll write $latex \mathrm{Con}(T)$ for the statement asserting $latex T$'s consistency; more on this later.) In particular, $latex \mathrm{PA} + \mathrm{Con}(\mathrm{PA})$ is stronger than $latex \mathrm{PA}$. But certainly, given that... |
|
| | | | | ||
| | | | |
cronokirby.com
- Read more: https://cronokirby.com/posts/2020/10/categorical-graphs/ |
|
| | | |||
