/explore
|
You are here 
|
theorydish.blog | ||
| | | | |
www.chriswarbo.net
[AI summary] An author explores methods to automate programming tasks, comparing theoretical approaches like Levin Search and Solomonoff Induction with practical heuristics such as Genetic Algorithms. |
|
| | | | | ||
| | | | |
andrew222651.com
|
|
| | | | | ||
| | | | |
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... |
|
| | | | | ||
| | | | |
matbesancon.xyz
Learning by doing: predicting the outcome. |
|
| | | |||
