Explore >> Select a destination
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
jdh.hamkins.org
|
|
| | | | | I'd like to share a simple proof I've discovered recently of a surprising fact: there is a universal algorithm, capable of computing any given function! Wait, what? What on earth do I ... | |
| | | | |
www.jeremykun.com
|
|
| | | | | Decidability Versus Efficiency In the early days of computing theory, the important questions were primarily about decidability. What sorts of problems are beyond the power of a Turing machine to solve? As we saw in our last primer on Turing machines, the halting problem is such an example: it can never be solved a finite amount of time by a Turing machine. However, more recently (in the past half-century) the focus of computing theory has shifted away from possibility in favor of determining feasibility. | |
| | | | |
www.yodaiken.com
|
|
| | | | | ||
| | | | |
skiplang.com
|
|
| | | One of my biggest frustration when I try to learn a new language (Rust, Elm) or work on a language that I haven't touched in a while (OCaml, C++, PHP) is around syntax. I know what I want to write and I have an approximate idea of how it should be written but don't exactly get it right. | ||
