/explore
|
You are here 
|
jdh.hamkins.org | ||
| | | | |
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... | |
| | | | |
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... | |
| | | | |
blog.sigfpe.com
|
|
| | | | | [AI summary] The author explores the counterintuitive connections between topology and computability using exact real arithmetic streams. | |
| | | | |
maryrosecook.com
|
|
| | | Little Lisp is an interpreter that supports function invocation, lambdas, lets, ifs, numbers, strings, a few library functions, and lists. I wrote it for a l... | ||
