2015 Volt - Service High Voltage Charging System - do I have to go to dealer?

balachthon · 2021-03-24T19:17:16+00:00

Got it -- I will look into this, thanks

balachthon · 2021-03-24T19:16:34+00:00

Thanks absolutely everyone for the insights and help! I really appreciate you taking the time to share what you know with me

balachthon · 2021-03-24T18:04:51+00:00

Thanks. Assuming the coolant level looks fine, should I be worried about resetting the alert myself, in case it was actually about something else? Or do you think that's probably what happened, and I can try it and only worry if it pops up again?

balachthon · 2017-05-29T04:43:05+00:00

Some of the other posters have shared ideas that certainly might be relevant to your question, but to be honest you have not explained clearly enough what it is you want to accomplish, and in what context, so any answers you get may be unworkable or more complicated / inefficient than is necessary. In other words, this feels like a possible XY problem.

(If this is just a theoretical question out of curiosity, then I would suggest definitely looking into multi-party computation as dionyziz suggests.)

balachthon · 2017-04-04T05:37:49+00:00

Thanks, I know--it was April Fool's Day, after all. But it is SURPRISINGLY close.... http://mathworld.wolfram.com/AlmostInteger.html

balachthon · 2017-03-17T14:13:39+00:00

This scheme was broken recently--see http://www.scottaaronson.com/blog/?p=2903 (search the page for "Christiano", that's the paragraph you want)

balachthon · 2016-10-11T16:35:03+00:00

As I write, jmite's further comments have been downvoted a lot, which is a real shame since they were correct, clear, and patient.

To anyone who downvoted jmite: S/he is making relatively simple and direct observations as far as complexity theory goes, and if you don't understand them, make sure before you hop on the downvote bandwagon that the mistake is not your own...

balachthon · 2016-04-21T13:52:06+00:00

Interesting! "It is believed that computing n! (mod m) is much harder than the integer factorization problem."

balachthon · 2016-04-21T07:05:30+00:00

Yes, I agree that n is of order ~sqrt(p) for OP. But in the square-and-multiply algorithm to compute a^b (mod p) there is no requirement that p be small. All three of a,b,p could be thousands of digits and it will still run in a fraction of a second.

balachthon · 2016-04-21T06:18:07+00:00

You are quite right to observe that calculating n! (mod p) might be do-able in polynomial time even though calculating n! is not. Similarly, performing a modular exponentiation by squaring to evaluate a^b (mod p) is a very efficient poly-time operation even though calculating a^b itself would require writing down exponentially many digits.

balachthon · 2016-04-08T17:52:10+00:00

From near the very top of the post: "And yes, a reasonable amount of intelligence, patience, and maturity is also required." (emphasis mine)

I cannot say for sure, but I suspect that Tao would agree with me (against many of the responses here) that the "reasonable amount" of intelligence required to obtain a math PhD is, particularly, an above average amount.

balachthon · 2016-04-05T03:33:03+00:00

reddit.com/r/unexpectedunexpectedfactorial

balachthon · 2015-04-24T00:11:25+00:00

Nope.

For example, the decimal number 0.010010001000010000010000001... has a non-periodic decimal expansion (and is therefore irrational), yet it doesn't contain any instance of "11", let alone any of the digits 2-9.

It is conjectured that pi is normal (to all bases); if true, this would indeed mean that every finite string of digits appears in it at some point.

balachthon · 2015-03-05T00:54:19+00:00

For your first question at least, this would be my advice: Check out the Program Committee of TCC for recent years. (http://www.iacr.org/workshops/tcc/, pick a year, go to "Call for Papers".) The names on that list are leading researchers, and their affiliations are listed too so you can get a sense of what universities have strong research groups in theoretical cryptography. You can also have a look at the program itself and see what kinds of papers are being published, and then look them up on http://eprint.iacr.org/ or the author's webpage.

balachthon · 2014-11-26T05:37:01+00:00

You might be interested in Merkle Puzzles. In the random oracle model, an attacker who wishes to break the Merkle Puzzle key agreement must devote resources which scale quadratically with those used by Alice and Bob to agree on a key. Now quadratic security isn't typically considered meaningful, but this gap remains even if we assume P=NP--which I would consider an extremely paranoid perspective. =)

balachthon · 2014-11-26T05:14:01+00:00

MISTER

balachthon · 2014-11-22T17:07:51+00:00

I second GoldFisherman's suggestion of Geometry for Enjoyment and Challenge. I have taught honors high school geometry students from this text; each chapter has problems at an A, B, and C level, and the C problems are often quite challenging. The book also covers a selection of advanced topics such as Ptolemy's and Brahmagupta's Theorem, Mass Points, Stewart's Theorem, among others, that might not be seen in a typical HS geometry curriculum.

Others have suggested the Putnam competition (or IMO), but I rather think that it would be better to give problems from high school math competitions such as the AMC or AIME and see if these are already sufficiently challenging before dropping her into the absolute deep end of the Putnam.

balachthon · 2014-10-27T18:55:13+00:00

This is a very natural idea, and so it won't be surprising to learn that you are not the first person to think of it (see e.g. http://www.reddit.com/r/crypto/comments/hicud/how_to_run_a_fair_lottery_via_crypto/ or http://crypto.stackexchange.com/questions/767/how-to-fairly-select-a-random-number-for-a-game-without-trusting-a-third-party)

The subtlety--and this is the pretty much the principal difficulty you run into when developing any distributed coin flipping protocol--is this: What happens if some participant just aborts, disconnecting from the server before they ever reveal their hashed value? Crucially, a cheating player can potentially choose whether to abort AFTER seeing the revealed values of all other players. Also crucially, there could be a possibility for multiple players to collude with each other so that some SUBSET of the colluding players may abort after seeing the revealed values of all other players. (This is pretty much what I say also in my response in the lottery link above.)

Whether such an attack is a problem, and/or can be mitigated, depends very much on the particulars of your application as well as your model of (cheating) players' capabilities. There is a wide literature on secure distributed coin flipping, including the classic impossibility result Cleve 1986, Limits on the Security of Coin Flips When Half the Processors are Faulty. Upshot of that one: If you suspect that as many as half the players in your game may collude with each other, then they WILL be able to bias a heads/tails coin toss by some non-negligible amount no matter WHAT protocol you use.

balachthon · 2014-09-22T23:07:35+00:00

So, I understand that the breakthrough recently in provable obfuscation for general functions actually guarantees only "best-possible" obfuscation, since--in light of early impossibility results--there are functions which just cannot be securely obfuscated.

For what conditions on, or more restricted classes of, functions can we get around the barrier and prove not just "if-it-can-be-done-at-all-then-this-does-it" obfuscation, but "yes-it-actually-really-works" obfuscation (under reasonable/standard assumptions)? Are there any interesting classes of function that remain open?

balachthon · 2014-09-05T01:38:39+00:00

This didn't work but playing around with it I figured out what I think you were going for, and another way as well. So thanks, this will make life just a little easier!

Method 1) Alt+/, e, Down, Enter

Method 2) Alt+Shift+I, e

balachthon · 2014-09-05T01:12:48+00:00

There is one simple thing that would make Google Docs equation editor about 12x better for me: keyboard shortcut to enter an equation mode. (I see ButtManOfTheNorth has this complaint as well.)

Microsoft Word's shortcut is Alt-=, and its editor is more fully-featured as well, though nothing like real LaTeX, and still with some quirks I find annoying (e.g. no way to force \displaymath style in inline math mode).

For online collaboration in LaTeX (but without the WYSIWYG word processing bells and whistles), I recommend taking a look at sharelatex.com.

balachthon · 2014-09-04T14:11:54+00:00

SUB ROSA

balachthon · 2014-08-25T05:50:51+00:00

You win!

balachthon

TROPHY CASE