163 reputation
6
bio website strilanc.com
location New York, United States
age
visits member for 3 years, 9 months
seen Sep 15 at 3:28

Professional and hobbyist software developer.

Working at Google in New York.


Sep
24
awarded  Autobiographer
May
1
awarded  Teacher
Apr
30
answered Quantum Entanglement - What's the big deal?
Nov
25
answered Why does the classical equivalent to a quantum computer take so many bits?
Nov
19
accepted Quantum circuit equivalent of quantum pseudo-telepathy game
Nov
19
answered Quantum circuit equivalent of quantum pseudo-telepathy game
Sep
28
comment What are the current obstacles to experimentally testing quantum pseudo telepathy?
@Emilio I mostly just find it to be an interesting application. More relatable than measurements agreeing more often than you'd expect, because it directly shows you can use it. In this review paper Gilles Brassard et al. mention it's a good way to demonstrate QM is correct.
Sep
28
revised What are the current obstacles to experimentally testing quantum pseudo telepathy?
deleted 3 characters in body
Sep
28
revised What are the current obstacles to experimentally testing quantum pseudo telepathy?
deleted 1 characters in body
Sep
28
asked What are the current obstacles to experimentally testing quantum pseudo telepathy?
Sep
12
answered Quantum circuit equivalent of quantum pseudo-telepathy game
Sep
12
asked Quantum circuit equivalent of quantum pseudo-telepathy game
Jul
7
comment Weyl Large Number Coincidence
For every operation you add, you need more matching digits to confirm it because the number of possibilities goes way up and allows you to find equations that approximately match by brute luck. Your expression has a handful of operations and only matches one digit of the exponent. That implies, as a starting point, that it's a coincidence.
May
18
comment Estimating the Kolmogorov Complexity of the Standard Model
@Siva Kolmogorov complexity is a not a good predictor of computational complexity. For example, brute force search is very inefficient but also very short to specify, so the shortest programs will tend to do dumb slow things like brute force search.
May
18
comment Estimating the Kolmogorov Complexity of the Standard Model
@Siva Just in case there's any confusion: the abstract of that paper refers to computational complexity, which is distinct from Kolmogorov complexity.
May
18
comment Estimating the Kolmogorov Complexity of the Standard Model
@Siva Note that I don't really care about the exact value, just a reasonable upper bound. The exact value has more to do with the particulars of your programming language or Turing machine encoding, and as you note is very difficult to determine (in fact: once you exceed a particular complexity, lower bounds become impossible due to issues related to the halting problem).
May
18
awarded  Student
May
18
awarded  Editor
May
18
revised Estimating the Kolmogorov Complexity of the Standard Model
deleted 1 characters in body
May
18
asked Estimating the Kolmogorov Complexity of the Standard Model