/explore
|
You are here 
|
pavpanchekha.com | ||
| | | | |
www.forwardscattering.org
|
|
| | | | | [AI summary] Nicholas Chapman proves that it is decidable to find the fastest Turing machine for computing functions defined on a finite domain by limiting the search space to machines with a finite number of states based on a reference solution's runtime. | |
| | | | |
jeremykun.wordpress.com
|
|
| | | | | We assume the reader is familiar with the concepts of determinism and finite automata, or has read the corresponding primer on this blog. The Mother of All Computers Last time we saw some models for computation, and saw in turn how limited they were. Now, we open Pandrora's hard drive: Definition: A Turing machineis a... | |
| | | | |
blog.sigfpe.com
|
|
| | | | | [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. | |
| | | | |
rjlipton.com
|
|
| | | A result on the prime divisors of polynomial values Cropped from source Issai Schur was a mathematician who obtained his doctorate over a hundred years ago. He was a student of the great group theorist Ferdinand Frobenius. Schur worked in various areas and proved many deep results, including some theorems in basic number theory. Today... | ||
