Explore >> Select a destination
|
You are here 
|
adamdrake.com | ||
| | | | |
www.ardanlabs.com
|
|
| | | | | If you are attending GopherCon 2014 or plan to watch the videos once they are released, this article will prepare you for the talk by Gustavo Niemeyer and Steve Francia. It provides abeginners view for using the Go mgo driver against a MongoDB database.Introduction MongoDB supports many different programming languages thanks to a great set of drivers. One such driver is the MongoDB Go driver which is called mgo. | |
| | | | |
emilygorcenski.com
|
|
| | | | | I recently re-solved Project Euler Problem 1 on Twitch. Here's the math behind it. | |
| | | | |
aneesh.mataroa.blog
|
|
| | | | | ||
| | | | |
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... | ||
