Explore >> Select a destination
|
You are here 
|
blog.sigfpe.com | ||
| | | | |
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. | |
| | | | |
pavpanchekha.com
|
|
| | | | | ||
| | | | |
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.logicmatters.net
|
|
| | | As I said some weeks ago, I am slowly revising my Introduction to Gödel's Theorems; I am still only about a third of the way through. I haven't yet spotted any real horrors, but I've found some ways of re-arranging the material for the better, and there are quite a few sections which now strike [...] | ||
