/explore
|
You are here 
|
turbotm.de | ||
| | | | |
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. | |
| | | | |
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... | |
| | | | |
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.lesswrong.com
|
|
| | | The big news of the week is OpenAI introducing the Superalignment Taskforce. OpenAI is pledging 20% of compute secured to date towards a four year ef... | ||
