Explore >> Select a destination
|
You are here 
|
ebtech.github.io | ||
| | | | |
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... | |
| | | | |
4gravitons.com
|
|
| | | | | Why did physicists expect to see something new at the LHC, more than just the Higgs boson? Mostly, because of something called naturalness. Naturalness, broadly speaking, is the idea that there shouldn't be coincidences in physics. If two numbers that appear in your theory cancel out almost perfectly, there should be a reason that they... | |
| | | | |
distill.pub
|
|
| | | | | Training an end-to-end differentiable, self-organising cellular automata model of morphogenesis, able to both grow and regenerate specific patterns. | |
| | | | |
rjlipton.com
|
|
| | | Connections in mathematics: games and graphs John Nash is famous for his creation of what has become one of the central notions of modern game theory---his concept of what is a ``solution" for a non-zero sum game. For this work he was awarded the Nobel Prize in Economic Sciences in 1994, along with John Harsanyi... | ||
