/explore
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
scottaaronson.blog
|
|
| | | | | In Michael Sipser's Introduction to the Theory of Computation textbook, he has one Platonically perfect homework exercise, so perfect that I can reconstruct it from memory despite not having opened the book for over a decade. It goes like this: Let f:{0,1}*?{0,1} be the constant 1 function if God exists, or the constant 0 function... | |
| | | | |
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... | |
| | | | |
pressron.wordpress.com
|
|
| | | | | Abstract: Machine and language models of computation differ so greatly in the computational complexity properties of their representation that they form two distinct classes that cannot be directly compared in a meaningful way. While machine models are self-contained, the properties of the language models indicate that they require a computationally powerful collaborator, and are better... | |
| | | | |
quanttype.net
|
|
| | | Spoiler: It's not related to functional programming. | ||
