/explore
|
You are here 
|
scottaaronson.blog | ||
| | | | |
quantumfrontiers.com
|
|
| | | | | A great childhood memory that I have comes from first playing "The Incredible Machine" on PC in the early 90's. For those not in the know, this is a physics-based puzzle game about building Rube Goldberg style contraptions to achieve given tasks. What made this game a standout for me was the freedom that it... | |
| | | | |
thetexasorator.com
|
|
| | | | | An interview with UT computer scientist and OpenAI researcher Scott Aaronson. | |
| | | | |
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... | |
| | | | |
barghouthi.github.io
|
|
| | | |||
