Aaronson - PDFSEARCH.IO - Document Search Engine

Aaronson
Results: 149

#	Item
11	Is Quantum Mechanics An Island In Theoryspace? SCOTT AARONSON University of California, Berkeley CA USA This paper investigates what happens if we change quantum mechanics in several ways. The ma Add to Reading List Source URL: www.scottaaronson.com - Date: 2006-11-24 03:49:45
12	Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton Scott Aaronson∗ Sean M. Carroll† Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2014-05-27 14:31:46 Information theory Randomness Metaphysics Theoretical computer science Theory of computation Entropy Kolmogorov complexity Sophistication Complexity Random sequence Algorithmic information theory Mutual information
13	1. Aaronson NK, Snyder C. Using patient-reported outcomes in clinical practice: proceedings of an International Society of Quality of Life Research conference. Qual Life ResDec;17(10):1295. PubMed PMID: . Add to Reading List Source URL: www.isoqol.org Language: English - Date: 2015-07-13 15:22:00 Health Medical research PubMed Patient-reported outcome Surgical Care and Outcomes Assessment Program Victor Velculescu
14	LIST OF INDIVIDUALS AARONSON, Lillian Birth: 05 Sep 1893 in Chicago, IL Marriage: Detroit, MI Death: 28 Nov 1980 in Detroit, MI ABRAMOVITCH, Mona Add to Reading List Source URL: www.jpreisler.com Language: English - Date: 2014-06-20 17:55:40
15	Last Name AARONSON ABBAS ABBOUD ABEL ABIDI Add to Reading List Source URL: www.endo.com Language: English - Date: 2014-08-29 14:01:04 Caucuses of the United States Congress Congressional Taiwan Caucus Amash-Conyers Amendment
16	NP-complete Problems and Physical Reality arXiv:quant-ph/0502072v2 21 Feb 2005 Scott Aaronson∗ Add to Reading List Source URL: cqi.inf.usi.ch Language: English - Date: 2012-02-22 09:04:08 Computational complexity theory Complexity classes Quantum computing Theoretical computer science Mathematical optimization Quantum algorithm NP P versus NP problem BQP PP Low Time complexity
17	Who Can Name the Bigger Number? Scott Aaronson∗ 1999 In an old joke, two noblemen vie to name the bigger number. The first, after ruminating for hours, triumphantly announces ”Eighty-three!” The second, Add to Reading List Source URL: homepages.math.uic.edu Language: English - Date: 2016-01-08 10:48:49 Theory of computation Computability theory Busy beaver Computable function Computability Turing machine Halting problem Hypercomputation Computable number Algorithm Alan Turing Ackermann function
18	Recent Interactions between TCS and Quantum Physics Scott Aaronson September 2013 In 1994, when Peter Shor announced his famous algorithm for factoring integers in polynomial time using a quantum computer, it wasn’t ob Add to Reading List Source URL: thmatters.files.wordpress.com Language: English - Date: 2015-10-14 11:22:07 Quantum information science Quantum computing Quantum cryptography Quantum mechanics Emerging technologies Quantum algorithm Quantum information Quantum gravity Quantum complexity theory Theoretical computer science Boson sampling Quantum key distribution
19	A Relatively Small Turing Machine Whose Behavior Is Independent of Set Theory Adam Yedidia Scott Aaronson Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2016-05-03 08:34:47 Mathematics Theoretical computer science Computability theory Mathematical logic Theory of computation Turing machine Models of computation Busy beaver Halting problem ZermeloFraenkel set theory Computability Computable function
20	Optimal Demand-Oriented Topology for Hypertext Systems July 29, 1997 ACM SIGIR’97 Scott Aaronson <> Add to Reading List Source URL: www.scottaaronson.com Language: English - Date: 2006-11-24 04:02:42

UPDATE