/explore
|
You are here 
|
www.logicmatters.net | ||
| | | | |
carcinisation.com
|
|
| | | | | Gödel's theorems say something important about the limits of mathematical proof. Proofs in mathematics are (among other things) arguments. A typical mathematical argument may not be "inside" the universe it's saying something about. The Pythagorean theorem is a statement about the geometry of triangles, but it's hard to make a proof of it using nothing... | |
| | | | |
rjlipton.com
|
|
| | | | | Exponential-time algorithms running on large data Moshe Vardi is perhaps the world's foremost expert on the application of logic to practical computations. His paper "Reasoning about Infinite Computations" with Pierre Wolper won the 2000 Gödel Prize. Infinite computations may not seem practical, but the magic is in the finite machines that perform them, and how... | |
| | | | |
neilmadden.blog
|
|
| | | | | I saw another article on Gödel's incompleteness theorems linked from Reddit today. It's a topic I've wanted to write about for some time. Although many articles do a decent job in giving an idea of what the big deal is (and this one is pretty good), they can sometimes give a misleading impression of what... | |
| | | | |
www.newscientist.com
|
|
| | | Is this a record for a quantum computer A group of physicists in China have used a process called adiabatic computing to find the prime factors of the number 143, beating the previous record for a quantum computer of 21. However, there are doubts about the quantum nature of this method, and its potential ... | ||
