The aim of the Busy Beaver game is to find the longest running Turing machine program of n states and k colors. Busy Beaver programs could in principle be written by hand, but nobody has ever succeeded in doing so. Instead, these programs are discovered through exhaustive search. This is done by a two-stage process:| Something Something Programming
In the 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? Answering this question requires enumerating every such program and checking whether or not it halts. But there is a big problem: there are just too many to check. The number of programs grows multiple-exponentially with N and K, O(nknk). Yikes!| Something Something Programming
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:| Something Something Programming
I have some Rust code that does a bunch of pure computation. A lot of it. To solve basically an elaborate combinatorial problem.| Something Something Programming
The other day I found a cool new 3-state 3-color Turing machine program. Here it is:| Something Something Programming
Mypy is a typechecker for Python. It’s not the official typechecker for Python. There is no official typechecker. But Mypy seems to be the official-est. I use it, and it’s mostly pretty great.| Something Something Programming
when i use haptpt i dont make any effort to dlean up the tesxt i just taype the baer minimum amount of information needed to communicate what i need. i leave in all the typos, dont bothwe with caps, very little pucnutation. franktly the text looks like shit.| Something Something Programming
Print debugging is the technique of debugging by inserting print statements into code and watching their output. For example, if my program seems to be getting stuck somewhere, I might put in some print statements like this:| Something Something Programming
The classic Busy Beaver function is defined as the maximum number of steps that an N-state 2-color Turing machine program can run before halting when started on the blank tape. The function is uncomputable, and any sound proof system S can only prove values up to a certain point. That is, there is some number Q such that| Something Something Programming
www.thug.com is a 1998 album by the American rapper Trick Daddy. The music itself is not especially remarkable (the production is pretty bland, but there is some decent rapping), but it is notable for its Internet-themed title and cover:| Something Something Programming
Recently I was described as “pro-AI”. “Oh, ChatGPT? You should ask Nick about that, he’s pro-AI.”| Something Something Programming
Multiplication is repeated addition: 2 * 5 is defined as 2 + 2 + 2 + 2 + 2.| Something Something Programming