/explore
|
You are here 
|
www.jeremykun.com | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
kpknudson.com
[AI summary] A mathematician connects Franz Kafka's theme of 'non-arrival' and infinite paradoxes to Georg Cantor's work on different levels of transfinite infinity and the diagonalization argument. |
|
| | | | | ||
| | | | |
algorithmsoup.wordpress.com
The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... |
|
| | | | | ||
| | | | |
stevensoojin.kim
A survey of Poincaré inequalities appearing outside of PDE. |
|
| | | |||
