giomasce

7 ms·

241.
by giomasce 6y ago
Also, you can decide to reveal your secret after having discussed the matter with a lawyer.
242.
by giomasce 6y ago
I feel a lot of survivor bias here.
243.
by giomasce 6y ago
The words "driver", "license" and "crash" have two sets of meaning in software and cars domains. Tesla intersects both domains. Took me a while to gather what was happening. At the beginning I thought the perso
244.
by giomasce 6y ago
Totally agree. Just let me point out that this is not, theoretically speaking, an FHE computation. It is an "FHE plus a termination oracle" computation. Maybe no big difference in practice, but totally a different thing in theory,
245.
by giomasce 6y ago
> The task is not that; instead we assume that we already have a table that correctly describes the TM's maps from bounded input to output when they terminate. His claim is that this table can be expressed as a function in addition
246.
by giomasce 6y ago
That's my point: not any Turing machine can be implemented with FHE, because FHE must have bounded execution time.
247.
by giomasce 6y ago
And that's precisely what I challenged. You can't even describe a Turing machine on one single input (using whatever operations you like) if you're not able to determine if that machine is going to terminate. And in general y
248.
by giomasce 6y ago
What does "functionally complete" means for you?
249.
by giomasce 6y ago
I agree. These are totally legitimate ways to still use FHE even if you need to compute a Turing-complete thing. It doesn't thwart my theoretical point, because you're not doing pure FHE anymore: you're using FHE for the &quo
250.
by giomasce 6y ago
No, you cannot convert an arbitrary Turing machine to a circuit. Not even if you assume a bounded input size. Not even if you assume just one single allowed input, because you might not be able to know if that Turing machine ever terminates
251.
by giomasce 6y ago
I am not saying there are not practical ways to do useful computation with this stuff. I am commenting on the theoretical remark that any algorithm (as in any Turing machine) can be executed with FHE, which is false, as it can be proved tha
252.
by giomasce 6y ago
Sure, that was already mentioned on another comment, but that's not enough for proper branching. You also need while loops. See also comment https://news.ycombinator.com/item?id=24018284 .
253.
by giomasce 6y ago
Yes, but you can't branch on the result, because you don't know if the result is zero or not. So your program needs to have fixed control flow, i.e., you cannot implement arbitrary programs.
254.
by giomasce 6y ago
To me the practical problem with FHE is that, if it costs 20 times doing the equivalent non-encrypted computations, it is cheaper to do it on your premises rather than rent 20x the same computational power from a cloud host, unless the clou
255.
by giomasce 6y ago
For this scheme you need to trust the CPU (meaning its maker, its implementation, etc). The point of FHE is not trusting anybody.
256.
by giomasce 6y ago
You can't unroll an unbounded loop, you don't know how many times to unroll. To have Turing machine you need to need to know from your program state if you reached the end of your loop or not (i.e., you need to evaluate the "
257.
by giomasce 6y ago
No, it can't. FHE cannot emulate the whole MOV, especially the features that make it Turing-complete.
258.
by giomasce 6y ago
The comment by "Ibmresearcher" says that: > Once one can do multiplication and addition all other operations can be bootstrapped from there so you can indeed do anything a Turing complete computer can do. This is apparently ite
259.
by giomasce 6y ago
The rule is not preventing anything. The website is redirecting your requests on a static page.
260.
by giomasce 6y ago
Yes, as the GP this is my original point. I completely agree that they are moving to GitHub. I don't think there are referentially false sentences in the OP, it's more a remark about the language (which is not a secondary aspect).
261.
by giomasce 6y ago
That would make it even more wrong, since it seems from the JEPs that, at least for the time being, they're only using GitHub as hosting service. No wikis, PRs, issues and so on.
262.
by giomasce 6y ago
It bothers me that they repeatedly write about a migration "from Mercurial to GitHub", rather than "from Mercurial to Git". It seems to imply that GitHub hosting is the only way to run Git. It's perfectly fine to sa
263.
by giomasce 6y ago
If someone gives you a gift, you are not forced to accept it. Tor paid employees probably have something else to work onto, given that they are paid my Tor's money, not by the bug reporter's money. Frankly, the issue about blockin
264.
by giomasce 6y ago
I am not sure of what is the historical order of things: in Latin the word "anus" does also mean "ring" or "circle", although it later came to only retain its anatomical meaning, while its diminutive retained t
265.
by giomasce 6y ago
Ah, my bad, sorry.
266.
by giomasce 6y ago
Buses are often called "pullman" in Italy. For long time I thought it was because the pull men (and women) along the road, but instead it appears there are named after some George Pullman. Also in Italy, the loop highway around Ro
267.
by giomasce 6y ago
No, Ian is just another name (Ian Murdock, the founder of Debian). Deb is after Debra, who then was his girlfriend and then wife. After that Murdock left Debian and the two divorced, but the name had stuck and there it is still now.
268.
by giomasce 6y ago
> And to your point about referee: the cop isn't a referee. Maybe, but then the point is that the referee is their friend. If I go and punch a police officer, I'm going to the jail. If the police officer comes and punches me ou
269.
by giomasce 6y ago
I tried to read the comment, but don't quite understand: what is the problem GCC is trying to solve there?
270.
by giomasce 6y ago
Yes, I was more or less inspired by TeX's algorithm.

More ›