Explore >> Select a destination
|
You are here 
|
accodeing.com | ||
| | | | |
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... | |
| | | | |
blog.paulhankin.net
|
|
| | | | | Programming, Computer Science, Games and Other Things | |
| | | | |
nickdrozd.github.io
|
|
| | | | | How long can a Turing machine program run when started on the blank tape before the tape becomes blank again? Of course, this will depend on the length of the program - how many states and colors it has. Even given these parameters, it is logically impossible to calculate how long a self-cleaning Turing machine can run. Any values that can be known have to be discovered empirically. | |
| | | | |
coredumped.dev
|
|
| | | In my last post I introduced an Emacs Lisp VM I was writing in Rust. My stated goal at the time was to complete a garbage collector. I think Rust has some really interesting properties that will make building garbage collectors easier and safer. Many of the techniques used in my GC are not original and have been developed by other Rustaceans in previous projects. Updated: 2022-09-06 Why use garbage collection? | ||
