You are currently browsing the category archive for the ‘Talk’ category.
Scott Aaronson, Talk @ Microsoft Research, So You Think Quantum Computing Is Bunk? here. Really nice talk.
In this talk, I’ll take an unusual tack in explaining quantum computing to a broad audience. I’ll start by assuming, for the sake of argument, that scalable quantum computing is ‘too crazy towork’: i.e., that it must be impossible for some fundamental physical reason. I’ll then investigate the sorts of radical additions or changes to current physics that we seem forced to contemplate in order to justify such an assumption. I’ll point out the many cases where such changes seem ruled out by existing experiments, or by no-go theorems such as the Bell Inequality. I’ll also mention two recent no-go theorems for so-called ‘epistemic’ hidden-variable theories: one due to Pusey, Barrett, and Rudolph, the other to Bouland, Chua, Lowther, and myself. Finally, I’ll discuss my 2004 notion of a ‘Sure/Shor separator,’ as well as the BosonSampling proposal [A.-Arkhipov 2011] and its recent experimental realizations—which suggest one possible route to falsifying the Extended Church-Turing Thesis more directly than by building a universal quantum computer.
There appears to be a loophole in Goedel Incompleteness Theorem. It was vaguely perceived for a long time but not clearly identified. (Thus, Goedel believed informal arguments can answer any math question.) Closing this loophole does not seem obvious and involves Kolmogorov complexity. (This is unrelated to, well studied before, complexity quantifications of the usual Goedel effects.) I consider extensions U of the universal partial recursive predicate (or, say, Peano Arithmetic). I prove that any U either leaves unresolved an n-bit input (statement) or contains nearly all information about the n-bit prefix of any r.e. real (which is n bits for some r.e. reals). I argue that creating significant information about a SPECIFIC math sequence is impossible regardless of the methods used. Similar problems and answers apply to other unsolvability results for tasks allowing non-unique solutions, e.g. non-recursive tilings.
D.Hilbert asked if the formal arithmetic can be consistently extended to a complete theory. The question was somewhat vague since an obvious answer was “yes”: just add to the axioms of Peano Arithmetic (PA) a maximal consistent set, clearly existing albeit hard to find. K.Goedel formalized this question as existence among such extensions of recursively enumerable ones and gave it a negative answer. Its mathematical essence is the lack of total recursive extensions of universal partial recursive predicate.
This negative answer apparently was never accepted by Hilbert, and Goedel himself had reservations:
“Namely, it turns out that in the systematic establishment of the axioms of mathematics, new axioms, which do not follow by formal logic from those previously established, again and again become evident. It is not at all excluded by the negative results mentioned earlier that nevertheless every clearly posed mathematical yes-or-no question is solvable in this way. For it is just this becoming evident of more and more new axioms on the basis of the meaning of the primitive notions that a machine cannot imitate.” (Goedel. 1961 “The modern development …”)
Ewing Marion Kauffman Foundation, Economic Bloggers Forum 2013, here.
Edward Tufte, The Thinking Eye, here. Nice talk last night – almost a sermon. Kai Li gave the introduction.
Questions I should have asked: How does visualization change after the singularity? The singularity is the time past which the growth of the quantity Global Intellectual Output depends on the global human population only as a low order term.
Edward Tufte, Princeton University, Public Lecture Series, 4Apr, here.
Jeff Dean, Google, 2009 Presentation slides, Designs, Lessons, and Advice from Building Large Distributed Systems, here. How big does the distributed system need to be before the government insures some of the failures? Google, Amazon, and Facebook too small apparently. What about the funds transfer system once we get rid of paper checks? The Herstatt Bank failure was not enough to get government insurance although it did get the creation of the Continuous Settlement Link program. Who does the first Distributed System with any portions of it’s failures costing over 1 billion USD guaranteed by the US Taxpayer? When does this system go on line or is it already on line? I’m thinking it is already online. I suppose any modern tank, aircraft carrier, or just stealth fighter jet projects with cost overruns already hit that. So, how do you get the CFTC and SEC classified as National Defense organizations, just move them to the Pentagon? Exercise left for the reader.
• Ghemawat, Gobioff, & Leung. Google File System, SOSP 2003.
• Barroso, Dean, & Hölzle . Web Search for a Planet: The Google Cluster Architecture, IEEE Micro, 2003.
• Dean & Ghemawat. MapReduce: Simplified Data Processing on Large Clusters, OSDI 2004.
• Chang, Dean, Ghemawat, Hsieh, Wallach, Burrows, Chandra, Fikes, & Gruber. Bigtable: A Distributed Storage System for Structured Data, OSDI 2006.
• Burrows. The Chubby Lock Service for Loosely-Coupled Distributed Systems. OSDI 2006.
• Pinheiro, Weber, & Barroso. Failure Trends in a Large Disk Drive Population. FAST 2007.
• Brants, Popat, Xu, Och, & Dean. Large Language Models in Machine Translation, EMNLP 2007.
• Barroso & Hölzle. The Datacenter as a Computer: An Introduction to the Design of Warehouse-Scale Machines, Morgan & Claypool Synthesis Series on Computer Architecture, 2009.
• Malewicz et al. Pregel: A System for Large-Scale Graph Processing. PODC, 2009.
•Schroeder, Pinheiro, & Weber. DRAM Errors in the Wild: A Large-Scale Field Study. SEGMETRICS’09.
• Protocol Buffers. http://code.google.com/p/protobuf/
Marcos Lopez de Prado, Thalesian Seminar, 20 Mar., Concealing the trading footprint by determining the Optimal Execution Horizon, here. Missed Almgren’s talk on 14Jan, he was great in Ptown.
Market Makers adjust their trading range to avoid being adversely selected by Informed Traders. Informed Traders reveal their future trading intentions when they alter the Order Flow. Consequently, Market Makers’ trading range is a function of the Order Flow imbalance. The Optimal Execution Horizon (OEH) algorithm takes into account order imbalance to determine the optimal participation rate, i.e. how much volume a trader needs to conceal his trading intentions. Paper:http://ssrn.com/abstract=2038387.
TCS + , here.
There are three ways to watch the talk:
Watching the live stream. At the announced start time of the talk (and not a second before), a live video stream will be available on our Google+ page. Simply connect to the page and enjoy the talk. No webcam or registration is needed. Questions and comments during the talk are welcome (text only, unfortunately); simply post a comment below the live video stream on the Google+ page (you might need to “follow” us for that).
Joining the live hangout. Those we wish to be part of the hangout (and hence be visible, and be able to ask questions through the teleconference), need a reasonably modern computer with a webcam. There is a limit on the number of participants who can join this way. We therefore ask parties to bid on the TCS+ page as early as possible. Groups will be given priority. More detailed instructions for those joining the hangouts appear below.
Watching the recorded talk. The recorded talk will be made available shortly after the talk ends on our YouTube page. (Please leave a comment if you enjoyed it!)
Aaronson, Shtetl-Optimized, TCS+ Online Seminars, here
Good news, everyone! Anindya De, Oded Regev, and my postdoc Thomas Vidick are launching an online theoretical computer science seminar series called TCS+, modeled after the successful Q+ quantum information seminars run by Daniel Burgarth and Matt Leifer.
Apollo Robbins, Today Show, here. Ryan Seacrest you were paying fixed/float JPYLibor for 2 years but now check your contract … USDLibor – 30 for 30 years… (applause)
Tabb, TabbForum, Fixed Income 2013: Liquidity, Products, Platforms, here.
Wednesday, January 30, 2013 from 1:00 PM to 5:00 PM (EST)
New York, NY
inside HPC, Video, here.
In this video, Andy Bechtolsheim discusses founding Sun Microsystems and why he thinks the company eventually failed. He also shares what the key success factors for Startups in technology markets and the story behind his writing the first investment check for starting Google.