Explore >> Select a destination
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
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... | |
| | | | |
reportofanimals.com
|
|
| | | | | DISCLAIMER: This is an essay I wrote for my Masters degree in 2023, part of a series I will be putting on this site to get me started. While I have changed some of my views and found new lines of inquiry since I wrote this, I feel there is value in it and after... | |
| | | | |
nickdrozd.github.io
|
|
| | | | | 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 | |
| | | | |
www.lesswrong.com
|
|
| | | An epistle to the physicists: ? When I was but a little lad, my father, a PhD physicist, warned me sternly against meddling in the affairs of physici... | ||
