Explore >> Select a destination
|
You are here 
|
ianwrightsite.wordpress.com | ||
| | | | |
blog.computationalcomplexity.org
|
|
| | | | | In my post about the myth that Logicians are crazy I mentioned in passing that Whitehead and Russell spend 300 pages proving 1+1=2 (but we... | |
| | | | |
daniellefong.com
|
|
| | | | | The following occurred to me on a run about two years ago: It's not given much press, but the the Halting Problem is intimately related to Gödel's First Incompleteness Theorem. Indeed it produces it as a correllary. Historically, Gödel's incompleteness results were proved by hacking arithmetic into a Turing complete system, and this is still... | |
| | | | |
existentialtype.wordpress.com
|
|
| | | | | The Christian doctrine of trinitarianism states that there is one God that is manifest in three persons, the Father, the Son, and the Holy Spirit, who together form the Holy Trinity. The doctrine of computational trinitarianism holds that computation manifests itself in three forms: proofs of propositions, programs of a type, and mappings between... | |
| | | | |
anuragbishnoi.wordpress.com
|
|
| | | The Ramsey number $latex R(s, t)$ is the smallest $latex n$ such that every graph on $latex \geq n$ vertices either contains a clique of size $latex s$ or an independent set of size $latex t$. Ramsey's theorem implies that these numbers always exist, and determining them (precisely or asymptotically) has been a major challenge... | ||
