Outer Web | Explore

/explore

Click through on any links that interest you or select the planets on the right to continue exploring the Outer Web.

You are here		blog.sigfpe.com A Neighborhood of Infinity: How can it possibly be that we can exhaustively search an infinite space in a finite time?
\|	\|	www.jeremykun.com P vs. NP, A Primer (And a Proof Written in Racket) \| Math Programming	4.0 parsecs away Travel
\|	\|	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.	4.0 parsecs away Travel
\|	\|	pavpanchekha.com Fixed Points, Part 4: Stability	5.4 parsecs away Travel
\|	\|		5.4 parsecs away Travel
\|	\|	jdh.hamkins.org Every function can be computable! \| Joel David Hamkins	4.8 parsecs away Travel
\|	\|	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 ...	4.8 parsecs away Travel
\|	\|	clutterreport.wordpress.com Christmas decorations 2024 (7) \| The Clutter Reports	20.3 parsecs away Travel
\|		attempting to clean up my living and workspace	20.3 parsecs away Travel