recentpopularlog in

mcherm : via:scottaaronson   24

Quantum computing for policymakers and philosopher-novelists
Quantum computers will be available soon. They'll be useful for quantum simulations, and will break non-quantum-resistant public key cryptography. Might provide some speedup (square root of classical steps)on other general problems.
quantumcomputing  quantummechanics  via:ScottAaronson  ScottAaronson 
june 2018 by mcherm
The universe has a high (but not infinite) Sleep Number » Shtetl-Optimized
The gravity wave detected required as much energy as all the light given out by all the stars in the universe just quiver spacetime by a centimeter or so at a distance of Earth's orbit.
physics  via:ScottAaronson 
february 2016 by mcherm
Shtetl-Optimized » Blog Archive » Common Knowledge and Aumann’s Agreement Theorem
Perfectly rational beings will always agree after they discuss things, and with wild leaps in opinion so they keep switching sides. Actual humans never work like that.
logic  philosophy  via:ScottAaronson  ScottAaronson 
october 2015 by mcherm
NSA in P/poly: The Power of Precomputation
A paper has now been published that proves the following is possible (and likely being done by the NSA): pre-compute tables for a handful of prime numbers and thus break Diffy-Hellman in the real world (where the same few primes are almost always used).
cryptography  security  via:ScottAaronson 
may 2015 by mcherm
Aeon Ideas - Scott Aaronson on Is there something my...
Philosophy of Math: most of math is NOT very surprising. Almost none of math seems to be unprovable. Why?
via:ScottAaronson  philosophy  math 
may 2015 by mcherm
The Quest for Randomness » American Scientist
Using Kolmogorov complexity to determine whether a series of values is "actually random".
ScottAaronson  via:ScottAaronson  quantumcomputing  math  complexity  random 
april 2014 by mcherm
This review of Max Tegmark’s book also occurs infinitely often in the decimal expansion of π
The "theory" that "the universe is described by math; ALL universes that could be described by math 'exist' equally" is not actual science because it doesn't tell us anything INTERESTING.
philosophyOfScience  via:ScottAaronson  ScottAaronson 
march 2014 by mcherm
The Scientific Case for P≠NP » Shtetl-Optimized
A really good explanation for why they believe (without proof) that P != NP. There are many known problems where two different kinds of reasoning show that below a certain value of a parameter it's in P and above a certain value it's in NP... and they happen to be the exact same value. What a coincidence, unless there's a reason for it.
philosophyOfScience  math  computerscience  computationalcomplexity  via:ScottAaronson  ScottAaronson  philosophyOfMath 
march 2014 by mcherm
Shtetl-Optimized » Blog Archive » Retiring falsifiability? A storm in Russell’s teacup
Popper: was he wrong? Should we retire "falsifiablity" as a key part of the philosophy of science? Maybe... (and use "explanatory power" instead): it is certainly lacking in some ways. But Popper himself was actually rather reasonable about this; it is his successors who overlook the actual practice of science for the theory of falsifiability.
ScientificMethod  science  via:ScottAaronson  ScottAaronson 
january 2014 by mcherm
Twenty Reasons to Believe Oswald Acted Alone
An exercise in logical thinking: why the conspiracy theories about the Kennedy assassination are likely bogus.
philosophy  via:ScottAaronson  ScottAaronson 
january 2014 by mcherm
Why Many-Worlds is not like Copernicanism
Scott Aaronson believes the multiple-worlds theory of quantum mechanics, but he does not believe that it is so blindingly obvious that anyone who doubts it must be ignorant.
quantummechanics  ScottAaronson  via:ScottAaronson  philosophy 
august 2012 by mcherm
The Status of the P Versus NP Problem | September 2009 | Communications of the ACM
Update on the status of P vs NP: everyone thinks they're not equal, several avenues have appeared they might lead to a proof but so far each has petered out.
via:ScottAaronson  computerscience  complexity  programming  algorithms  math 
august 2009 by mcherm
Shtetl-Optimized » Blog Archive » Malthusianisms
Examples of the laws that say that things are bad because if they weren't we'd make them worse.
via:ScottAaronson  ScottAaronson  philosophy 
august 2009 by mcherm
A Mathematician’s Lament by Paul Lockhart - LockhartsLament.pdf
A rant about how math education today ruins students' enjoyment of mathematics for no discernible benefit.
via:ScottAaronson  math  education  PauleLockhart 
june 2009 by mcherm
The QIS workshop » Shtetl-Optimized
Several interesting things here, if you can understand them. The most interesting is that some curious properties designed by people studying the math called "quantum information theory" turn out to be key to a molecule that is at the heart of photosynthesis.
via:ScottAaronson  ScottAaronson  physics  computerscience  quantummechanics  quantumcomputing 
may 2009 by mcherm
Dartlog: TDR Interview: Priya Venkatesan '90
Interview with a college professor who is simply abysmal and demonstrates it during the interview.
via:ScottAaronson  education  personal_net 
april 2009 by mcherm
The Singularity Is Far » Shtetl-Optimized
The author disagrees with the often-heard wisdom that the singularity is coming soon. His more pessimistic view is that there may well be a singularity but it's a long way off... hundreds of years... and it might not be that dramatic anyhow.
philosophy  singularity  via:ScottAaronson  ScottAaronson 
april 2009 by mcherm
Should you vote? » Shtetl-Optimized
A mathematical argument that voting is worthwhile... that the expected utility of your vote does NOT asymptotically approach zero as the number of voters approaches infinity.
voting  math  via:ScottAaronson  ScottAaronson 
april 2009 by mcherm

Copy this bookmark:

to read