Explore >> Select a destination
|
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... | |
| | | | |
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... | |
| | | | |
thetexasorator.com
|
|
| | | | | An interview with UT computer scientist and OpenAI researcher Scott Aaronson. | |
| | | | |
blog.lambdaclass.com
|
|
| | | Elliptic curves (EC) have become one of the most useful tools for modern cryptography. They were proposed in the 1980s and became widespread used after 2004. Its main advantage is that it offers smaller key sizes to attain the same level of security of other methods, resulting in smaller storage | ||
