/explore
|
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... | |
| | | | |
blog.sigfpe.com
|
|
| | | | | [AI summary] An elementary proof is provided for how it is possible to exhaustively search an infinite space of boolean streams in finite time by exploiting the structure of computable predicates. | |
| | | | |
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... | |
| | | | |
blog.thomasheartman.com
|
|
| | | In which we take a deep dive into the world of lists by looking at list creation, list comprehension, and about spines and non-strict evaluation. As it turns out, this has some pretty interesting implications. | ||
