Explore >> Select a destination
|
You are here 
|
scottaaronson.blog | ||
| | | | |
nickdrozd.github.io
|
|
| | | | | The goal of the Busy Beaver contest is to find n-state k-color Turing machine programs that run for as long as possible before halting. It's basically an optimization problem: what is the longest finite computation that can squeezed out of a program of a certain length? Or from the flip-side: how much description can be packed into a program of a certain length? | |
| | | | |
profmattstrassler.com
|
|
| | | | | Last year, in a series of posts, I gave you a tour of quantum field theory, telling you some of what weunderstand and some of what we don't. I still haven't told you the role that string theory plays inquantum field theory today, but I am going to give you a brief tour of string... | |
| | | | |
windowsontheory.org
|
|
| | | | | (see also pdf version) Quantum computing is one of the most exciting developments of computer science in the last decades. But this concept is not without its critics, often known as "quantum computing skeptics" or "skeptics" for short. The debate on quantum computing can sometimes confuse the physical and mathematical aspects of this question,... | |
| | | | |
divisbyzero.com
|
|
| | | After writing about some well known people with degrees in mathematics, I was moved to re-listen to some old Tom Lehrer songs on YouTube. I decided I'd post some links to his more mathematical songs here. Enjoy. First, "Lobachevsky," a song about the Russian mathematician Nikolai Lobachevsky and his discovery of non-Euclidean geometry, which some... | ||
