/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

 jeremykun.wordpress.com
Turing Machines - A Primer - Math Programming
| | blog.sigfpe.com
A Neighborhood of Infinity: How can it possibly be that we can exhaustively search an infinite space in a finite time?
3.6 parsecs away

Travel
| | [AI summary] An elementary proof is provided for how it is possible to exhaustively search an infinite space of boolean streams in finite time by exploiting the structure of computable predicates.
| | eklausmeier.goip.de
Methods of Proof - Diagonalization - Elmar Klausmeier's Blog on Computers, Programming, and Mathematics
1.7 parsecs away

Travel
| | [AI summary] This article explains the mathematical method of diagonalization, using Cantor's proof of uncountability and Turing's halting problem as primary examples.
| | nickdrozd.github.io
Halt, Quasihalt, Recur | Something Something Programming
2.7 parsecs away

Travel
| | The goal of the Busy Beaver contest is to find n-state k-color Turing machine programs that run for as long as possible before halting. It's basically an optimization problem: what is the longest finite computation that can squeezed out of a program of a certain length? Or from the flip-side: how much description can be packed into a program of a certain length?
| | www.quantamagazine.org
"Lean" Computer Program Confirms Peter Scholze Proof | Quanta Magazine
32.4 parsecs away

Travel
| Mathematicians using the computer program Lean have verified the accuracy of a difficult theorem at the cutting edge of research mathematics.