Explore >> Select a destination
|
You are here 
|
windowsontheory.org | ||
| | | | |
www.scientificamerican.com
|
|
| | | | | Quantum computers would be exceptionally fast at a few specific tasks, but it appears that for most problems they would outclass today's computers only modestly. This realization may lead to a new fundamental physical principle | |
| | | | |
rjlipton.com
|
|
| | | | | Are quantum errors incorrigible? Discussion between Gil Kalai and Aram Harrow Gil Kalai and Aram Harrow are world experts on mathematical frameworks for quantum computation. They hold opposing opinions on whether or not quantum computers are possible. Today and in at least one succeeding post, Gil and Aram will discuss the possibility of building large-scale... | |
| | | | |
scottaaronson.blog
|
|
| | | | | So I've written an article about the above questionfor PBS's website---a sort of tl;dr version of my 2005 survey paperNP-Complete Problems and Physical Reality, butupdated with new material about the simulation of quantum field theories and about AdS/CFT. Go over there, read the article (it's free), then come back here to talk about it if... | |
| | | | |
nurkiewicz.com
|
|
| | | Clojure is a dynamically, strongly typed programming language. It's a dialect of _Lisp_ running on the Java Virtual Machine. Lisp is 6 decades old and has a really weird syntax. That weird syntax is called _Polish prefix notation_. Basically, in every other language you've used math operators like plus or minus are infix. It means they are placed between operands. For example, `1 + 2`. In Clojure, you always put the operator (or any other function for that matter) in front. So simple addition becomes... `+ 1 2`. | ||
