Explore >> Select a destination
|
You are here 
|
math.andrej.com | ||
| | | | |
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... | |
| | | | |
rjlipton.com
|
|
| | | | | Another proof idea using finite automata Steve Cook proved three landmark theorems with 1971 dates. The first has been called a "surprising theorem": that any deterministic pushdown automaton with two-way input tape can be simulated in linear time by a random-access machine. This implies that string matching can be done in linear time, which inspired... | |
| | | | |
jdh.hamkins.org
|
|
| | | | | I have been reading Alan Turing's paper, On computable numbers, with an application to the entsheidungsproblem, an amazing classic, written by Turing while he was a student in Cambridge. This... | |
| | | | |
uncommongenders.home.blog
|
|
| | | A gender that is fluid between xenine and other "uncommon" genders! Though the term Gendersylph was made by a troll, it's also called Genderfen and Genderfaon! -Admin Opal | ||
