Explore >> Select a destination
|
You are here 
|
jeremykun.wordpress.com | ||
| | | | |
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? | |
| | | | |
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. | |
| | | | |
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. | |
| | | | |
armariummagnus.blogspot.com
|
|
| | | James Hannam, God's Philosophers: How the Medieval World Laid the Foundations of Modern Science (Icon Books, 2009) 320 pages Verdict?: ... | ||
