Explore >> Select a destination
|
You are here 
|
nickdrozd.github.io | ||
| | | | |
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... | |
| | | | |
www.sligocki.com
|
|
| | | | | A few weeks ago, I announced new Beeping Busy Beaver results. In this post, I'd like to explain a little bit about the process I'm using to do this search. I'm following roughly the same process that has been used to exhaustively search for standard Busy Beavers (see ex: Marxen and Buntrock, Attacking the Busy Beaver 5) in the past with a few tweaks for the Beeping halt condition. | |
| | | | |
xorshammer.com
|
|
| | | | | There are many functions from $latex \mathbb{N}$ to $latex \mathbb{N}$ that cannot be computed by any algorithm or computer program. For example, a famous one is the halting problem, defined by $latex f(n) = 0$ if the $latex n$th Turing machine halts and $latex f(n) = 1$ if the $latex n$th Turing machine does not... | |
| | | | |
www.chriswarbo.net
|
|
| | | |||
