Explore >> Select a destination
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
nickdrozd.github.io
|
|
| | | | | In the classic Busy Beaver game we ask: what is the longest that a Turing machine program of N states and K colors can run before halting when started on the blank tape? The basic approach to solving this problem is to generate a list of candidate programs, then subject each program to a sequence of deciders, where a decider is a function that takes a program as input and returns a result of type Option. This result is interpreted as follows: | |
| | | | |
jaywillmath.wordpress.com
|
|
| | | | | In the previous post, I discussed a technique due to Neumann and Neumann for embedding any countable group into a 2-generated group, and mentioned in passing that they used the same ideas to create a finitely generated 3-solvable non-Hopfian group. This construction turned out to be very useful to my own research, but to describe... | |
| | | | |
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... | |
| | | | |
sansmap.wordpress.com
|
|
| | | hand written text by shel silverstein, poem published in his book 'Falling Up'; 1996 | ||
