/explore
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
eklausmeier.goip.de
|
|
| | | | | [AI summary] This article explains the mathematical method of diagonalization, using Cantor's proof of uncountability and Turing's halting problem as primary examples. | |
| | | | |
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. | |
| | | | |
nickdrozd.github.io
|
|
| | | | | 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? | |
| | | | |
afieldguidetomath.wordpress.com
|
|
| | | I am an Associate Professor in the Department of Mathematics at the University of Connecticut. My research focuses in the area of arithmetic geometry, which is at the cross roads of number theory and algebraic geometry. | ||
