Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
nickdrozd.github.io
|
|
| | | | | The Busy Beaver question asks: what is the longest that a Turing machine program of n states and k colors can run when started on the blank tape before halting? The function that maps from (n, k) to the longest run length is uncomputable and grows faster than any computable function. | |
| | | | |
profmattstrassler.com
|
|
| | | | | Last year, in a series of posts, I gave you a tour of quantum field theory, telling you some of what weunderstand and some of what we don't. I still haven't told you the role that string theory plays inquantum field theory today, but I am going to give you a brief tour of string... | |
| | | | |
nickdrozd.github.io
|
|
| | | | | The nth Busy Beaver number is defined as the longest runtime of all halting Turing machines of n states. Is this sequence well-defined? For concreteness, let's consider a number to be well-defined if it would be accepted as a valid entry in the Bigger Number Game (BNG): | |
| | | | |
jdh.hamkins.org
|
|
| | | I have been reading Alan Turing's paper, On computable numbers, with an application to the entsheidungsproblem, an amazing classic, written by Turing while he was a student in Cambridge. This... | ||
